oj.uz

답안 #897334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897334 2024-01-02T23:40:21 Z NK_ 송금 (JOI19_remittance) C++17
0 / 100
 357 ms 592 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
 
using ll = long long;
template<class T> using V = vector<T>;
using vi = V<int>;
using vl = V<ll>;
 

const int MX = 8e7;
int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; cin >> N;
	vl A(N), B(N); for(int i = 0; i < N; i++) cin >> A[i] >> B[i];
 
	for(int t = 0; t < MX / N; t++) {
		// move all not used money (it halfs each time hence i only need to repeat ~60 times)
 
		for(int x = 0; x < N; x++) {
			ll amt = (max(0LL, A[x] - B[x]) / 2) * 2;
			// cout << x << " " << amt << nl; 
			A[x] -= amt;
			A[(x + 1) % N] += amt / 2;
		}
	}
 
	cout << (A == B ? "Yes" : "No") << nl;
 
	exit(0-0);
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 592 KB Output is correct
2 Correct 352 ms 344 KB Output is correct
3 Correct 351 ms 432 KB Output is correct
4 Correct 353 ms 432 KB Output is correct
5 Correct 352 ms 440 KB Output is correct
6 Correct 353 ms 344 KB Output is correct
7 Correct 357 ms 348 KB Output is correct
8 Incorrect 351 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 592 KB Output is correct
2 Correct 352 ms 344 KB Output is correct
3 Correct 351 ms 432 KB Output is correct
4 Correct 353 ms 432 KB Output is correct
5 Correct 352 ms 440 KB Output is correct
6 Correct 353 ms 344 KB Output is correct
7 Correct 357 ms 348 KB Output is correct
8 Incorrect 351 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 592 KB Output is correct
2 Correct 352 ms 344 KB Output is correct
3 Correct 351 ms 432 KB Output is correct
4 Correct 353 ms 432 KB Output is correct
5 Correct 352 ms 440 KB Output is correct
6 Correct 353 ms 344 KB Output is correct
7 Correct 357 ms 348 KB Output is correct
8 Incorrect 351 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -