結果

問題 No.1211 円環はお断り
コンテスト
ユーザー Thistle
提出日時 2020-08-02 00:05:09
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 9,798 bytes
コンパイル時間 2,287 ms
コンパイル使用メモリ 139,244 KB
実行使用メモリ 40,064 KB
最終ジャッジ日時 2024-07-08 11:43:23
合計ジャッジ時間 6,526 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample -- * 2
other AC * 7 TLE * 1 -- * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) (lower_bound(all(b),(i))-(b).begin())
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
#define found(a,x) (a.find(x)!=a.end())
//#define endl "\n"
constexpr int mod = (ll)1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = (ll)3 * 1e18;
constexpr int Inf = (ll)15 * 1e8;
constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
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; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(short g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }
bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
template<typename T>
class csum {
    vec<T> v;
public:
    csum(vec<T>& a) :v(a) { build(); }
    csum(){}
    void init(vec<T>& a) { v = a; build(); }
    void build() {
        for (int i = 1; i < v.size(); i++) v[i] += v[i - 1];
    }
    T a(int l, int r) {
        if (r < l) return 0;
        return v[r] - (l == 0 ? 0 : v[l - 1]);
    }//[l,r]
    T b(int l, int r) {
        return a(l, r - 1);
    }//[l,r)
    T a(pair<int, int>t) {
        return a(t.first, t.second);
    }
    T b(pair<int, int>t) {
        return b(t.first, t.second);
    }
};
class mint {
public:ll v;
      mint(ll v = 0) { s(v % mod + mod); }
      constexpr static int mod = (ll)1e9 + 7;
      constexpr static int fn_ = (ll)2e6 + 5;
      static mint fact[fn_], comp[fn_];
      mint pow(int x) const {
          mint b(v), c(1);
          while (x) {
              if (x & 1) c *= b;
              b *= b;
              x >>= 1;
          }
          return c;
      }
      inline mint& s(int vv) {
          v = vv < mod ? vv : vv - mod;
          return *this;
      }
      inline mint inv()const { return pow(mod - 2); }
      inline mint operator-()const { return mint() - *this; }
      inline mint& operator+=(const mint b) { return s(v + b.v); }
      inline mint& operator-=(const mint b) { return s(v + mod - b.v); }
      inline mint& operator*=(const mint b) { v = v * b.v % mod; return *this; }
      inline mint& operator/=(const mint b) { v = v * b.inv().v % mod; return *this; }
      inline mint operator+(const mint b) const { return mint(v) += b; }
      inline mint operator-(const mint b) const { return mint(v) -= b; }
      inline mint operator*(const mint b) const { return mint(v) *= b; }
      inline mint operator/(const mint b) const { return mint(v) /= b; }
      friend ostream& operator<<(ostream& os, const mint& m) {
          return os << m.v;
      }
      friend istream& operator>>(istream& is, mint& m) {
          int x; is >> x; m = mint(x);
          return is;
      }
      bool operator<(const mint& r)const { return v < r.v; }
      bool operator>(const mint& r)const { return v > r.v; }
      bool operator<=(const mint& r)const { return v <= r.v; }
      bool operator>=(const mint& r)const { return v >= r.v; }
      bool operator==(const mint& r)const { return v == r.v; }
      bool operator!=(const mint& r)const { return v != r.v; }
      explicit operator bool()const { return v; }
      explicit operator int()const { return v; }
      mint comb(mint k) {
          if (k > * this) return mint();
          if (!fact[0]) combinit();
          if (v >= fn_) {
              if (k > * this - k) k = *this - k;
              mint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
              return tmp * comp[k.v];
          }
          return fact[v] * comp[k.v] * comp[v - k.v];
      }//nCk
      mint perm(mint k) {
          if (k > * this) return mint();
          if (!fact[0]) combinit();
          if (v >= fn_) {
              mint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
              return tmp;
          }
          return fact[v] * comp[v - k.v];
      }//nPk
      static void combinit() {
          fact[0] = 1;
          for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * mint(i);
          comp[fn_ - 1] = fact[fn_ - 1].inv();
          for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * mint(i + 1);
      }
}; mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------

//---------------------------------------------------------------------

int n, k, max_n;
vi a;

mt19937 rnd(2563125);

void generate(int mode, int num) {
    a.clear();
    if (mode == 0) {
        cin >> n >> k;
        rep(i, n) a.pb(read());
    }
    else {

        n = rnd() % 100000 + 1, k = rnd() % n + 1;

        max_n = 15;
        n = 15, k = 7;

        if (num <= 7) {
            n = n % (num + 1) + 1;
            k = k % n + 1;
            max_n = 100;
        }
        else if (num <= 13) {
            n = n % 100 + 1;
            k = k % n + 1;
            max_n = 1000000;
        }
        else if (num <= 33) {

        }
        else if (num <= 36) {
            n = 99800;
            k = 99800;
        }
        else {
            n = 100000, k = 100000;
        }
        rep(i, n) {
            a.pb(rnd() % max_n + 1);
            if (num == 40) a[i] = 1000000000;
            else if (num == 39) a[i] = 998000000;
        }
    }
}
int guchoku() {
    vi b = a;
    rep(i, n) b.pb(a[i]);

    function<int(int, int, int)>dfs = [&](int x, int time, int end) ->int{
        if (x == end) {
            if (time == k) return inf;
            else return -inf;
        }
        int sum = 0, ret = -inf;
        rng(i, x, end) {
            sum += b[i];
            if (time + 1 == k && i + 1 != end) continue;
            chmax(ret, min(sum, dfs(i + 1, time + 1, end)));
        }
        return ret;
    };

    int ans = 0;
    rep(i, n) {
        chmax(ans, dfs(i, 0, i + n));
    }
    return ans;
}
int table[30][300000];
int solve() {
    int sum = 0;
    rep(i, n) sum += a[i];
    vi b = a;
    rep(i, n) b.pb(a[i]);

    int ok = 0, ng = sum + 1, mid;
    while (ng - ok > 1) {
        rep(i, 2 * n)rep(j, 20)table[j][i] = -1;
        mid = (ok + ng) / 2;
        int r = 0, tmp = 0;
        rep(i, 2 * n) {
            while (r < 2 * n && tmp < mid) tmp += b[r++];
            if (r < 2 * n) table[0][i] = r;//次にどこに行きますか？
            tmp -= b[i];
        }
        rng(i, 0, 20) rep(j, 2 * n) {
            if (~table[i][j] && ~table[i][table[i][j]]) {
                table[i + 1][j] = table[i][table[i][j]];
            }
        }
        rep(i, n) {
            bool flag = 1;
            int t = i, r = k;//kターンまで
            for (int i = 19; i >= 0; i--) {
                if ((r >> i) & 1) {
                    r ^= (1ll << i);
                    if (table[i][t] == -1) {
                        flag = 0;
                        goto loop;
                    }
                    else t = table[i][t];
                }
            }
        loop:;
            if (flag && t <= i + n) {
                ok = mid;
                goto roop;
            }
        }
        ng = mid;
    roop:;
    }
    return ok;
}
void edit(int num) {
    ofstream ofs("input/" + to_string(num) + ".txt");
    ofs << n << " " << k << endl;
    rep(i, n) ofs << a[i] << ssp(i, n);
}

signed main() {
    generate(0, 20);
    /*cout << n << " " << k << endl;
    rep(i, n) cout << a[i] << ssp(i, n);
    /*rep(i, n - 1) {
        cout << e[i].fs+1 << " " << e[i].sc+1 << endl;
    }*/
    int ans = guchoku();
    cout << ans << endl;
    /*rep(i, 40) {
        generate(1, i + 1);
        //if (i == 0) continue;
        edit(i + 1);
        /*int u = guchoku();
        int v = solve();
        if (u != v) {
            cout << n << " " << k << endl;
            rep(i, n) cout << a[i] << ssp(i, n);
            cout << u << endl;
            cout << endl;
            cout << v << endl;
            return 0;
        }
        if (i % 10 == 0) cout << i << endl;
    }*/
}
0