結果

問題 No.2890 Chiffon
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2024-09-13 22:27:01
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,445 bytes
コンパイル時間 2,303 ms
コンパイル使用メモリ 207,616 KB
実行使用メモリ 11,020 KB
最終ジャッジ日時 2024-09-13 22:27:08
合計ジャッジ時間 4,882 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,812 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 WA -
testcase_14 AC 2 ms
6,940 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 2 ms
6,944 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 2 ms
6,944 KB
testcase_22 AC 96 ms
11,020 KB
testcase_23 AC 4 ms
6,940 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 6 ms
6,944 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 5 ms
6,940 KB
testcase_31 WA -
testcase_32 AC 2 ms
6,940 KB
testcase_33 AC 69 ms
10,032 KB
testcase_34 AC 27 ms
7,540 KB
testcase_35 AC 27 ms
7,544 KB
testcase_36 AC 26 ms
7,544 KB
testcase_37 AC 27 ms
7,544 KB
testcase_38 AC 27 ms
7,544 KB
testcase_39 AC 62 ms
9,908 KB
testcase_40 AC 27 ms
7,420 KB
testcase_41 AC 68 ms
9,912 KB
testcase_42 AC 62 ms
10,164 KB
testcase_43 AC 27 ms
7,544 KB
testcase_44 AC 28 ms
7,548 KB
testcase_45 AC 28 ms
7,416 KB
testcase_46 AC 27 ms
7,420 KB
testcase_47 AC 28 ms
7,544 KB
testcase_48 AC 49 ms
8,608 KB
testcase_49 AC 50 ms
8,488 KB
testcase_50 AC 49 ms
8,484 KB
testcase_51 AC 50 ms
8,488 KB
testcase_52 AC 50 ms
8,488 KB
testcase_53 WA -
testcase_54 AC 19 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
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 (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T, class U>
T ceil_div(T a, U b) {
    return (a + b - 1) / b;
}
template <class T>
T safe_mul(T a, T b) {
    if (a == 0 || b == 0) return 0;
    if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();
    return a * b;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
vector<int> gen_perm(int n) {
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
        cerr << fixed << setprecision(25);
    }
} setup_io;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
// #define mp make_pair

bool f(int x, int n, int k, vi a) {
    assert(x % 2 == 0);

    vi ini;
    for (int i = 0; i < a[0]; i += 2) {
        ini.push_back(i);
    }

    vi pos(k);
    int now = ini[0];
    pos[0] = now;
    rep(i, k - 1) {
        int next_kugiri = now + x;
        if (next_kugiri <= a[i]) {
            next_kugiri = a[i] + 1;
        }
        if (next_kugiri >= a[i + 1]) {
            return false;
        }
        now = next_kugiri;
        pos[i + 1] = now;
    }

    if (pos[0] + n - pos.back() >= x) {
        return true;
    }

    for (int st = 1; st < ini.size(); st++) {
        int now = ini[st];
        pos[0] = now;

        rep(i, k - 1) {
            int next_kugiri = now + x;
            if (next_kugiri <= a[i]) {
                next_kugiri = a[i] + 1;
            }
            if (next_kugiri >= a[i + 1]) {
                return false;
            }
            now = next_kugiri;
            if (pos[i + 1] == now) {
                break;
            }
            pos[i + 1] = now;
        }

        if (pos[0] + n - pos.back() >= x) {
            return true;
        }
    }

    return false;
}

signed main() {
    int n, k;
    cin >> n >> k;

    n *= 2;

    vi a(k);
    rep(i, k) {
        cin >> a[i];
        a[i]--;
    }

    int add = n - 1 - a.back();
    rep(i, k) {
        a[i] += add;
    }

    // DEBUG_VEC(a);

    vi evens;
    for (int i = 2; i < n; i += 2) {
        evens.push_back(i);
    }
    int ok = 0, ng = evens.size();
    while (ok + 2 < ng) {
        int mid = (ok + ng) / 2;

        if (f(evens[mid], n, k, a)) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    cout << evens[ok] << endl;
}
0