結果

問題 No.2890 Chiffon
ユーザー noya2noya2
提出日時 2024-09-13 23:19:49
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 7,206 bytes
コンパイル時間 3,582 ms
コンパイル使用メモリ 256,552 KB
実行使用メモリ 100,868 KB
最終ジャッジ日時 2024-09-26 02:48:32
合計ジャッジ時間 49,752 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 3 ms
5,376 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 2 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 2 ms
5,376 KB
testcase_22 AC 1,863 ms
100,868 KB
testcase_23 AC 1,000 ms
54,400 KB
testcase_24 AC 724 ms
43,520 KB
testcase_25 AC 1,696 ms
82,560 KB
testcase_26 AC 1,703 ms
87,332 KB
testcase_27 AC 46 ms
7,040 KB
testcase_28 AC 118 ms
12,032 KB
testcase_29 AC 819 ms
47,652 KB
testcase_30 AC 1,866 ms
93,880 KB
testcase_31 AC 1,526 ms
82,304 KB
testcase_32 AC 69 ms
8,340 KB
testcase_33 AC 1,865 ms
98,548 KB
testcase_34 AC 1,884 ms
98,548 KB
testcase_35 AC 1,883 ms
98,420 KB
testcase_36 AC 1,926 ms
98,544 KB
testcase_37 AC 1,968 ms
98,544 KB
testcase_38 AC 1,865 ms
98,540 KB
testcase_39 AC 1,885 ms
98,540 KB
testcase_40 AC 1,911 ms
98,668 KB
testcase_41 TLE -
testcase_42 AC 1,832 ms
98,544 KB
testcase_43 AC 1,856 ms
98,416 KB
testcase_44 AC 1,855 ms
98,544 KB
testcase_45 AC 1,842 ms
98,416 KB
testcase_46 AC 1,836 ms
98,656 KB
testcase_47 AC 1,880 ms
98,412 KB
testcase_48 AC 1,842 ms
98,412 KB
testcase_49 AC 1,830 ms
98,544 KB
testcase_50 AC 1,821 ms
98,412 KB
testcase_51 AC 1,846 ms
98,548 KB
testcase_52 AC 1,838 ms
98,420 KB
testcase_53 AC 1,804 ms
97,152 KB
testcase_54 AC 1,845 ms
98,016 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

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...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

void solve1(){
    int n, k; in(n,k);
    vector<int> a(k); in(a);
    rep(i,k) a.emplace_back(a[i]+n*2);
    vector<int> nxt(n*2+1,k*2);
    rep(i,k*2){
        int j = (a[i]-1)/2;
        while (j >= 0 && nxt[j] == k*2){
            nxt[j--] = i;
        }
    }
    auto jump = [&](int from, int step){
        int to = (a[nxt[from]]+1)/2;
        if (to - from < step){
            to = from + step;
        }
        if (to > n*2) return -1;
        if (nxt[to] - nxt[from] == 1) return to;
        return -1;
    };
    int le = 0, ri = n;
    const int mx = 22;
    while (ri - le > 1){
        int md = (le + ri) / 2;
        // step = md*2
        vector<vector<int>> to(mx,vector<int>(n*2,-1));
        rep(i,n*2){
            // from i*2
            to[0][i] = jump(i,md);
        }
        repp(d,1,mx){
            rep(i,n*2){
                if (to[d-1][i] == -1 || to[d-1][i] == n*2) continue;
                to[d][i] = to[d-1][to[d-1][i]];
            }
        }
        bool ok = false;
        rep(i,n){
            int cur = i;
            reb(d,mx){
                if (cur == -1 || cur == n*2) break;
                if (k >> d & 1){
                    cur = to[d][cur];
                }
            }
            if (cur == -1) continue;
            if (cur <= i+n){
                ok = true;
                break;
            }
        }
        if (ok){
            le = md;
        }
        else {
            ri = md;
        }
    }
    out(le*2);
}


void solve2(){
    int n, k; in(n,k);
    vector<int> a(k); in(a);
    vector<int> nxt(n+1,k);
    rep(i,k){
        int j = (a[i]-1)/2;
        while (j >= 0 && nxt[j] == k){
            nxt[j--] = i;
        }
    }
    auto jump = [&](int from, int step){
        assert(nxt[from] < k);
        int to = (a[nxt[from]]+1)/2;
        if (to - from < step){
            to = from + step;
        }
        if (to > n) return to;
        if (nxt[to] - nxt[from] == 1) return to;
        return -1;
    };
    int le = 0, ri = n;
    while (ri - le > 1){
        int md = (le + ri) / 2;
        int cur = 0;
        rep(t,k){
            cur = jump(cur,md);
            if (cur > n){
                if (t == k-1) break;
                cur = -1;
            }
            if (cur == -1) break;
        }
        if (cur == -1){
            ri = md;
            continue;
        }
        if (cur <= n){
            le = md;
            continue;
        }
        cur -= n;
        if (cur*2 > a[0]){
            ri = md;
            continue;
        }
        rep(t,k){
            cur = jump(cur,md*2);
            if (cur > n) cur = -1;
            if (cur == -1) break;
        }
        if (cur == -1){
            ri = md;
        }
        else {
            le = md;
        }
    }
    out(le*2);
}

void solve(){
    solve1();
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0