Submission #393881

#	Time	Username	Problem	Language	Result	Execution time	Memory
393881		arwaeystoamneg	Remittance (JOI19_remittance)	C++17	100 / 100	280 ms	28580 KiB

remittance

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 1000005;
int a[MAX], b[MAX];
int n;
int main() 
{
	setIO("test1");
	cin >> n;
	F0R(i, n)
	{
		cin >> a[i] >> b[i];
	}
	int flag = 0;
	do
	{
		flag = 0;
		F0R(i, n)
		{
			int ne = (i == n - 1 ? 0 : i + 1);
			int v = (a[i] - b[i] + 1) / 2;
			if (a[i] - 2 * v < 0)v--;
			if (v <= 0)continue;
			a[i] -= 2 * v;
			a[ne] += v;
			flag = 1;
		}
	} while (flag);
	/*
	priority_queue<pii>todo;
	F0R(i, n)if (a[i] - b[i] > 0)todo.push({ a[i] - b[i],i });
	while (sz(todo))
	{
		pii t = todo.top();
		todo.pop();
		if (a[t.s] - b[t.s] != t.f)continue;
		int v = (a[t.s] - b[t.s] + 1) / 2;
		if (a[t.s] - 2 * v < 0)v--;
		if (v <= 0)continue;
		a[t.s] -= 2 * v;
		int ne = (t.s + 1 == n ? 0 : t.s + 1);
		a[ne] += v;
		if (a[ne] - b[ne] > 0)
		{
			int v = (a[ne] - b[ne] + 1) / 2;
			if (a[ne] - 2 * v < 0)v--;
			if (v >= 1)
				todo.push({ a[ne] - b[ne],ne });
		}
	}*/
	F0R(i, n)
	{
		if (a[i] != b[i])
		{
			cout << "No" << endl;
			return 0;
		}
	}
	cout << "Yes" << endl;
}

• Subtask 1: 15 / 15
• Subtask 2: 40 / 40
• Subtask 3: 45 / 45