답안 #291837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
291837	2020-09-05T20:45:12 Z	maximath_1	송금 (JOI19_remittance)	C++11	100 / 100	267 ms	28700 KB

remittance

#include <iostream>
#include <array>
#include <vector>
#include <algorithm>
#include <string.h>
#include <set>
#include <math.h>
#include <numeric>
#include <assert.h>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <queue>
using namespace std;
#define ll long long
#define ld long double
#define endl "\n"
const ll inf = 1e9 + 69;
const ld pi = 3.14159265358979323L;
const ld eps = 1e-15;
const int N = 1e5 + 5;

void setIn(string s){freopen(s.c_str(), "r", stdin);}
void setOut(string s){freopen(s.c_str(), "w", stdout);}
void unsyncIO(){cin.tie(0) -> sync_with_stdio(0);}
void setIO(string s = ""){
	unsyncIO();
	if(s.size()){
		setIn(s + ".in");
		setOut(s + ".out");
	}
}

int n, a[1000005], b[1000005];

int main(){
	setIO();

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

	for(bool done = 0; !done;){
		done = 1;
		for(int i = 0; i < n; i ++){
			if(a[i] > 1 && a[i] > b[i]){
				int x = max(1, (a[i] - b[i]) / 2);
				a[i] -= x * 2;
				a[(i + 1) % n] += x;
				done = 0;
			}
		}
	}

	bool ok = 1;
	for(int i = 0; i < n; i ++)
		if(a[i] != b[i]) ok = 0;

	if(ok) cout << "Yes\n";
	else cout << "No\n";

	return 0;
}

Compilation message

remittance.cpp: In function 'void setIn(std::string)':
remittance.cpp:25:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   25 | void setIn(string s){freopen(s.c_str(), "r", stdin);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
remittance.cpp: In function 'void setOut(std::string)':
remittance.cpp:26:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   26 | void setOut(string s){freopen(s.c_str(), "w", stdout);}
      |                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	1 ms	416 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	1 ms	288 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 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	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	0 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	1 ms	416 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	1 ms	288 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 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	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	0 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	0 ms	384 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	0 ms	384 KB	Output is correct
42	Correct	0 ms	384 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	0 ms	384 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	0 ms	384 KB	Output is correct
48	Correct	1 ms	384 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	1 ms	384 KB	Output is correct
53	Correct	0 ms	384 KB	Output is correct
54	Correct	1 ms	384 KB	Output is correct
55	Correct	0 ms	384 KB	Output is correct
56	Correct	1 ms	384 KB	Output is correct
57	Correct	0 ms	384 KB	Output is correct
58	Correct	0 ms	384 KB	Output is correct
59	Correct	0 ms	384 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	1 ms	416 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	1 ms	288 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 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	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	0 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	0 ms	384 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	0 ms	384 KB	Output is correct
42	Correct	0 ms	384 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	0 ms	384 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	0 ms	384 KB	Output is correct
48	Correct	1 ms	384 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	1 ms	384 KB	Output is correct
53	Correct	0 ms	384 KB	Output is correct
54	Correct	1 ms	384 KB	Output is correct
55	Correct	0 ms	384 KB	Output is correct
56	Correct	1 ms	384 KB	Output is correct
57	Correct	0 ms	384 KB	Output is correct
58	Correct	0 ms	384 KB	Output is correct
59	Correct	0 ms	384 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	251 ms	27492 KB	Output is correct
64	Correct	147 ms	12152 KB	Output is correct
65	Correct	243 ms	27128 KB	Output is correct
66	Correct	145 ms	12092 KB	Output is correct
67	Correct	148 ms	13564 KB	Output is correct
68	Correct	160 ms	15864 KB	Output is correct
69	Correct	246 ms	27592 KB	Output is correct
70	Correct	154 ms	12244 KB	Output is correct
71	Correct	151 ms	13560 KB	Output is correct
72	Correct	166 ms	15956 KB	Output is correct
73	Correct	244 ms	27512 KB	Output is correct
74	Correct	145 ms	12024 KB	Output is correct
75	Correct	148 ms	13560 KB	Output is correct
76	Correct	157 ms	15864 KB	Output is correct
77	Correct	242 ms	27572 KB	Output is correct
78	Correct	187 ms	19832 KB	Output is correct
79	Correct	188 ms	19812 KB	Output is correct
80	Correct	187 ms	19832 KB	Output is correct
81	Correct	194 ms	19832 KB	Output is correct
82	Correct	128 ms	12024 KB	Output is correct
83	Correct	126 ms	12124 KB	Output is correct
84	Correct	134 ms	12132 KB	Output is correct
85	Correct	267 ms	28700 KB	Output is correct
86	Correct	267 ms	28664 KB	Output is correct
87	Correct	212 ms	20856 KB	Output is correct
88	Correct	220 ms	20984 KB	Output is correct

답안 #291837

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