結果
問題 | No.1211 円環はお断り |
ユーザー | theory_and_me |
提出日時 | 2020-08-30 17:30:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,609 ms / 2,000 ms |
コード長 | 3,509 bytes |
コンパイル時間 | 1,897 ms |
コンパイル使用メモリ | 205,376 KB |
実行使用メモリ | 47,976 KB |
最終ジャッジ日時 | 2024-04-27 12:02:21 |
合計ジャッジ時間 | 28,480 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 634 ms
27,884 KB |
testcase_14 | AC | 801 ms
35,068 KB |
testcase_15 | AC | 795 ms
33,600 KB |
testcase_16 | AC | 1,541 ms
47,976 KB |
testcase_17 | AC | 95 ms
9,924 KB |
testcase_18 | AC | 762 ms
30,732 KB |
testcase_19 | AC | 100 ms
9,936 KB |
testcase_20 | AC | 132 ms
10,076 KB |
testcase_21 | AC | 120 ms
9,900 KB |
testcase_22 | AC | 672 ms
28,764 KB |
testcase_23 | AC | 758 ms
32,744 KB |
testcase_24 | AC | 414 ms
21,332 KB |
testcase_25 | AC | 12 ms
6,944 KB |
testcase_26 | AC | 954 ms
36,228 KB |
testcase_27 | AC | 429 ms
21,608 KB |
testcase_28 | AC | 1,008 ms
38,248 KB |
testcase_29 | AC | 759 ms
30,360 KB |
testcase_30 | AC | 1,002 ms
38,644 KB |
testcase_31 | AC | 399 ms
18,888 KB |
testcase_32 | AC | 1,357 ms
44,668 KB |
testcase_33 | AC | 1,579 ms
47,700 KB |
testcase_34 | AC | 1,601 ms
47,808 KB |
testcase_35 | AC | 1,542 ms
47,660 KB |
testcase_36 | AC | 1,494 ms
47,940 KB |
testcase_37 | AC | 1,499 ms
47,936 KB |
testcase_38 | AC | 1,597 ms
47,924 KB |
testcase_39 | AC | 1,609 ms
47,756 KB |
testcase_40 | AC | 1,326 ms
47,720 KB |
testcase_41 | AC | 2 ms
6,940 KB |
testcase_42 | AC | 1 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(ll i=0;i<(ll)n;i++) #define dump(x) cerr << #x << " = " << (x) << endl; #define spa << " " << #define fi first #define se second #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() using ld = long double; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<long, long>; using pdd = pair<ld, ld>; template<typename T> struct V : vector<T> { using vector<T>::vector; }; V() -> V<ll>; V(size_t) -> V<ll>; template<typename T> V(size_t, T) -> V<T>; template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); } template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); } template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;} template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;} struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } void fail() { cout << -1 << '\n'; exit(0); } inline int popcount(const int x) { return __builtin_popcount(x); } inline int popcount(const ll x) { return __builtin_popcountll(x); } template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0]; for(ll i=1;i<n;i++)cerr spa v[i]; cerr<<endl;}; const ll INF = (1ll<<62); // const ld EPS = 1e-10; // const ld PI = acos(-1.0); const ll mod = (int)1e9 + 7; //const ll mod = 998244353; ll db[201010][25]; ll nex[201010]; int main(){ ll N, K; cin >> N >> K; V<ll> A(N); REP(i, N) cin >> A[i]; V<ll> B(2*N); REP(i, N){ B[i] = A[i]; B[i+N] = A[i]; } V<ll> S(2*N+1, 0); REP(i, 2*N) S[i+1] = S[i] + B[i]; ll ok = 0; ll ng = 1e14; ng++; while(ng-ok>1){ ll D = 20; ll md = (ok+ng)/2; // dump(md) // V<ll> next(2*N+2); // REP(i, 2*N){ // ll pos = lower_bound(ALL(S), S[i]+md) - S.begin(); // nex[i] = pos; // } ll idx = 0; REP(i, 2*N){ while(idx<2*N+1 and S[idx]-S[i]<md) idx++; nex[i] = idx; } nex[2*N] = 2*N; nex[2*N+1] = 2*N+1; // dump(S) // dump(next) // V<V<ll>> db(2*N+2, V<ll>(D, 0)); REP(i, 2*N+2) db[i][0] = nex[i]; REP(j, D-1){ REP(i, 2*N+2){ db[i][j+1] = db[db[i][j]][j]; } } bool kanou = false; REP(i, N){ ll now = i; ll T = K; REP(j, D){ if(T&1){ now = db[now][j]; } T /= 2; } if(now-i<=N) kanou = true; } // dump(kanou) // cerr << endl; if(kanou) ok = md; else ng = md; } cout << ok << endl; return 0; }