Submission #552082

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
552082	2022-04-22T11:44:39 Z	RaresFelix	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	340 KB

remittance

#include <bits/stdc++.h>
#define MN 1000071
#pragma GCC optimize("O3,avx2")
using ll = long long;
using namespace std;
ll n, A[MN], B[MN];
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> A[i] >> B[i];
    int ok;
    do {
        ok = 0;
        for(int i = 1; i <= n; ++i) {
            if(A[i] > B[i]) {
                ll v;
                ok = 1, v = (A[i] - B[i] + 1) >> 1;
                A[i + 1] += v;
                A[i] -= v << 1;
            }
        }
        A[1] += A[n + 1];
        A[n + 1] = 0;
    } while(ok);
    ok = 1;
    for(int i = 1; i <= n; ++i) if(A[i] != B[i]) ok = 0;
    cout << (ok ? "Yes\n" : "No\n");
    return 0;
}

Compilation message

remittance.cpp:3:31: warning: bad option '-favx2' to pragma 'optimize' [-Wpragmas]
    3 | #pragma GCC optimize("O3,avx2")
      |                               ^
remittance.cpp:7:10: warning: bad option '-favx2' to attribute 'optimize' [-Wattributes]
    7 | int main() {
      |          ^

Subtask #1

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	328 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Incorrect	1 ms	332 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	328 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Incorrect	1 ms	332 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	328 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Incorrect	1 ms	332 KB	Output isn't correct
21	Halted	0 ms	0 KB	-