Submission #208633

#	Time	Username	Problem	Language	Result	Execution time	Memory
208633		eriksuenderhauf	Remittance (JOI19_remittance)	C++11	100 / 100	556 ms	33144 KiB

remittance

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const ll INF = 1e10 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
ll a[MAXN], b[MAXN];
ll d[MAXN], e[MAXN];
int n;

int check(ll val) {
	for (int i = 1; i <= n; i++) {
		e[i] = d[i];
		d[i] += val;
	}
	for (int i = n; i > 0; i--) {
		if (d[i] <= 0)
			continue;
		ll pw = d[i];
		for (int j = (i-2+n) % n + 1; pw <= INF; j = (j-2+n) % n + 1) {
			pw = 2ll * pw;
			if (d[j] >= 0)
				continue;
			pw += d[j];
			if (pw <= 0) {
				d[i] = 0;
				d[j] = pw;
				break;
			} else {
				d[j] = 0;
			}
		}
		if (d[i] != 0) {
			for (int j = 1; j <= n; j++)
				d[j] = e[j];
			return 0;
		}
	}
	ll ret = 1;
	for (int i = 1; i <= n; i++)
		if (d[i] != d[1]) {
			ret = 0;
			break;
		}
	if (ret && ((d[1] < 0 && val > 0) || d[1] == 0)) {
		printf("Yes\n");
		exit(0);
	}
	for (int j = 1; j <= n; j++)
		d[j] = e[j];
	return 1;
}

int main() {
	ni(n);
	ll sm = 0;
	ll lo = 1, hi = 1e9;
	bool fl = 0, fl2 = 1;
	for (int i = 1; i <= n; i++) {
		nl(a[i]), nl(b[i]);
		fl |= (a[i] > 1);
		fl2 &= (b[i] == 0);
		d[i] = b[i] - a[i];
		hi = max(hi, -d[i]);
		sm -= d[i];
	}
	if (sm < 0)
		return !printf("No\n");
	bool mix = check(0);
	if (fl2 || !fl || mix == false)
		return !printf("No\n");
	while (lo <= hi) {
		ll mi = (lo+hi) / 2;
		if (check(mi))
			lo = mi+1;
		else
			hi = mi-1;
	}
	return !printf("No\n");
}

Compilation message (stderr)

remittance.cpp: In function 'int main()':
remittance.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
remittance.cpp:85:2: note: in expansion of macro 'ni'
  ni(n);
  ^~
remittance.cpp:90:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   nl(a[i]), nl(b[i]);
           ^
remittance.cpp:90:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]

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