oj.uz

Submission #649140

# Submission time Handle Problem Language Result Execution time Memory
649140 2022-10-09T11:50:21 Z ymm Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 1'000'010;
int a[N], b[N];
int n;

bool mv()
{
	bool change = 0;
	Loop (i,0,n) {
		int x = a[i] - b[i];
		if (x <= 0)
			continue;
		change = 1;
		x += x&1;
		a[i] -= x;
		a[i+1] += x/2;
	}
	a[0] += a[n];
	a[n] = 0;
	return change;
}

bool check()
{
	Loop (i,0,n)
		if (a[i] != b[i])
			return 0;
	return 1;
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	Loop (i,0,n)
		cin >> a[i] >> b[i];
	while (mv());
	cout << (check()? "YES": "NO") << '\n';
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -