Submission #159760

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
159760	2019-10-24T13:30:16 Z	gs14004	Remittance (JOI19_remittance)	C++17	100 / 100	760 ms	52160 KB

remittance

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
#define sz(v) ((int)(v).size())
const int MAXN = 1000005;

int n;
lint a[MAXN], b[MAXN], f[MAXN];

void my_ass(bool p){
	if(!p){
		puts("No");
		exit(0);
	}
}

int main(){
	scanf("%d",&n);
	vector<lint> need(n);
	for(int i=0; i<n; i++){
		scanf("%lld %lld",&a[i],&b[i]);
		need[i] = b[i] - a[i];
	}
	if(count(need.begin(), need.end(), 0) == n){
		puts("Yes");
		return 0;
	}
	for(int i=0; i<30; i++){
		for(int j=0; j<n; j++){
			if(need[j] & 1){
				f[j] += (1ll << i);
				need[j]--;
				need[(j+n-1)%n] += 2;
			}
		}
		for(int j=0; j<n; j++) need[j] >>= 1;
	}
	lint tot_bal = *min_element(f, f + n);
	int pos = min_element(f, f + n) - f;
	rotate(a, a + pos, a + n);
	rotate(b, b + pos, b + n);
	for(int i=0; i<n; i++) b[i] += tot_bal;
	for(int i=0; i<n; i++){
		lint toSend = a[i] - b[i];
		if(i == n - 1) my_ass(toSend == 0);
		my_ass(toSend >= 0 && toSend % 2 == 0);
		a[i + 1] += toSend / 2;
		a[i] -= toSend;
	}
	bool good = 0;
	for(int i=0; i<n; i++){
		my_ass(a[i] >= tot_bal);
		if(a[i] > tot_bal) good = 1;
	}
	my_ass(good);
	puts("Yes");
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
remittance.cpp:22: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	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	380 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct

Subtask #2
40.0 / 40.0

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

Subtask #3
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	380 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	380 KB	Output is correct
39	Correct	2 ms	376 KB	Output is correct
40	Correct	2 ms	376 KB	Output is correct
41	Correct	2 ms	376 KB	Output is correct
42	Correct	2 ms	376 KB	Output is correct
43	Correct	2 ms	420 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	2 ms	364 KB	Output is correct
46	Correct	2 ms	376 KB	Output is correct
47	Correct	2 ms	376 KB	Output is correct
48	Correct	2 ms	376 KB	Output is correct
49	Correct	2 ms	376 KB	Output is correct
50	Correct	2 ms	376 KB	Output is correct
51	Correct	2 ms	376 KB	Output is correct
52	Correct	2 ms	376 KB	Output is correct
53	Correct	2 ms	376 KB	Output is correct
54	Correct	2 ms	376 KB	Output is correct
55	Correct	2 ms	376 KB	Output is correct
56	Correct	2 ms	376 KB	Output is correct
57	Correct	2 ms	376 KB	Output is correct
58	Correct	2 ms	376 KB	Output is correct
59	Correct	2 ms	376 KB	Output is correct
60	Correct	2 ms	376 KB	Output is correct
61	Correct	2 ms	376 KB	Output is correct
62	Correct	2 ms	376 KB	Output is correct
63	Correct	714 ms	31748 KB	Output is correct
64	Correct	250 ms	35636 KB	Output is correct
65	Correct	730 ms	50652 KB	Output is correct
66	Correct	259 ms	35580 KB	Output is correct
67	Correct	294 ms	36856 KB	Output is correct
68	Correct	372 ms	39296 KB	Output is correct
69	Correct	760 ms	51164 KB	Output is correct
70	Correct	246 ms	35576 KB	Output is correct
71	Correct	293 ms	36984 KB	Output is correct
72	Correct	384 ms	39276 KB	Output is correct
73	Correct	712 ms	50932 KB	Output is correct
74	Correct	250 ms	35704 KB	Output is correct
75	Correct	302 ms	36908 KB	Output is correct
76	Correct	377 ms	39272 KB	Output is correct
77	Correct	717 ms	51064 KB	Output is correct
78	Correct	627 ms	43192 KB	Output is correct
79	Correct	620 ms	43380 KB	Output is correct
80	Correct	635 ms	43264 KB	Output is correct
81	Correct	643 ms	43292 KB	Output is correct
82	Correct	255 ms	35604 KB	Output is correct
83	Correct	358 ms	35704 KB	Output is correct
84	Correct	171 ms	27896 KB	Output is correct
85	Correct	682 ms	52008 KB	Output is correct
86	Correct	689 ms	52160 KB	Output is correct
87	Correct	340 ms	44408 KB	Output is correct
88	Correct	376 ms	44404 KB	Output is correct

Submission #159760

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