답안 #143003

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
143003	2019-08-12T14:39:32 Z	ryansee	송금 (JOI19_remittance)	C++14	100 / 100	593 ms	36472 KB

remittance

#define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second	
#define db 0
#define EPS (1e-7)    //0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (1000006)
#define ll long long int 
#define ld long double
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for(ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define MSB(bm) (63-__builtin_clzll((bm)))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair <ll, ll> pi;
typedef pair <ll, pi> spi;
typedef pair <pi, pi> dpi;
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss
string to_string(char c) {string s(1,c);return s;}string to_string(bool b){return (b ? "true" : "false");}template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}void degug_out() { cerr << endl; }template <typename Head, typename... Tail>void degug_out(Head H, Tail... T) {cerr << " " << to_string(H);degug_out(T...);}inline ll gcd(ll a,ll b){if(a>b)swap(a,b);if(a==0)return b;return gcd(b%a,a);}
#ifdef LOCAL
// #define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr if(0)cout
#endif
ll n,A[MAXN],B[MAXN],o[MAXN];
int main()
{
	FAST
	cin>>n;
	FOR(i,0,n)cin>>A[i]>>B[i];
	FOR(j,0,80){
		FOR(i,0,n){
			if(A[i]<=B[i]||A[i]<2)continue;
			ll trans=(A[i]-B[i]+1)/2; if(2*trans>A[i]) trans--; assert(A[i]-2*trans>=0);
			A[i]-=(trans*2);
			A[(i+1)%n]+=trans;
		}
	}
	FOR(i,0,n)if(A[i]!=B[i]){cout<<"No\n";return 0;}
	cout<<"Yes\n";
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	376 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	504 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	408 KB	Output is correct
10	Correct	2 ms	380 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	376 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	380 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	380 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	380 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	376 KB	Output is correct
30	Correct	2 ms	380 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	3 ms	376 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	376 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	504 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	408 KB	Output is correct
10	Correct	2 ms	380 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	376 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	380 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	380 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	380 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	376 KB	Output is correct
30	Correct	2 ms	380 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	3 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	400 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	2 ms	376 KB	Output is correct
40	Correct	2 ms	376 KB	Output is correct
41	Correct	3 ms	476 KB	Output is correct
42	Correct	2 ms	376 KB	Output is correct
43	Correct	2 ms	376 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	2 ms	380 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	508 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	380 KB	Output is correct
56	Correct	2 ms	504 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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	376 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	504 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	408 KB	Output is correct
10	Correct	2 ms	380 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	376 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	380 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	380 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	380 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	376 KB	Output is correct
30	Correct	2 ms	380 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	3 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	400 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	2 ms	376 KB	Output is correct
40	Correct	2 ms	376 KB	Output is correct
41	Correct	3 ms	476 KB	Output is correct
42	Correct	2 ms	376 KB	Output is correct
43	Correct	2 ms	376 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	2 ms	380 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	508 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	380 KB	Output is correct
56	Correct	2 ms	504 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	421 ms	35384 KB	Output is correct
64	Correct	394 ms	20088 KB	Output is correct
65	Correct	450 ms	34980 KB	Output is correct
66	Correct	593 ms	20088 KB	Output is correct
67	Correct	383 ms	21468 KB	Output is correct
68	Correct	305 ms	23672 KB	Output is correct
69	Correct	417 ms	35604 KB	Output is correct
70	Correct	577 ms	19948 KB	Output is correct
71	Correct	398 ms	21260 KB	Output is correct
72	Correct	322 ms	23800 KB	Output is correct
73	Correct	418 ms	35420 KB	Output is correct
74	Correct	583 ms	20088 KB	Output is correct
75	Correct	383 ms	21496 KB	Output is correct
76	Correct	308 ms	23672 KB	Output is correct
77	Correct	431 ms	35448 KB	Output is correct
78	Correct	297 ms	27592 KB	Output is correct
79	Correct	297 ms	27768 KB	Output is correct
80	Correct	315 ms	27676 KB	Output is correct
81	Correct	305 ms	27640 KB	Output is correct
82	Correct	210 ms	19896 KB	Output is correct
83	Correct	204 ms	19840 KB	Output is correct
84	Correct	233 ms	19892 KB	Output is correct
85	Correct	447 ms	36472 KB	Output is correct
86	Correct	449 ms	36472 KB	Output is correct
87	Correct	305 ms	28920 KB	Output is correct
88	Correct	304 ms	28732 KB	Output is correct

답안 #143003

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