ProgrammingProblems/uva11093.cpp at master · rishikesha/ProgrammingProblems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;
int p[100005], q[100005];

int main() {
    int T;
    cin >> T;

    for(int ca = 0; ca < T; ca++ ) {
        int N, pp, qq;
        int b = pp = qq = 0;
        cin >> N;

        for(int i=0; i<N; i++)
            cin >> p[i];
        for(int i=0; i<N; i++)
            cin >> q[i];

        for (int i = 0; i< 2*N ; i++) {
            pp += p[i%N];
            qq += q[i%N];
            if (pp < qq) {
                pp = 0;
                qq = 0;
                b = i + 1;
            }

            if (b >= N) {
                break;
            }
        }

        if (b >= N) {
            printf("Case %d: Not possible\n", ca+1);
        } else {
            printf("Case %d: Possible from station %d\n", ca+1, b+1);
        }


    }

}