답안 #514922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
514922 2022-01-18T19:45:31 Z Abrar_Al_Samit 송금 (JOI19_remittance) C++17
0 / 100
1 ms 308 KB
#include<bits/stdc++.h>
using namespace std;

void PlayGround() {
	int n;
	cin >> n;
	long long a[n], b[n];
	for(int i=0; i<n; ++i) {
		cin >> a[i] >> b[i];
	}
	for(int st=0; st<n; ++st) {
		long long have[n];
		for(int i=0; i<n; ++i) {
			have[i] = a[i];
		}
		int v = st;
		while(1) {
			long long can = max(0LL, have[v]-b[v]);
			if(can&1) --can;
			if(can==0) break;
			have[v] -= can;
			can /= 2;
			have[(v+1)%n] += can;
			v = (v+1)%n;
		}
		bool ok = 1;
		for(int i=0; i<n; ++i) {
			ok &= have[i]==b[i];
		}
		if(ok) {
			cout << "Yes\n";
			return;
		}
	}
	cout << "No\n";

	//O(N^2logN)

	// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	PlayGround();
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 308 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 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 308 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 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 308 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 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -