#589939 (C++17) No.1309 テスト

提出ソース

結果

問題	No.1309 テスト
ユーザー	heno239
提出日時	2020-12-06 21:35:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,962 bytes
コンパイル時間	2,637 ms
コンパイル使用メモリ	150,084 KB
実行使用メモリ	26,496 KB
最終ジャッジ日時	2024-09-17 13:16:33
合計ジャッジ時間	33,862 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	10 ms 13,096 KB
testcase_02	AC	8 ms 13,424 KB
testcase_03	AC	8 ms 13,300 KB
testcase_04	AC	8 ms 13,296 KB
testcase_05	AC	8 ms 13,424 KB
testcase_06	AC	8 ms 13,296 KB
testcase_07	AC	8 ms 13,428 KB
testcase_08	AC	8 ms 13,312 KB
testcase_09	AC	8 ms 13,424 KB
testcase_10	AC	12 ms 13,292 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	AC	12 ms 13,172 KB
testcase_15	AC	12 ms 13,300 KB
testcase_16	AC	12 ms 13,424 KB
testcase_17	AC	12 ms 13,424 KB
testcase_18	AC	12 ms 13,184 KB
testcase_19	AC	12 ms 13,224 KB
testcase_20	AC	12 ms 13,296 KB
testcase_21	AC	12 ms 13,296 KB
testcase_22	AC	12 ms 13,424 KB
testcase_23	AC	12 ms 13,440 KB
testcase_24	AC	12 ms 13,184 KB
testcase_25	AC	12 ms 13,428 KB
testcase_26	AC	12 ms 13,292 KB
testcase_27	AC	9 ms 13,296 KB
testcase_28	AC	8 ms 13,312 KB
testcase_29	AC	8 ms 13,296 KB
testcase_30	AC	9 ms 13,296 KB
testcase_31	AC	9 ms 13,424 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	AC	8 ms 13,168 KB
testcase_37	AC	9 ms 13,424 KB
testcase_38	AC	9 ms 13,172 KB
testcase_39	AC	9 ms 13,424 KB
testcase_40	AC	9 ms 13,296 KB
testcase_41	AC	9 ms 13,424 KB
testcase_42	AC	8 ms 13,164 KB
testcase_43	AC	8 ms 13,296 KB
testcase_44	AC	9 ms 13,296 KB
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	AC	13 ms 13,296 KB
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	AC	13 ms 13,312 KB
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	TLE	-
testcase_68	WA	-
testcase_69	TLE	-
testcase_70	TLE	-
testcase_71	--	-
testcase_72	--	-
testcase_73	--	-
testcase_74	--	-
testcase_75	--	-
testcase_76	--	-
testcase_77	--	-
testcase_78	--	-
testcase_79	--	-
testcase_80	--	-
testcase_81	--	-
testcase_82	--	-
testcase_83	--	-
testcase_84	--	-
testcase_85	--	-
testcase_86	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 17;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll calc2(ll x) {
	return x * (x + 1) / 2;
}

LP v[100];
int cur;


