結果

問題 No.1211 円環はお断り
ユーザー heno239heno239
提出日時 2020-08-30 13:57:33
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,104 ms / 2,000 ms
コード長 4,020 bytes
コンパイル時間 1,359 ms
コンパイル使用メモリ 114,856 KB
実行使用メモリ 37,832 KB
最終ジャッジ日時 2023-08-15 09:54:07
合計ジャッジ時間 19,301 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
15,208 KB
testcase_01 AC 4 ms
15,136 KB
testcase_02 AC 4 ms
15,180 KB
testcase_03 AC 4 ms
15,164 KB
testcase_04 AC 4 ms
15,244 KB
testcase_05 AC 4 ms
15,156 KB
testcase_06 AC 4 ms
15,316 KB
testcase_07 AC 4 ms
15,336 KB
testcase_08 AC 3 ms
15,164 KB
testcase_09 AC 4 ms
15,384 KB
testcase_10 AC 4 ms
15,176 KB
testcase_11 AC 4 ms
15,148 KB
testcase_12 AC 4 ms
15,220 KB
testcase_13 AC 463 ms
28,248 KB
testcase_14 AC 569 ms
30,840 KB
testcase_15 AC 581 ms
30,756 KB
testcase_16 AC 923 ms
37,776 KB
testcase_17 AC 62 ms
16,588 KB
testcase_18 AC 521 ms
28,464 KB
testcase_19 AC 73 ms
16,496 KB
testcase_20 AC 93 ms
17,000 KB
testcase_21 AC 95 ms
16,788 KB
testcase_22 AC 484 ms
28,520 KB
testcase_23 AC 545 ms
30,628 KB
testcase_24 AC 315 ms
23,912 KB
testcase_25 AC 15 ms
15,508 KB
testcase_26 AC 635 ms
30,900 KB
testcase_27 AC 313 ms
23,956 KB
testcase_28 AC 668 ms
31,052 KB
testcase_29 AC 532 ms
28,436 KB
testcase_30 AC 709 ms
35,176 KB
testcase_31 AC 281 ms
23,948 KB
testcase_32 AC 863 ms
35,372 KB
testcase_33 AC 978 ms
37,776 KB
testcase_34 AC 973 ms
37,784 KB
testcase_35 AC 980 ms
37,776 KB
testcase_36 AC 959 ms
37,696 KB
testcase_37 AC 985 ms
37,776 KB
testcase_38 AC 1,104 ms
37,832 KB
testcase_39 AC 1,055 ms
37,820 KB
testcase_40 AC 469 ms
37,772 KB
testcase_41 AC 4 ms
15,160 KB
testcase_42 AC 5 ms
15,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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<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) {
	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 << 19;
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];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}
int to[1 << 17][17];
ll cost[1 << 17][17];
void solve() {
	ll le = -1, ri = 1000000000000000;
	int n, k; cin >> n >> k;
	vector<ll> a(n); rep(i, n)cin >> a[i];
	vector<ll> ra(2 * n + 1);
	rep(i, n)ra[i + 1] = ra[i] + a[i];
	rep(i, n)ra[i + n + 1] = ra[i + n] + a[i];
	while (ri - le > 1) {
		ll mid = (le + ri) / 2;
		
		bool valid = true;
		rep(i, n) {
			int id = lower_bound(all(ra), ra[i] + mid) - ra.begin();
			if (id == 2 * n + 1) {
				valid = false; break;
			}
			if (id - i > n) {
				valid = false; break;
			}
			cost[i][0] = id - i;
			if (id >= n)id -= n;
			to[i][0] = id;
		}
		if (!valid) {
			ri = mid; continue;
		}
		rep(j, 16) {
			rep(i, n) {
				cost[i][j + 1] = cost[i][j] + cost[to[i][j]][j];
				to[i][j + 1] = to[to[i][j]][j];
			}
		}
		bool exi = false;
		rep(i, n) {
			int cur = i;
			ll c = 0;
			rep(j, 17) {
				if (k&(1<<j)) {
					c += cost[cur][j];
					cur = to[cur][j];
				}
			}
			if (c <= n) {
				//cout << mid << " he? " << i << "\n";
				exi = true; break;
			}
		}
		/*cout << mid << "ha?\n";
		rep(i, n)cout << to[i][1] << " " << cost[i][1] << "\n";
		*/
		if (exi)le = mid;
		else ri = mid;

	}
	cout << le << "\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)
	solve();
	return 0;
}
0