結果

問題 No.1211 円環はお断り
ユーザー dyktr_06dyktr_06
提出日時 2024-09-08 03:48:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,517 ms / 2,000 ms
コード長 5,604 bytes
コンパイル時間 2,421 ms
コンパイル使用メモリ 207,588 KB
実行使用メモリ 35,268 KB
最終ジャッジ日時 2024-09-08 03:48:54
合計ジャッジ時間 26,400 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 604 ms
19,888 KB
testcase_14 AC 1,017 ms
26,020 KB
testcase_15 AC 860 ms
25,620 KB
testcase_16 AC 1,505 ms
34,288 KB
testcase_17 AC 78 ms
6,944 KB
testcase_18 AC 787 ms
22,060 KB
testcase_19 AC 78 ms
7,352 KB
testcase_20 AC 111 ms
7,204 KB
testcase_21 AC 97 ms
7,156 KB
testcase_22 AC 618 ms
20,452 KB
testcase_23 AC 736 ms
23,944 KB
testcase_24 AC 349 ms
15,068 KB
testcase_25 AC 14 ms
6,944 KB
testcase_26 AC 908 ms
27,156 KB
testcase_27 AC 355 ms
14,680 KB
testcase_28 AC 919 ms
27,580 KB
testcase_29 AC 699 ms
23,500 KB
testcase_30 AC 964 ms
28,004 KB
testcase_31 AC 330 ms
14,500 KB
testcase_32 AC 1,236 ms
33,196 KB
testcase_33 AC 1,367 ms
35,268 KB
testcase_34 AC 1,388 ms
35,196 KB
testcase_35 AC 1,425 ms
34,944 KB
testcase_36 AC 1,391 ms
35,008 KB
testcase_37 AC 1,318 ms
34,588 KB
testcase_38 AC 1,443 ms
35,212 KB
testcase_39 AC 1,517 ms
34,768 KB
testcase_40 AC 17 ms
6,940 KB
testcase_41 AC 2 ms
6,944 KB
testcase_42 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

void input(){
}

ll nxt[400001][18];

void solve(){
    ll n, k; in(n, k);
    vll a; vin(a, n);
    rep(i, n) a.push_back(a[i]);
    vll s(n * 2 + 1);
    rep(i, n * 2) s[i + 1] = s[i] + a[i];
    if(k == 1){
    	out(s[n]);
    	return;
    }
    
    ll anscnt = 0;
    ll ok = 0, ng = s[n] / k + 1;
    while(abs(ok - ng) > 1){
        ll mid = (ok + ng) / 2;
        ll cnt = 18;
        rep(i, n * 2){
            ll ok2 = min(n * 2, i + n) - 1, ng2 = i - 1;
            while(abs(ok2 - ng2) > 1){
                ll mid2 = (ok2 + ng2) / 2;
                if(s[mid2 + 1] - s[i] >= mid){
                    ok2 = mid2;
                }else{
                    ng2 = mid2;
                }
            }
            nxt[i][0] = ok2 + 1;
            if(ok2 == min(n * 2, i + n) - 1){
                nxt[i][0] = n * 2;
            }
        }
        rep(j, cnt - 1) rep(i, n * 2){
            if(nxt[i][j] == n * 2){
                nxt[i][j + 1] = n * 2;
                continue;
            }
            nxt[i][j + 1] = nxt[nxt[i][j]][j];
        }
        ll res = 0;
        rep(i, n){
            ll cur = i;
            rrep(j, cnt){
                if(cur > i + n) break;
                if(k & (1 << j)){
                    cur = nxt[cur][j];
                }
            }
            if(cur <= i + n){
                res++;
            }
        }
        if(res){
            ok = mid;
            anscnt = res;
        }else{
            ng = mid;
        }
    }
    out(ok);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    input();
    solve();
}
0