Submission #254721

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
254721	2020-07-30T13:40:27 Z	dolphingarlic	Remittance (JOI19_remittance)	C++14	100 / 100	410 ms	16248 KB

remittance

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

long long a[1000000], b[1000000];

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%lld %lld", a + i, b + i);
	if (!accumulate(b, b + n, 0))
		return puts(accumulate(a, a + n, 0) ? "No" : "Yes"), 0;
	for (int i = 0; i < 50; i++) {
		for (int i = 0; i < n; i++) {
			if (a[i] > b[i]) {
				a[(i + 1) % n] += (a[i] - b[i] + 1) / 2;
				a[i] -= (a[i] - b[i] + 1) / 2 * 2;
			}
		}
	}
	bool p = 1;
	for (int i = 0; i < n; i++) p &= (a[i] == b[i]);
	puts(p ? "Yes" : "No");
	return 0;
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
remittance.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld", a + i, b + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	256 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	0 ms	256 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	0 ms	384 KB	Output is correct
34	Correct	0 ms	384 KB	Output is correct
35	Correct	0 ms	256 KB	Output is correct
36	Correct	0 ms	384 KB	Output is correct
37	Correct	0 ms	384 KB	Output is correct
38	Correct	0 ms	256 KB	Output is correct
39	Correct	0 ms	256 KB	Output is correct
40	Correct	0 ms	384 KB	Output is correct
41	Correct	0 ms	256 KB	Output is correct
42	Correct	0 ms	384 KB	Output is correct
43	Correct	0 ms	256 KB	Output is correct
44	Correct	0 ms	384 KB	Output is correct
45	Correct	0 ms	256 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	0 ms	384 KB	Output is correct
48	Correct	0 ms	256 KB	Output is correct
49	Correct	0 ms	384 KB	Output is correct
50	Correct	0 ms	384 KB	Output is correct
51	Correct	0 ms	384 KB	Output is correct
52	Correct	0 ms	256 KB	Output is correct
53	Correct	0 ms	384 KB	Output is correct
54	Correct	0 ms	256 KB	Output is correct
55	Correct	1 ms	384 KB	Output is correct
56	Correct	0 ms	256 KB	Output is correct
57	Correct	0 ms	256 KB	Output is correct
58	Correct	0 ms	384 KB	Output is correct
59	Correct	0 ms	256 KB	Output is correct
60	Correct	0 ms	384 KB	Output is correct
61	Correct	0 ms	384 KB	Output is correct
62	Correct	0 ms	384 KB	Output is correct
63	Correct	410 ms	15992 KB	Output is correct
64	Correct	250 ms	15992 KB	Output is correct
65	Correct	408 ms	15992 KB	Output is correct
66	Correct	224 ms	16120 KB	Output is correct
67	Correct	244 ms	15992 KB	Output is correct
68	Correct	259 ms	15992 KB	Output is correct
69	Correct	407 ms	16248 KB	Output is correct
70	Correct	229 ms	15992 KB	Output is correct
71	Correct	247 ms	16120 KB	Output is correct
72	Correct	258 ms	15992 KB	Output is correct
73	Correct	391 ms	15992 KB	Output is correct
74	Correct	235 ms	15992 KB	Output is correct
75	Correct	243 ms	15992 KB	Output is correct
76	Correct	268 ms	16120 KB	Output is correct
77	Correct	389 ms	16032 KB	Output is correct
78	Correct	237 ms	15996 KB	Output is correct
79	Correct	237 ms	15992 KB	Output is correct
80	Correct	289 ms	15996 KB	Output is correct
81	Correct	297 ms	16168 KB	Output is correct
82	Correct	151 ms	15992 KB	Output is correct
83	Correct	215 ms	15992 KB	Output is correct
84	Correct	176 ms	15992 KB	Output is correct
85	Correct	352 ms	15956 KB	Output is correct
86	Correct	354 ms	15992 KB	Output is correct
87	Correct	203 ms	15996 KB	Output is correct
88	Correct	250 ms	15992 KB	Output is correct

Submission #254721

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