結果

問題 No.2890 Chiffon
ユーザー ecottea
提出日時 2024-09-13 22:15:29
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,646 ms / 2,000 ms
コード長 9,621 bytes
コンパイル時間 6,324 ms
コンパイル使用メモリ 307,640 KB
実行使用メモリ 93,120 KB
最終ジャッジ日時 2024-09-26 14:41:51
合計ジャッジ時間 43,426 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 53
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// QCFium
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = static_modint<(ll)1e9>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
template <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//O(log|ok - ng|)
/*
* okQ() ok ng
* ok
* debug_mode = true 調
*/
template <class T, class FUNC>
T meguru_search(T ok, T ng, const FUNC& okQ, bool debug_mode = false) {
// : https://twitter.com/meguru_comp/status/697008509376835584
// verify : https://atcoder.jp/contests/typical90/tasks/typical90_a
Assert(ok != ng);
#ifdef _MSC_VER
// 調
if (debug_mode) {
T step = ok < ng ? 1 : -1; T res = ok; bool is_ok = true;
for (T i = ok; i != ng + step; i += step) {
auto b = okQ(i);
if (b) {
if (!is_ok) {
cout << "not monotony!" << endl;
for (T i = ok; i != ng + step; i += step) {
cout << i << " : " << okQ(i) << endl;
}
exit(1);
}
}
else {
if (is_ok) res = i - step;
is_ok = false;
}
}
return res;
}
#endif
//
while (abs(ok - ng) > 1) {
//
T mid = (ok + ng) / 2;
// OK
if (okQ(mid)) ok = mid;
else ng = mid;
}
return ok;
/* okQ
auto okQ = [&](ll x) {
return true || false;
};
*/
}
//
/*
* Map_composite(vi f, ll M) : O(n log M)
* [0..n) f : i → f[i] f^M
*
* int apply(int x, ll m) : O(log m)
* f^m(x)
*
* ll max_right(int x, function<bool(int)>& okQ) : O(log M)
* okQ(f^m(x)) = true okQ(f^(m+1)(x)) = false m
*
*
*/
class Map_composite {
int n, K;
// nxt[k][i] : f^(2^k)[i]
vvi nxt;
public:
// [0..n) i → f[i] f^M
Map_composite(const vi& f, ll M) : n(sz(f)), K(msb(max(M, 1LL)) + 1), nxt(K, vi(n)) {
// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_be
// f^(2^0)[i] = f[i]
rep(i, n) nxt[0][i] = f[i];
// f^(2^(k+1))[i] = f^(2^k)[ f^(2^k)[i] ]
rep(k, K - 1) rep(i, n) nxt[k + 1][i] = nxt[k][nxt[k][i]];
}
Map_composite() : n(0), K(0) {}
// f^m(x)
int apply(int x, ll m) const {
// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_be
Assert(0 <= x && x < n);
int k = 0;
while (m > 0) {
if (m & 1) x = nxt[k][x];
m /= 2;
k++;
}
return x;
}
// okQ(f^m(x)) = true okQ(f^(m+1)(x)) = false m
ll max_right(int x, const function<bool(int)>& okQ) const {
// verify : https://atcoder.jp/contests/arc060/tasks/arc060_c
Assert(0 <= x && x < n);
if (!okQ(x)) return -1;
ll m = 0;
repir(k, K - 1, 0) {
m <<= 1;
if (okQ(nxt[k][x])) {
m++;
x = nxt[k][x];
}
}
return m;
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Map_composite& mc) {
rep(k, mc.K) {
os << (1LL << k) << ":" << endl;
rep(i, mc.n) os << mc.nxt[k][i] << " "; os << endl;
}
return os;
}
#endif
/* okQ
auto okQ = [&](int i) {
return true || false;
};
*/
};
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n, K;
cin >> n >> K;
vi a(K);
cin >> a;
rep(k, K) a[k] = a[k] / 2;
rep(k, K) a.push_back(a[k] + n);
dump(a);
vi nxt(2 * n + 1); int pt = 2 * K - 1;
nxt[2 * n] = 2 * n;
repir(i, 2 * n - 1, 0) {
if (pt >= 0 && a[pt] == i) {
nxt[i] = i;
pt--;
}
else {
nxt[i] = nxt[i + 1];
}
}
dump(nxt);
// x
auto okQ = [&](int x) {
dump("---------------- x:", x, "---------------");
vi f(2 * n + 1);
f[2 * n] = 2 * n;
rep(i, 2 * n) {
f[i] = max(nxt[i + 1], min(i + x, 2 * n));
}
dump(f);
Map_composite M(f, n);
rep(i, n) {
int j = M.apply(i, K);
dump("i, j:", i, j);
if (j <= i + n) return true;
}
dump("false");
return false;
};
int x = meguru_search(1, n + 1, okQ);
dump(x);
EXIT(2 * x);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0