Submission #797218

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
797218	2023-07-29T08:05:27 Z	NothingXD	Remittance (JOI19_remittance)	C++17	100 / 100	327 ms	20980 KB

remittance

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double ld;
typedef complex<ld> point;

void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 1e6 + 10;

ll n, a[maxn], b[maxn];
vector<int> q;
bool mark[maxn];

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);

	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> a[i] >> b[i];
		if (a[i] > b[i]+1){
			q.push_back(i);
			mark[i] = true;
		}
	}

	while(!q.empty()){
		int v = q.back();
		mark[v] = false;
		q.pop_back();
		ll tmp = (a[v]-b[v]) / 2;
		int nxt = v+1;
		if (nxt == n+1) nxt = 1;
		a[nxt] += tmp;
		a[v] -= 2 * tmp;
		if (!mark[nxt] && a[nxt] > b[nxt]+1){
			q.push_back(nxt);
			mark[nxt] = true;
		}
	}

	bool ans = true;

	for (int i = 1; i <= n; i++){
		assert(a[i] <= b[i]+1);
		if (a[i] != b[i]) ans = false;
	}
	bool majid = true;
	for (int i = 1; i <= n; i++){
		if (a[i] != b[i]+1) majid = false;
	}
	bool asghar = false;
	for (int i = 1; i <= n; i++){
		if (a[i] != 1) asghar = true;
	}
	//assert(ans == true);
	cout << ((ans || (majid && asghar))? "Yes\n": "No\n");


	return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	216 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	292 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	0 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	352 KB	Output is correct
39	Correct	0 ms	344 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	0 ms	340 KB	Output is correct
42	Correct	0 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	0 ms	340 KB	Output is correct
45	Correct	1 ms	352 KB	Output is correct
46	Correct	0 ms	216 KB	Output is correct
47	Correct	0 ms	344 KB	Output is correct
48	Correct	0 ms	340 KB	Output is correct
49	Correct	0 ms	340 KB	Output is correct
50	Correct	0 ms	340 KB	Output is correct
51	Correct	0 ms	340 KB	Output is correct
52	Correct	0 ms	340 KB	Output is correct
53	Correct	0 ms	340 KB	Output is correct
54	Correct	0 ms	340 KB	Output is correct
55	Correct	0 ms	340 KB	Output is correct
56	Correct	0 ms	340 KB	Output is correct
57	Correct	0 ms	340 KB	Output is correct
58	Correct	0 ms	340 KB	Output is correct
59	Correct	0 ms	340 KB	Output is correct
60	Correct	0 ms	340 KB	Output is correct
61	Correct	0 ms	340 KB	Output is correct
62	Correct	1 ms	340 KB	Output is correct
63	Correct	180 ms	18972 KB	Output is correct
64	Correct	92 ms	17748 KB	Output is correct
65	Correct	253 ms	20436 KB	Output is correct
66	Correct	91 ms	18000 KB	Output is correct
67	Correct	107 ms	19580 KB	Output is correct
68	Correct	138 ms	20004 KB	Output is correct
69	Correct	225 ms	19996 KB	Output is correct
70	Correct	91 ms	18044 KB	Output is correct
71	Correct	107 ms	19676 KB	Output is correct
72	Correct	131 ms	19976 KB	Output is correct
73	Correct	224 ms	19968 KB	Output is correct
74	Correct	92 ms	17944 KB	Output is correct
75	Correct	111 ms	19608 KB	Output is correct
76	Correct	129 ms	19960 KB	Output is correct
77	Correct	229 ms	20004 KB	Output is correct
78	Correct	233 ms	20900 KB	Output is correct
79	Correct	245 ms	20924 KB	Output is correct
80	Correct	234 ms	20948 KB	Output is correct
81	Correct	239 ms	20960 KB	Output is correct
82	Correct	76 ms	15868 KB	Output is correct
83	Correct	77 ms	15844 KB	Output is correct
84	Correct	77 ms	15948 KB	Output is correct
85	Correct	327 ms	20980 KB	Output is correct
86	Correct	275 ms	20896 KB	Output is correct
87	Correct	231 ms	20936 KB	Output is correct
88	Correct	235 ms	20968 KB	Output is correct

Submission #797218

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