結果
問題 | No.2890 Chiffon |
ユーザー | k1suxu |
提出日時 | 2024-09-14 01:02:57 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,959 bytes |
コンパイル時間 | 4,557 ms |
コンパイル使用メモリ | 275,448 KB |
実行使用メモリ | 338,480 KB |
最終ジャッジ日時 | 2024-09-14 01:03:28 |
合計ジャッジ時間 | 26,540 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 3 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 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,944 KB |
testcase_22 | AC | 496 ms
335,324 KB |
testcase_23 | AC | 796 ms
182,204 KB |
testcase_24 | AC | 333 ms
143,920 KB |
testcase_25 | AC | 1,497 ms
280,832 KB |
testcase_26 | AC | 1,201 ms
297,952 KB |
testcase_27 | AC | 37 ms
16,048 KB |
testcase_28 | AC | 124 ms
34,212 KB |
testcase_29 | AC | 979 ms
159,048 KB |
testcase_30 | AC | 831 ms
320,360 KB |
testcase_31 | AC | 798 ms
279,768 KB |
testcase_32 | AC | 38 ms
21,228 KB |
testcase_33 | AC | 462 ms
332,960 KB |
testcase_34 | AC | 486 ms
332,968 KB |
testcase_35 | AC | 454 ms
333,032 KB |
testcase_36 | AC | 458 ms
333,020 KB |
testcase_37 | AC | 487 ms
332,968 KB |
testcase_38 | AC | 458 ms
333,068 KB |
testcase_39 | AC | 494 ms
333,132 KB |
testcase_40 | AC | 457 ms
333,096 KB |
testcase_41 | AC | 457 ms
332,964 KB |
testcase_42 | AC | 590 ms
332,964 KB |
testcase_43 | AC | 646 ms
332,932 KB |
testcase_44 | AC | 494 ms
333,000 KB |
testcase_45 | AC | 464 ms
332,948 KB |
testcase_46 | AC | 484 ms
332,960 KB |
testcase_47 | AC | 469 ms
332,960 KB |
testcase_48 | AC | 487 ms
332,960 KB |
testcase_49 | AC | 503 ms
332,960 KB |
testcase_50 | AC | 475 ms
333,020 KB |
testcase_51 | AC | 476 ms
333,020 KB |
testcase_52 | AC | 498 ms
332,992 KB |
testcase_53 | TLE | - |
testcase_54 | AC | 468 ms
332,540 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define all(x) x.begin(),x.end() //#define mp make_pair #define vi vector<int> #define vvi vector<vi> #define vvvi vector<vvi> #define vvvvi vector<vvvi> #define pii pair<int,int> #define vpii vector<pair<int,int>> template<typename T> bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}} template<typename T> bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits<long long>::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 998244353; int dx[] = {1, 0, -1, 0, -1, -1, 1, 1}; int dy[] = {0, 1, 0, -1, -1, 1, -1, 1}; #define int long long void solve() { int n, k; cin >> n >> k; vi a(k); FOR(k) cin >> a[i]; int obvious_upper = 2 * n/ k; vector<bool> strawberry(2*n, false); FOR(k) { strawberry[a[i]] = true; if(k > 2) chmin(obvious_upper, abs(a[i] - a[(i+2)%k])); } auto cal_dist = [n](int from, int to) -> int { if(from < to) return to - from; return 2*n - from + to; }; vi bits; FOR(20) if(k>>i&1) bits.emplace_back(i); int l = 0, r = obvious_upper+1; while(r-l > 1) { int mid = (l + r) / 2; vi to(2*n, -1); int cur_r = 0; int strawberry_cnt = 0; for(int i = 0; i < 2*n; i += 2) { while(strawberry_cnt == 0 || cur_r-i < mid) { if(strawberry[(cur_r+1) % (2*n)]) ++strawberry_cnt; cur_r += 2; } to[i] = cur_r % (2 * n); if(strawberry[(i + 1) % (2*n)]) --strawberry_cnt; } vvi distd(20, vi(2*n, -1)), tod(20, vi(2*n, -1)); for(int i = 0; i < 2*n; i += 2) distd[0][i] = cal_dist(i, to[i]); tod[0] = to; rep(lg, 19) for(int i = 0; i < 2*n; i += 2) { tod[lg+1][i] = tod[lg][tod[lg][i]]; distd[lg+1][i] = distd[lg][i] + distd[lg][tod[lg][i]]; } // cerr << mid << endl; // FOR(2*n) cout << to[i] << " \n"[i == 2*n-1]; bool can_cut = false; for(int i = 0; i < 2*n; i += 2) { int cur_place = i, dist = 0; for(int &bit : bits) { dist += distd[bit][cur_place]; cur_place = tod[bit][cur_place]; } if(dist <= 2 * n) { can_cut = true; break; } } if(can_cut) l = mid; else r = mid; } cout << l << endl; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }