oj.uz

Submission #509945

# Submission time Handle Problem Language Result Execution time Memory
509945 2022-01-14T12:25:23 Z kym Remittance (JOI19_remittance) C++14
100 / 100
 406 ms 36328 KB 
#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = 1000005;

int n;
int A[MAXN];
int B[MAXN];


int32_t main() 
{
	IAMSPEED
	cin >> n;
	FOR(i,1,n) cin >> A[i] >> B[i];
	FOR(ti,1,60) {
		FOR(i,1,n) {
			if(A[i]>B[i]) {
				int amt=(A[i]-B[i]+1)/2;
				if(A[i]-amt*2<0)--amt;
				if(i!=n)A[i+1]+=amt;
				else A[1]+=amt;
				A[i]-=amt*2;
			}
		}
	}
	bool c=1;
	FOR(i,1,n) if(A[i]!=B[i])c=0;
	if(c)cout<<"Yes";
	else cout<<"No";
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 328 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 324 KB Output is correct

Subtask #2
40.0 / 40.0

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

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 328 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 324 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 328 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 0 ms 328 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 0 ms 316 KB Output is correct
45 Correct 1 ms 312 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 428 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 328 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 0 ms 328 KB Output is correct
59 Correct 1 ms 328 KB Output is correct
60 Correct 0 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 265 ms 35176 KB Output is correct
64 Correct 150 ms 19776 KB Output is correct
65 Correct 265 ms 34844 KB Output is correct
66 Correct 151 ms 19784 KB Output is correct
67 Correct 158 ms 21272 KB Output is correct
68 Correct 173 ms 23564 KB Output is correct
69 Correct 255 ms 35296 KB Output is correct
70 Correct 144 ms 19800 KB Output is correct
71 Correct 174 ms 21244 KB Output is correct
72 Correct 195 ms 23592 KB Output is correct
73 Correct 244 ms 35292 KB Output is correct
74 Correct 185 ms 19852 KB Output is correct
75 Correct 157 ms 21156 KB Output is correct
76 Correct 168 ms 23552 KB Output is correct
77 Correct 259 ms 35264 KB Output is correct
78 Correct 394 ms 27608 KB Output is correct
79 Correct 375 ms 27636 KB Output is correct
80 Correct 206 ms 27568 KB Output is correct
81 Correct 205 ms 27580 KB Output is correct
82 Correct 327 ms 19864 KB Output is correct
83 Correct 133 ms 19780 KB Output is correct
84 Correct 149 ms 19740 KB Output is correct
85 Correct 288 ms 36328 KB Output is correct
86 Correct 277 ms 36260 KB Output is correct
87 Correct 406 ms 28532 KB Output is correct
88 Correct 234 ms 28600 KB Output is correct