Submission #963328

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
963328	2024-04-14T20:53:43 Z	BhavayGoyal	Remittance (JOI19_remittance)	C++14	100 / 100	190 ms	36452 KB

remittance

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const int linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 1e6+6;
int a[N], b[N];

void sol() {
    int n; cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];

    while (true) {
    	int ct = 0;
    	for (int i = 0; i < n; i++) {
    		if (a[i] > b[i]) {
    			int x = (a[i]-b[i]+1)/2;
    			if (x && a[i]-2*x >= 0) {
    				a[i] -= 2*x;
    				a[(i+1)%n] += x;
    				ct++;
    			}
    		}
	    }
	    if (ct == 0) break;
    }

    for (int i = 0; i < n; i++) {
    	if (a[i] != b[i]) {
    		cout << "No" << endl;
    		return;
    	}
    }

    cout << "Yes" << endl;
}

signed main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	2 ms	2392 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2484 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2648 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	0 ms	2396 KB	Output is correct
29	Correct	1 ms	2392 KB	Output is correct
30	Correct	1 ms	2392 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	1 ms	2392 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2392 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2392 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	0 ms	2396 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	1 ms	2464 KB	Output is correct
48	Correct	1 ms	2396 KB	Output is correct
49	Correct	0 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct
51	Correct	1 ms	2396 KB	Output is correct
52	Correct	1 ms	2396 KB	Output is correct
53	Correct	1 ms	2396 KB	Output is correct
54	Correct	1 ms	2396 KB	Output is correct
55	Correct	1 ms	2396 KB	Output is correct
56	Correct	1 ms	2392 KB	Output is correct
57	Correct	1 ms	2392 KB	Output is correct
58	Correct	1 ms	2396 KB	Output is correct
59	Correct	1 ms	2396 KB	Output is correct
60	Correct	1 ms	2392 KB	Output is correct
61	Correct	0 ms	2396 KB	Output is correct
62	Correct	1 ms	2396 KB	Output is correct
63	Correct	150 ms	16004 KB	Output is correct
64	Correct	104 ms	19948 KB	Output is correct
65	Correct	158 ms	34896 KB	Output is correct
66	Correct	96 ms	19792 KB	Output is correct
67	Correct	97 ms	21532 KB	Output is correct
68	Correct	99 ms	23680 KB	Output is correct
69	Correct	159 ms	35452 KB	Output is correct
70	Correct	89 ms	19964 KB	Output is correct
71	Correct	95 ms	21248 KB	Output is correct
72	Correct	102 ms	23676 KB	Output is correct
73	Correct	156 ms	35312 KB	Output is correct
74	Correct	90 ms	19956 KB	Output is correct
75	Correct	91 ms	21252 KB	Output is correct
76	Correct	111 ms	23636 KB	Output is correct
77	Correct	190 ms	35332 KB	Output is correct
78	Correct	141 ms	27648 KB	Output is correct
79	Correct	130 ms	27540 KB	Output is correct
80	Correct	138 ms	27656 KB	Output is correct
81	Correct	124 ms	27504 KB	Output is correct
82	Correct	72 ms	19796 KB	Output is correct
83	Correct	72 ms	19796 KB	Output is correct
84	Correct	74 ms	19960 KB	Output is correct
85	Correct	165 ms	36412 KB	Output is correct
86	Correct	165 ms	36452 KB	Output is correct
87	Correct	118 ms	28752 KB	Output is correct
88	Correct	123 ms	28756 KB	Output is correct

Submission #963328

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 40.0 / 40.0

Subtask #3 45.0 / 45.0

Subtask #1
15.0 / 15.0

Subtask #2
40.0 / 40.0

Subtask #3
45.0 / 45.0