oj.uz

Submission #963023

# Submission time Handle Problem Language Result Execution time Memory
963023 2024-04-14T11:12:15 Z happy_node Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 2648 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int MX=1e6+5;
int N;
ll A[MX], B[MX];
 
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
 
	cin>>N;
	for(int i=0;i<N;i++) cin>>A[i]>>B[i];
 
	for(int k=0;k<51;k++) {
		for(int i=N-1;i>=0;i--) {
			if(B[i]>A[i]) {
				ll d=B[i]-A[i];
				if(i==0) {
					B[N-1]+=2*d;
				} else {
					B[i-1]+=2*d;
				}
				B[i]=A[i];
			}
		}
	}


 
	bool ok=1;
	for(int i=0;i<N;i++) 
		ok&=A[i]==B[i];
 
	cout<<(ok?"Yes":"No")<<'\n';
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2460 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2460 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2460 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Halted 0 ms 0 KB -