結果

問題 No.2890 Chiffon
ユーザー ponjuiceponjuice
提出日時 2024-09-13 21:59:05
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,622 ms / 2,000 ms
コード長 6,551 bytes
コンパイル時間 5,644 ms
コンパイル使用メモリ 318,468 KB
実行使用メモリ 32,404 KB
最終ジャッジ日時 2024-09-26 14:40:39
合計ジャッジ時間 35,234 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 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 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 184 ms
6,912 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 1 ms
5,376 KB
testcase_15 AC 1 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 1 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 2 ms
5,376 KB
testcase_22 AC 1 ms
5,376 KB
testcase_23 AC 1,488 ms
32,404 KB
testcase_24 AC 122 ms
5,376 KB
testcase_25 AC 96 ms
5,376 KB
testcase_26 AC 190 ms
6,400 KB
testcase_27 AC 220 ms
6,680 KB
testcase_28 AC 8 ms
5,376 KB
testcase_29 AC 22 ms
5,376 KB
testcase_30 AC 105 ms
5,376 KB
testcase_31 AC 256 ms
7,040 KB
testcase_32 AC 218 ms
6,656 KB
testcase_33 AC 16 ms
5,376 KB
testcase_34 AC 1,173 ms
17,172 KB
testcase_35 AC 987 ms
17,168 KB
testcase_36 AC 991 ms
17,164 KB
testcase_37 AC 1,016 ms
17,168 KB
testcase_38 AC 982 ms
17,172 KB
testcase_39 AC 1,149 ms
17,168 KB
testcase_40 AC 1,335 ms
17,168 KB
testcase_41 AC 991 ms
17,168 KB
testcase_42 AC 1,622 ms
17,296 KB
testcase_43 AC 1,244 ms
17,168 KB
testcase_44 AC 1,049 ms
17,296 KB
testcase_45 AC 1,060 ms
17,164 KB
testcase_46 AC 1,041 ms
17,172 KB
testcase_47 AC 1,054 ms
17,172 KB
testcase_48 AC 1,043 ms
17,172 KB
testcase_49 AC 1,481 ms
17,172 KB
testcase_50 AC 1,495 ms
17,292 KB
testcase_51 AC 1,511 ms
17,312 KB
testcase_52 AC 1,497 ms
17,168 KB
testcase_53 AC 1,475 ms
17,300 KB
testcase_54 AC 267 ms
7,048 KB
testcase_55 AC 1,002 ms
13,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

//高速化 
struct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;
//#define endl '\n' //インタラクティブ問題の時は消す

//型
using ll = long long;
using ld = long double;
using mint = modint998244353;//1000000007;
template<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;
using vi = vc<int>;  using vvi = vvc<int>;  using vvvi = vvvc<int>;
using vl = vc<ll>;   using vvl = vvc<ll>;   using vvvl = vvvc<ll>;
using pi = pair<int, int>;  using pl = pair<ll, ll>;
using ull = unsigned ll;
template<class T>using priq = priority_queue<T>;
template<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;

// for文
#define overload4(a, b, c, d, e, ...) e
#define rep1(n)             for(ll i = 0; i < n; i++)
#define rep2(i, n)          for(ll i = 0; i < n; i++)
#define rep3(i, a, b)       for(ll i = a; i < b; i++)
#define rep4(i, a, b, step) for(ll i = a; i < b; i+= step)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define per1(n)             for(ll i = n-1; i >= 0; i--)
#define per2(i, n)          for(ll i = n-1; i >= 0; i--)
#define per3(i, a, b)       for(ll i = b-1; i >= a; i--)
#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)
#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)
#define fore1(a)       for(auto&& i : a)	
#define fore2(i,a)     for(auto&& i : a)
#define fore3(x,y,a)   for(auto&& [x, y] : a)
#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)
#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)

//関数
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define si(x) (ll)(x).size()
template<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}
template<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}
template<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}
template<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}
template<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}
template<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}
template<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}

//入出力(operator)
template<int T>istream&operator>>(istream&is,static_modint<T>&a){ll v;is>>v;a=v;return is;}
istream&operator>>(istream&is,modint&a){ll v;cin>>v;a=v;return is;}
template<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}
template<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}

template<int T>ostream&operator<<(ostream&os,static_modint<T>a){return os<<a.val();}
ostream&operator<<(ostream&os,modint a){return os<<a.val();}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<" "<<a.b;}
template<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<" ";return os;}
template<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<"\n";return os;}

//入出力(関数)
vi readvi(ll n){vi a(n);cin>>a;return a;}
vl readvl(ll n){vl a(n);cin>>a;return a;}
vvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].emplace_back(b);if(bidirected)g[b].emplace_back(a);}return g;}
vvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].emplace_back(b,c);if(bidirected)g[b].emplace_back(a,c);}return g;}
vvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}
vvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}

inline void yes(){cout << "Yes\n";}
inline void no(){cout << "No\n";}
inline void yesno(bool y = true){if(y)yes();else no();}
inline void print(){cout<<endl;}
template<class T>inline void print(T a){cout<<a<<endl;}
template<class T,class... Ts>inline void print(T a,Ts ...b){cout<<a;(cout<<...<<(cout<<' ',b));cout<<endl;}

//定数
constexpr ll mod = 998244353;
constexpr ll minf=-(1<<29);
constexpr ll inf=(1<<29);
constexpr ll MINF=-(1LL<<60);
constexpr ll INF=(1LL<<60);
constexpr ld EPS = 1e-8;
const ld PI = acosl(-1);
#define equals(a, b) (abs((a) - (b)) < EPS)
const int dx[4] ={-1, 0, 1, 0};
const int dy[4] ={ 0, 1, 0,-1};
const int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};
const int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};

void solve();
int main() {
	int t = 1;
    // cin >>t;
    while(t--)solve();
}

void solve(){
    int n,k;
    cin >> n >> k;
    vi a = readvi(k);
    rep(i,k) a[i] /= 2;
    set<int> st(all(a));

    auto check = [&](int l)-> bool {
        vi nx(n,-1);
        rep(i,n){
            auto itr = st.lower_bound(i);
            int ind;
            if(itr == st.end()){
                itr = st.begin();
                ind = n + *itr+1;
            }else ind = *itr+1;
            
            auto nxitr = next(itr);
            int nind;
            if(nxitr == st.end()){
                nxitr = st.begin();
                nind = n + *nxitr+1;
            }
            else{
                if(ind >= n) nind = n + *nxitr+1;
                else nind = *nxitr +1;
            }

            if(ind - i >= l) nx[i] = ind % n;
            else if(nind - i > l) nx[i] = (i+l) % n; 
        }

        vi saw(n,0);
        int ww = 0;
        rep(i,n){
            if(saw[i] == 0){
                int nw = i;
                ww++;
                while(true){
                    if(saw[nw] == ww) return true;
                    if(saw[nw] != 0) break;
                    saw[nw] = ww;
                    if(nx[nw] == -1) break;
                    nw = nx[nw];
                }
            }
        }
        return false;
    };

    int ok = 1, ng = n;
    while(ng - ok > 1){
        int mid = (ok + ng) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }

    print(ok * 2);
}
0