답안 #593389

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
593389	2022-07-11T03:09:17 Z	haojiandan	송금 (JOI19_remittance)	C++14	100 / 100	295 ms	59856 KB

remittance

// wygzgyw
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
	t=0; char ch=getchar(); int f=1;
	while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
	do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
template <typename T> void write(T t) {
	if (t<0) { putchar('-'); write(-t); return; }
	if (t>9) write(t/10);
	putchar('0'+t%10);
}
template <typename T> void writeln(T t) { write(t); puts(""); }
#define MP make_pair
typedef long long ll;
const int maxn=(1e6)+10;
int n;
ll a[maxn],b[maxn],c[maxn];
struct node {
	ll x,y;
	friend node operator * (node A,ll B) { A.x*=B,A.y*=B; return A; }
} d[maxn];
int main() {
	read(n);
	for (int i=0;i<n;i++) read(a[i]),read(b[i]);
	d[n-1].x=2,d[n-1].y=b[0]-a[0];
	for (int i=n-2;i>=0;i--) {
		d[i]=(d[i+1]*2);
		d[i].y+=b[i+1]-a[i+1];
	}
	if (abs(d[0].y)%abs(1-d[0].x)!=0) { puts("No"); return 0; }
	c[0]=d[0].y/(1-d[0].x);
	if (c[0]<0) { puts("No"); return 0; }
	for (int i=1;i<n;i++) {
		c[i]=d[i].x*c[0]+d[i].y;
		if (c[i]<0) { puts("No"); return 0; }
	}
	for (int rd=0;rd<=40;rd++) {
		for (int i=0;i<n;i++) if (c[i]) {
			ll mn=min(a[i]/2,c[i]);
			a[i]-=mn*2,c[i]-=mn,a[(i+1)%n]+=mn;
		}
	}
	for (int i=0;i<n;i++) if (c[i]) { puts("No"); return 0; }
	puts("Yes");
	return 0;
}
/*
  0. Enough array size? Enough array size? Enough array size? Integer overflow?
  
  1. Think TWICE, Code ONCE!
  Are there any counterexamples to your algo?
    
  2. Be careful about the BOUNDARIES!
  N=1? P=1? Something about 0?
    
  3. Do not make STUPID MISTAKES!
  Time complexity? Memory usage? Precision error?
*/

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 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	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 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	212 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 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	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 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	212 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	0 ms	340 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	0 ms	340 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	340 KB	Output is correct
47	Correct	0 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	212 KB	Output is correct
53	Correct	0 ms	212 KB	Output is correct
54	Correct	1 ms	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	1 ms	340 KB	Output is correct
57	Correct	0 ms	340 KB	Output is correct
58	Correct	0 ms	212 KB	Output is correct
59	Correct	0 ms	340 KB	Output is correct
60	Correct	0 ms	212 KB	Output is correct
61	Correct	0 ms	312 KB	Output is correct
62	Correct	0 ms	340 KB	Output is correct

Subtask #3
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 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	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 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	212 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	0 ms	340 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	0 ms	340 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	340 KB	Output is correct
47	Correct	0 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	212 KB	Output is correct
53	Correct	0 ms	212 KB	Output is correct
54	Correct	1 ms	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	1 ms	340 KB	Output is correct
57	Correct	0 ms	340 KB	Output is correct
58	Correct	0 ms	212 KB	Output is correct
59	Correct	0 ms	340 KB	Output is correct
60	Correct	0 ms	212 KB	Output is correct
61	Correct	0 ms	312 KB	Output is correct
62	Correct	0 ms	340 KB	Output is correct
63	Correct	106 ms	50868 KB	Output is correct
64	Correct	77 ms	43240 KB	Output is correct
65	Correct	142 ms	58324 KB	Output is correct
66	Correct	80 ms	43440 KB	Output is correct
67	Correct	85 ms	44720 KB	Output is correct
68	Correct	93 ms	47052 KB	Output is correct
69	Correct	141 ms	58700 KB	Output is correct
70	Correct	47 ms	43336 KB	Output is correct
71	Correct	50 ms	38592 KB	Output is correct
72	Correct	58 ms	44752 KB	Output is correct
73	Correct	116 ms	56908 KB	Output is correct
74	Correct	40 ms	37864 KB	Output is correct
75	Correct	53 ms	37868 KB	Output is correct
76	Correct	54 ms	40768 KB	Output is correct
77	Correct	106 ms	51096 KB	Output is correct
78	Correct	276 ms	51044 KB	Output is correct
79	Correct	82 ms	50892 KB	Output is correct
80	Correct	121 ms	51052 KB	Output is correct
81	Correct	79 ms	50612 KB	Output is correct
82	Correct	248 ms	43340 KB	Output is correct
83	Correct	39 ms	35428 KB	Output is correct
84	Correct	73 ms	43332 KB	Output is correct
85	Correct	155 ms	59856 KB	Output is correct
86	Correct	131 ms	58360 KB	Output is correct
87	Correct	295 ms	52044 KB	Output is correct
88	Correct	125 ms	52096 KB	Output is correct

답안 #593389

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