結果

問題 No.1211 円環はお断り
ユーザー apricityapricity
提出日時 2024-09-08 00:45:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,874 bytes
コンパイル時間 1,502 ms
コンパイル使用メモリ 130,048 KB
実行使用メモリ 21,496 KB
最終ジャッジ日時 2024-09-08 00:45:42
合計ジャッジ時間 15,795 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 WA -
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 WA -
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 361 ms
12,556 KB
testcase_14 AC 475 ms
16,344 KB
testcase_15 AC 465 ms
14,844 KB
testcase_16 AC 755 ms
20,852 KB
testcase_17 AC 45 ms
6,944 KB
testcase_18 AC 436 ms
14,596 KB
testcase_19 AC 48 ms
6,940 KB
testcase_20 AC 71 ms
6,944 KB
testcase_21 AC 66 ms
7,696 KB
testcase_22 AC 381 ms
12,460 KB
testcase_23 AC 418 ms
15,732 KB
testcase_24 AC 231 ms
11,668 KB
testcase_25 AC 10 ms
6,940 KB
testcase_26 AC 529 ms
16,980 KB
testcase_27 AC 234 ms
11,716 KB
testcase_28 AC 537 ms
17,012 KB
testcase_29 AC 427 ms
14,716 KB
testcase_30 AC 529 ms
18,060 KB
testcase_31 AC 214 ms
10,196 KB
testcase_32 AC 640 ms
20,160 KB
testcase_33 AC 707 ms
20,796 KB
testcase_34 AC 701 ms
21,496 KB
testcase_35 AC 712 ms
21,368 KB
testcase_36 AC 687 ms
20,848 KB
testcase_37 AC 747 ms
21,024 KB
testcase_38 AC 748 ms
20,940 KB
testcase_39 AC 768 ms
21,104 KB
testcase_40 WA -
testcase_41 AC 2 ms
6,940 KB
testcase_42 AC 3 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep1(a)          for(int i = 0; i < a; i++)
#define rep2(i, a)       for(int i = 0; i < a; i++)
#define rep3(i, a, b)    for(int i = a; i < b; i++)
#define rep4(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a)          for(int i = (a)-1; i >= 0; i--)
#define rrep2(i, a)       for(int i = (a)-1; i >= 0; i--)
#define rrep3(i, a, b)    for(int i = (b)-1; i >= a; i--)
#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using vvvvvc = vector<vvvvc<T>>;
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
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 (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

int nex[400005][18];
ll a[400005];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    const ll INF = 1e9;

    int n,k; in(n,k);
    rep(i,n) {
        int ai; in(ai);
        a[i] = a[i+n] = ai;
    }

    auto chk = [&] (ll mid) -> int{
        rep(i,2*n)rep(j,18) nex[i][j] = INF;
        int r = 0, l = 0;
        ll cur = 0;
        while(l < 2*n && r < 2*n){
            if(cur >= mid){
                nex[l][0] = r;
                cur -= a[l];
                l++;
            }
            else{
                cur += a[r];
                r++;
            }
        }
        rep(j,17)rep(i,2*n) if(nex[i][j] != INF){
            nex[i][j+1] = nex[nex[i][j]][j];
        }
        int cnt = 0;
        rep(i,n){
            int now = i;
            rep(b,18)if(k>>b&1){
                if(now == INF) break;
                else {
                    now = nex[now][b];
                }
            }
            if(now <= i+n) cnt++;
        }
        return cnt;
    };

    ll ng = accumulate(a, a+n, 0LL), ok = 1;
    while(ng-ok > 1){
        ll mid = (ok+ng)/2;
        int h = chk(mid);
        if(h > 0) ok = mid;
        else ng = mid;
    }
    out(ok);
}
0