結果
問題 | No.2890 Chiffon |
ユーザー | akiaa11 |
提出日時 | 2024-09-14 14:49:08 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 116 ms / 2,000 ms |
コード長 | 4,056 bytes |
コンパイル時間 | 4,121 ms |
コンパイル使用メモリ | 265,168 KB |
実行使用メモリ | 16,896 KB |
最終ジャッジ日時 | 2024-09-26 14:42:37 |
合計ジャッジ時間 | 8,221 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 72 ms
14,004 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 1 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 116 ms
16,896 KB |
testcase_24 | AC | 39 ms
9,600 KB |
testcase_25 | AC | 30 ms
8,320 KB |
testcase_26 | AC | 64 ms
13,056 KB |
testcase_27 | AC | 65 ms
13,784 KB |
testcase_28 | AC | 5 ms
5,376 KB |
testcase_29 | AC | 8 ms
5,376 KB |
testcase_30 | AC | 37 ms
8,832 KB |
testcase_31 | AC | 68 ms
14,592 KB |
testcase_32 | AC | 60 ms
13,056 KB |
testcase_33 | AC | 5 ms
5,376 KB |
testcase_34 | AC | 87 ms
15,800 KB |
testcase_35 | AC | 86 ms
15,744 KB |
testcase_36 | AC | 87 ms
15,696 KB |
testcase_37 | AC | 88 ms
15,744 KB |
testcase_38 | AC | 87 ms
15,720 KB |
testcase_39 | AC | 91 ms
15,744 KB |
testcase_40 | AC | 88 ms
15,744 KB |
testcase_41 | AC | 88 ms
15,576 KB |
testcase_42 | AC | 90 ms
15,744 KB |
testcase_43 | AC | 92 ms
15,744 KB |
testcase_44 | AC | 94 ms
15,732 KB |
testcase_45 | AC | 94 ms
15,644 KB |
testcase_46 | AC | 92 ms
15,732 KB |
testcase_47 | AC | 92 ms
15,764 KB |
testcase_48 | AC | 91 ms
15,744 KB |
testcase_49 | AC | 87 ms
15,780 KB |
testcase_50 | AC | 91 ms
15,640 KB |
testcase_51 | AC | 89 ms
15,744 KB |
testcase_52 | AC | 87 ms
15,640 KB |
testcase_53 | AC | 89 ms
15,708 KB |
testcase_54 | AC | 72 ms
14,976 KB |
testcase_55 | AC | 83 ms
15,488 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<int(n);++i) #define rep2(i,a,n) for(int i=int(a);i<int(n);++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif #define M_PI 3.14159265358979323846 using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() >> 2; constexpr int inf=numeric_limits<int>::max() >> 1; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, k;cin>>n>>k; n *= 2; veci a(k); rep(i, k) cin>>a[i], a[i]--; rep(i, 1, k) a[i] -= a[0]; a[0] = 0; veci cnt(n); rep(i, k) cnt[a[i]]++; rep(i, 1, n) cnt[i] += cnt[i - 1]; veci dp(n), dp2(n); auto f = [&](int len){ rep(i, n) dp[i] = -1; int p = 0; rep(i, 1, n){ if(i % 2){ int j = i - len; if(j <= 0 || p == 0){ chmin(j, p - 1); j += n; if(j % 2 == 0) j--; if(cnt[j] == k) dp[i] = 0, dp2[i] = j; }else{ if(j % 2 == 0) j--; chmin(j, p - 1); if(dp[j] != -1 && cnt[i] - cnt[j] == 1) dp[i] = dp[j] + 1, dp2[i] = dp2[j]; } } if(cnt[i] - cnt[i - 1]) p = i; } rep(i, n){ if(dp[i] >= k) return 1; if(dp[i] == k - 1 && i <= dp2[i]) return 1; } return 0; }; int l = 0, r = n; while(r - l > 1){ int mid = (l + r) / 2; if(f(mid)) l = mid; else r = mid; } cout<<l<<endl; }