int divk1[1001][1001];
int rrrk1[1001][1001];
void init() {
	for (int i = 0; i <= 1000; i++) {
		for (int k = 2; k <= 1000; k++) {
			divk1[k][i] = i / (k - 1);
			rrrk1[k][i] = i % (k - 1);
		}
	}
}
ll memo[4][1005];
void solve() {
	int n; ll p, x, y; cin >> n >> p >> x >> y;
	ll ans = -INF;
	//0
	rep(i, 1005)memo[0][i] = calc2(i);
	//x-i
	rep(i, 1005)memo[1][i] = calc2(x - i);
	//x+i
	rep(i, 1005)memo[2][i] = calc2(x + i);
	//p-i
	rep(i, 1005)memo[3][i] = calc2(p - i);
	auto cs = [&](int restl, int restr, int cl, int cr, int k, ll s, ll ad)->ll {
		if (k == 1)return -INF;
		/*if (restl == 2 && restr == 9 && cl == 0 && cr == 1 && k == 9 && s == 9 && ad == 97) {
			cout << "hello\n";
		}*/
		int xl = restl - cl * k;
		int xr = restr - cr * k;
		ll sum = 0;
		int dl = divk1[k][xl];
		int dr = divk1[k][xr];
		int rl = rrrk1[k][xl];
		int rr = rrrk1[k][xr];
		int nl = dl + (rl > 0);
		int nr = dr + (rr > 0);
		if (nl + cl > x)return -INF;
		if (nr + cr > p - x)return -INF;
		//[0,x),(x,p]
		ll mi = memo[0][cl - 1] + memo[2][cr] - memo[2][0];
		if (mi > s)return -INF;
		ll ma = memo[1][1 + nl] - memo[1][1 + nl + cl];
		ma += memo[3][nr] - memo[3][nr + cr];
		ll b = 0;
		b += (k - 1) * (memo[1][1] - memo[1][1 + dl]);
		b += (x - 1 - dl) * rl;
		b += (memo[3][0] - memo[3][dr])* (k - 1);
		b += (p - dr) * rr;
		if (s <= ma) {
			return b + ad;
		}
		else {
			ll sup = memo[1][1] - memo[1][1 + cl];
			sup += memo[3][0] - memo[3][cr];
			//cout << "?? " << sup << "\n";
			if (sup < s)return -INF;
			ll dif = s - ma;
			//cost,number
			cur = 0;
			if (rl > 0) {
				v[cur] = { rl,cl }; cur++;
			}
			if (rr > 0) {
				v[cur] = { rr,cr }; cur++;
			}
			if (cl > 0 && dl > 0) {
				v[cur] = { k - 1,cl * dl }; cur++;
			}
			if (cr > 0 && dr > 0) {
				v[cur] = { k - 1,cr * dr }; cur++;
			}
			sort(v, v + cur);
			rep(i, cur) {
				ll z = min(v[i].second, dif);
				dif -= z;
				b -= z * v[i].first;
			}
			return b + ad;
		}
		return -INF;
	};
	if (x == p) {
		if (y == p) {
			cout << n * p << "\n";
		}
		else {
			cout << -1 << "\n";
		}
	}
	else if (x == 0) {
		if (y == 0) {
			cout << n / 2 * p << "\n";
		}
		else {
			cout << -1 << "\n";
		}
	}
	else {
		for (int cl = 0; cl <= n / 2; cl++) {
			for (int cr = 0; cr <= n / 2; cr++) {
				if (cl + cr + 1 > n / 2) {
					if (x == y) {
						ll val = cs(n / 2 - cl, n / 2 - cr, 0, 0, cl + cr + 1, 0, (cl + cr + 1) * x);
						ans = max(ans, val);
					}
					continue;
				}
				for (int k = cl + cr + 1; k <= n; k++) {
					if (cl + cr + 1 != k && k > n / 2)continue;
					for (int al = 0; al <= n; al++) {
						if (al * k + cl + cr + 1 > n)break;

						int num = al;
						if (k == cl + cr + 1)num++;
						if (num == 0)continue;
						ll sum = num * y;
						if (k == cl + cr + 1)sum -= x;
						ll z = num * y * k;
						if (k != cl + cr + 1)z += (cl + cr + 1) * x;

						int l = -1, r = al + 1;
						while (r - l > 1) {
							int m = (l + r) >> 1;
							int le = m;
							int ri = al - m;
							if (le * k + cl > n / 2) {
								r = m; continue;
							}
							if (ri * k + cr > n / 2) {
								l = m; continue;
							}
							ll val = cs(n / 2 - cl, n / 2 - cr, le, ri, k, sum, z);
							if (val == -1)r = m;
							else if (val == -2) l = m;
							else {
								l = m;
							}
						}
						for (int j = 0; j <= 1; j++) {
							int le = j + l;
							int ri = al - le;
							if (le < 0 || ri < 0)continue;
							if (le * k + cl > n / 2) {
								continue;
							}
							if (ri * k + cr > n / 2) {
								continue;
							}
							ll val = cs(n / 2 - cl, n / 2 - cr, le, ri, k, sum, z);
							ans = max(ans, val);
						}
					}
				}
			}
		}
		//cout << tmp << "\n";
		if (x >= n / 2 && p - x >= n / 2) {
			ll d = n / 2;
			ll l1 = calc2(d - 1);
			ll r1 = calc2(x - 1) - calc2(x - 1 - d);
			ll l2 = calc2(x + d) - calc2(x);
			ll r2 = calc2(p) - calc2(p - d);
			ll sl = l1 + l2 + x;
			ll sr = r1 + r2 + x;
			if (sl <= n * y && n * y <= sr) {
				ans = max(ans, n * y);
			}
		}
		if (ans == -INF)ans = -1;
		cout << ans << "\n";
	}
}

signed main() {

	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	init();
	//expr();
	//int t; cin >> t; rep(i, t)
	int t = 10; rep(i, t)
		solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード