結果

問題 No.1211 円環はお断り
ユーザー suta28407928suta28407928
提出日時 2020-08-30 14:37:34
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 257 ms / 2,000 ms
コード長 3,677 bytes
コンパイル時間 902 ms
コンパイル使用メモリ 103,944 KB
実行使用メモリ 6,528 KB
最終ジャッジ日時 2024-05-02 21:28:14
合計ジャッジ時間 5,520 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 70 ms
5,376 KB
testcase_14 AC 225 ms
5,376 KB
testcase_15 AC 125 ms
5,504 KB
testcase_16 AC 149 ms
6,272 KB
testcase_17 AC 27 ms
5,376 KB
testcase_18 AC 107 ms
5,376 KB
testcase_19 AC 25 ms
5,376 KB
testcase_20 AC 31 ms
5,376 KB
testcase_21 AC 18 ms
5,376 KB
testcase_22 AC 130 ms
5,376 KB
testcase_23 AC 154 ms
5,376 KB
testcase_24 AC 61 ms
5,376 KB
testcase_25 AC 9 ms
5,376 KB
testcase_26 AC 131 ms
5,504 KB
testcase_27 AC 63 ms
5,376 KB
testcase_28 AC 185 ms
5,632 KB
testcase_29 AC 87 ms
5,376 KB
testcase_30 AC 121 ms
5,632 KB
testcase_31 AC 47 ms
5,376 KB
testcase_32 AC 149 ms
6,016 KB
testcase_33 AC 170 ms
6,400 KB
testcase_34 AC 172 ms
6,272 KB
testcase_35 AC 168 ms
6,272 KB
testcase_36 AC 174 ms
6,528 KB
testcase_37 AC 169 ms
6,400 KB
testcase_38 AC 177 ms
6,400 KB
testcase_39 AC 178 ms
6,400 KB
testcase_40 AC 257 ms
6,400 KB
testcase_41 AC 2 ms
5,376 KB
testcase_42 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
	return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
	return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
	return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
	return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
	a += rhs.a;
	if (a >= Modulus) {
	  a -= Modulus;
	}
	return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
	if (a < rhs.a) {
	  a += Modulus;
	}
	a -= rhs.a;
	return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
	a = a * rhs.a % Modulus;
	return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
	u64 exp = Modulus - 2;
	while (exp) {
	  if (exp % 2) {
		*this *= rhs;
	  }
	  rhs *= rhs;
	  exp /= 2;
	}
	return *this;
  }
};

using mint = modint<mod>;

ll modpow(ll x, ll n, ll mod){
	ll res = 1;
	while(n > 0){
		if(n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

int main(){
	ll n,k; cin >> n >> k;
	ll N = 2*n;
	ll sum = 0;
	vl a(N); rep(i,n) cin >> a[i], sum += a[i];
	rep(i,n) a[i+n] = a[i];
	vl s(N+1,0); rep(i,N) s[i+1] = s[i] + a[i];
	ll ok = 0, ng = sum / k + 1; //1e15
	while(ng - ok > 1){
		ll mid = (ok + ng) / 2;
		bool f = false;
		rep(start, n){
			if(s[start] >= mid) break;
			ll cur = start;
			int cnt;
			for(cnt=0; cnt<k; cnt++){
				auto itr = lower_bound(all(s), s[cur] + mid);
				int d = itr - s.begin();
				if(d > start + n) break;
				cur = d; 
			}
			if(cnt == k) f = true;
		}
		if(f) ok = mid;
		else ng = mid;
	}
	cout << ok << "\n";
}
0