답안 #393881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393881	2021-04-24T18:44:55 Z	arwaeystoamneg	송금 (JOI19_remittance)	C++17	100 / 100	280 ms	28580 KB

remittance

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 1000005;
int a[MAX], b[MAX];
int n;
int main() 
{
	setIO("test1");
	cin >> n;
	F0R(i, n)
	{
		cin >> a[i] >> b[i];
	}
	int flag = 0;
	do
	{
		flag = 0;
		F0R(i, n)
		{
			int ne = (i == n - 1 ? 0 : i + 1);
			int v = (a[i] - b[i] + 1) / 2;
			if (a[i] - 2 * v < 0)v--;
			if (v <= 0)continue;
			a[i] -= 2 * v;
			a[ne] += v;
			flag = 1;
		}
	} while (flag);
	/*
	priority_queue<pii>todo;
	F0R(i, n)if (a[i] - b[i] > 0)todo.push({ a[i] - b[i],i });
	while (sz(todo))
	{
		pii t = todo.top();
		todo.pop();
		if (a[t.s] - b[t.s] != t.f)continue;
		int v = (a[t.s] - b[t.s] + 1) / 2;
		if (a[t.s] - 2 * v < 0)v--;
		if (v <= 0)continue;
		a[t.s] -= 2 * v;
		int ne = (t.s + 1 == n ? 0 : t.s + 1);
		a[ne] += v;
		if (a[ne] - b[ne] > 0)
		{
			int v = (a[ne] - b[ne] + 1) / 2;
			if (a[ne] - 2 * v < 0)v--;
			if (v >= 1)
				todo.push({ a[ne] - b[ne],ne });
		}
	}*/
	F0R(i, n)
	{
		if (a[i] != b[i])
		{
			cout << "No" << endl;
			return 0;
		}
	}
	cout << "Yes" << endl;
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct
38	Correct	1 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	1 ms	252 KB	Output is correct
42	Correct	1 ms	204 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	1 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	208 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	1 ms	204 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Correct	1 ms	204 KB	Output is correct
53	Correct	1 ms	332 KB	Output is correct
54	Correct	1 ms	332 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	1 ms	332 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	1 ms	204 KB	Output is correct
59	Correct	1 ms	204 KB	Output is correct
60	Correct	1 ms	332 KB	Output is correct
61	Correct	1 ms	332 KB	Output is correct
62	Correct	0 ms	332 KB	Output is correct

Subtask #3
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct
38	Correct	1 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	1 ms	252 KB	Output is correct
42	Correct	1 ms	204 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	1 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	208 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	1 ms	204 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Correct	1 ms	204 KB	Output is correct
53	Correct	1 ms	332 KB	Output is correct
54	Correct	1 ms	332 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	1 ms	332 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	1 ms	204 KB	Output is correct
59	Correct	1 ms	204 KB	Output is correct
60	Correct	1 ms	332 KB	Output is correct
61	Correct	1 ms	332 KB	Output is correct
62	Correct	0 ms	332 KB	Output is correct
63	Correct	237 ms	8320 KB	Output is correct
64	Correct	139 ms	8016 KB	Output is correct
65	Correct	229 ms	8104 KB	Output is correct
66	Correct	141 ms	12028 KB	Output is correct
67	Correct	147 ms	13380 KB	Output is correct
68	Correct	161 ms	15688 KB	Output is correct
69	Correct	236 ms	27424 KB	Output is correct
70	Correct	140 ms	11972 KB	Output is correct
71	Correct	145 ms	13380 KB	Output is correct
72	Correct	159 ms	15800 KB	Output is correct
73	Correct	237 ms	27448 KB	Output is correct
74	Correct	139 ms	12012 KB	Output is correct
75	Correct	147 ms	13392 KB	Output is correct
76	Correct	159 ms	15792 KB	Output is correct
77	Correct	237 ms	27460 KB	Output is correct
78	Correct	192 ms	19744 KB	Output is correct
79	Correct	188 ms	19668 KB	Output is correct
80	Correct	186 ms	19716 KB	Output is correct
81	Correct	190 ms	19740 KB	Output is correct
82	Correct	124 ms	11928 KB	Output is correct
83	Correct	129 ms	11980 KB	Output is correct
84	Correct	129 ms	12036 KB	Output is correct
85	Correct	280 ms	28580 KB	Output is correct
86	Correct	263 ms	28572 KB	Output is correct
87	Correct	223 ms	20916 KB	Output is correct
88	Correct	210 ms	20800 KB	Output is correct

답안 #393881

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