oj.uz

Submission #489747

# Submission time Handle Problem Language Result Execution time Memory
489747 2021-11-24T07:25:22 Z AA_Surely Remittance (JOI19_remittance) C++14
100 / 100
 203 ms 26244 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0); 

using namespace std;
typedef long long 		LL;

const int MAXN = 1e6 + 1;

int n;
LL as[MAXN], bs[MAXN];

int main() {
    IOS;
    cin >> n;
    F0R(i, n) cin >> as[i] >> bs[i];
    
    bool changed = 1;
    while (changed) {
        changed = 0;
        /*
        cout << "NOW: ";
        F0R(i, n) cout << as[i] << ' ';
        cout << endl;
        */

        F0R(i, n - 1) {
            if (as[i] > bs[i]) {
                if ((as[i] & 1) == (bs[i] & 1)) {
                    as[i + 1] += (as[i] - bs[i]) >> 1;
                    as[i] = bs[i];
                    changed = 1;
                }

                else if (bs[i]) {
                    as[i + 1] += ((as[i] - bs[i]) >> 1) + 1;
                    as[i] = bs[i] - 1;
                    changed = 1;
                }

                else {
                    if (as[i] > 1) changed = 1;
                    as[i + 1] += ((as[i] - bs[i]) >> 1);
                    as[i] = bs[i] + 1;
                }
            }
        }

        if (as[n - 1] > bs[n - 1]) {
            if ((as[n - 1] & 1) == (bs[n - 1] & 1)) {
                as[0] += (as[n - 1] - bs[n - 1]) >> 1;
                as[n - 1] = bs[n - 1];
                changed = 1;
            }

            else if (bs[n - 1]) {
                as[0] += ((as[n - 1] - bs[n - 1]) >> 1) + 1;
                as[n - 1] = bs[n - 1] - 1;
                changed = 1;
            }

            else {
                if (as[n - 1] > 1) changed = 1;
                as[0] += ((as[n - 1] - bs[n - 1]) >> 1);
                as[n - 1] = bs[n - 1] + 1;
            }
        }

        if (!changed) break;
    }

    F0R(i, n) if (as[i] != bs[i]) {
        cout << "No";
        return 0;
    }

    cout << "Yes";
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 316 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 320 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 316 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 320 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 316 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 0 ms 324 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 0 ms 320 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 0 ms 332 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 316 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 320 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 316 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 0 ms 324 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 0 ms 320 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 0 ms 332 KB Output is correct
63 Correct 185 ms 18396 KB Output is correct
64 Correct 103 ms 19800 KB Output is correct
65 Correct 193 ms 16628 KB Output is correct
66 Correct 106 ms 19736 KB Output is correct
67 Correct 112 ms 21180 KB Output is correct
68 Correct 124 ms 23512 KB Output is correct
69 Correct 186 ms 16740 KB Output is correct
70 Correct 102 ms 19848 KB Output is correct
71 Correct 110 ms 21128 KB Output is correct
72 Correct 122 ms 23564 KB Output is correct
73 Correct 186 ms 16532 KB Output is correct
74 Correct 103 ms 19764 KB Output is correct
75 Correct 110 ms 21144 KB Output is correct
76 Correct 122 ms 23604 KB Output is correct
77 Correct 179 ms 16452 KB Output is correct
78 Correct 156 ms 26244 KB Output is correct
79 Correct 147 ms 26144 KB Output is correct
80 Correct 149 ms 25944 KB Output is correct
81 Correct 146 ms 25988 KB Output is correct
82 Correct 103 ms 19828 KB Output is correct
83 Correct 88 ms 19788 KB Output is correct
84 Correct 88 ms 19792 KB Output is correct
85 Correct 198 ms 16452 KB Output is correct
86 Correct 203 ms 16464 KB Output is correct
87 Correct 170 ms 25540 KB Output is correct
88 Correct 164 ms 25408 KB Output is correct