oj.uz

답안 #433874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433874 2021-06-20T11:43:49 Z Maqsut_03 송금 (JOI19_remittance) C++14
0 / 100
 1 ms 204 KB 
#include<bits/stdc++.h>
#define ll long long 
#define ss second
#define ff first
using namespace std;
const int N = 222222;

int n;
ll a[N], b[N], k;

int main()
{
	cin >> n;
	for (int i=1; i<=n; i++) cin >> a[i] >> b[i];
	
	int q = 100;
	while (q)
	{
		for (int i=1; i<n; i++)
		{
			if (a[i] > b[i]) 
			{
				k = a[i] - b[i];
				a[i+1] += k / 2;
				a[i] = b[i] + k % 2;
			}
		}
		if (a[n] > b[n])
		{
			k = a[n] - b[n];
			a[1] += k / 2;
			a[n] = b[n] + k % 2;
		}
		q--;
	}
	for (int i=1; i<=n; i++)
	{
		if (a[i] != b[i])
		{
			cout << "No";
			return 0;
		}
	}
	cout << "Yes\n";
	return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 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 -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 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 -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 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 -