結果

問題 No.1440 The Quiz Competition
ユーザー heno239heno239
提出日時 2021-03-26 22:46:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,033 bytes
コンパイル時間 2,166 ms
コンパイル使用メモリ 144,048 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-05-06 16:39:35
合計ジャッジ時間 3,108 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 2 ms
6,940 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 2 ms
6,944 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#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 long 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) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}


void solve() {
	ll n, a, w, k; cin >> n >> a >> w >> k;
	k--;
	if (k == 0) {
		cout << a << "\n"; return;
	}
	else if (k == n - 1) {
		if (w == 0) {
			if (a < k) {
				cout << ":(\n"; return;
			}
			else {
				ll ans = (a - k) / (k + 1);
				cout << ans << "\n"; return;
			}
		}
		else {
			//assert(false);
			ll le = -1, ri = w + 1;
			while (ri - le > 1) {
				ll x = (le + ri) / 2;
				ll s = x * (x + 1) / 2;
				ll rest = a;
				ll dd = (w - x) / k;
				ll r = (w - x) % k;
				if (dd * (dd + 1) / 2 >= s) {
					ll val = dd * (dd + 1) / 2-s+1;
					rest -= val * (k - r);
				}
				if ((dd + 1) * (dd + 2) / 2 >= s) {
					ll val = (dd + 1) * (dd + 2) / 2 - s + 1;
					rest -= val * r;
				}
				if (rest < 0) {
					le = x;
				}
				else {
					ri = x;
				}
			}
			ll res = INF;
			for (ll x = ri; x <= w; x++) {
				//ll x = ri;
				if (x - ri > 100)break;
				ll s = x * (x + 1) / 2;
				ll rest = a;
				ll dd = (w - x) / k;
				ll r = (w - x) % k;
				if (dd * (dd + 1) / 2 >= s) {
					ll val = dd * (dd + 1) / 2 - s + 1;
					rest -= val * (k - r);
				}
				if ((dd + 1) * (dd + 2) / 2 >= s) {
					ll val = (dd + 1) * (dd + 2) / 2 - s + 1;
					rest -= val * r;
				}
				//cout << "? " << x << " " << rest << "\n";
				ll val1 = dd * (dd + 1) / 2;
				if (val1 >= s)val1 = s - 1;
				ll val2 = (dd + 1) * (dd + 2) / 2;
				if (val2 >= s)val2 = s - 1;
				ll ans = -s;
				ll dif = s - val2 - 1;
				ll m = min(dif, rest);
				ans += m;
				rest -= m;
				dif = val2 - val1;
				m = min(dif, rest / (r + 1));
				ans += m; rest -= m * (r + 1);
				ans += rest / n;
				res = min(res, ans);
			}
			cout << res << "\n";
			//cout << ans << "\n";
		}
	}
	else {
		if (a >= k) {
			ll ans = (a - k) / (k + 1);
			cout << ans << "\n"; return;
		}
		else {
			if (w >= n - k) {
				cout << -1 << "\n"; return;
			}
			else {
				cout << ":(\n"; return;
			}
		}
	}
}

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