# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
203925 | 2020-02-23T03:47:42 Z | AQT | 송금 (JOI19_remittance) | C++14 | 5 ms | 376 KB |
#include <bits/stdc++.h> using namespace std; int N; long long arr[1000005], brr[1000005]; int main(){ cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; for(int i = 0; i<N; i++){ cin >> arr[i] >> brr[i]; } int cnt = 0; for(int i = 0; cnt < N; cnt++, i++, i%=N){ if(arr[i] == 1 && brr[i] == 0 || arr[i] <= brr[i]){ cnt++; } else{ long long d = arr[i]-brr[i]; d += d&1; if(d > arr[i]){ d-=2; } arr[(i+1)%N] += d/2; arr[i] -= d; cnt = 0; } } bool b = 1; for(int i = 0; i<N; i++){ if(arr[i] != brr[i]){ b = 0; } } cout << (b ? "Yes" : "No") << endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Incorrect | 5 ms | 376 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Incorrect | 5 ms | 376 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Incorrect | 5 ms | 376 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |