結果
問題 | No.1211 円環はお断り |
ユーザー |
![]() |
提出日時 | 2020-08-30 13:57:33 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,467 ms / 2,000 ms |
コード長 | 4,020 bytes |
コンパイル時間 | 1,378 ms |
コンパイル使用メモリ | 115,412 KB |
実行使用メモリ | 33,664 KB |
最終ジャッジ日時 | 2024-11-23 16:11:51 |
合計ジャッジ時間 | 24,095 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 41 |
ソースコード
#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 longtypedef 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;}