結果

問題 No.2735 Demarcation
ユーザー ecottea
提出日時 2024-05-20 16:41:58
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 669 ms / 1,500 ms
コード長 10,241 bytes
コンパイル時間 4,442 ms
コンパイル使用メモリ 262,496 KB
最終ジャッジ日時 2025-02-21 16:18:09
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

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

#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 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
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 >= 0; 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 = 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) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
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_a(inf))
/*
* a, n min(a^n, inf)
*/
ll truncated_pow(ll a, ll n, ll inf = INFL) {
// verify : https://atcoder.jp/contests/abc322/tasks/abc322_g
Assert(a >= 0 && n >= 0);
if (n == 0 || a == 1) return 1;
if (a == 0) return 0;
ll val = 1;
for (ll i = 0; i < n; i++) {
// val * a >= inf
if (val >= (inf + a - 1) / a) {
val = inf;
break;
}
val *= a;
}
return val;
}
//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;
};
*/
}
//O(n α)
/*
* a[0..n) is_ok
* l∈[0..n] is_ok(a[l..r)) = true r≦n max_right[l]
* r∈[0..n] is_ok(a[l..r)) = true l≧0 min_left[r]
*
* is_ok( a[i..i) ) = trueis_ok 調[][] O(α)
*/
int K;
template <class T>
void two_pointers(const vector<T>& a, vi& max_right, vi& min_left) {
// verify : https://atcoder.jp/contests/typical90/tasks/typical90_ck
int n = sz(a);
max_right.resize(n + 1); min_left.resize(n + 1);
// -------------- auto ---------------
//
unordered_map<int, int> cnt;
// a[i]
auto insert_right = [&](int i) {
cnt[a[i]]++;
};
// a[i]
auto erase_left = [&](int i) {
cnt[a[i]]--;
if (cnt[a[i]] == 0) cnt.erase(a[i]);
};
// ok
auto is_ok = [&]() {
return sz(cnt) <= K;
};
// --------------------------------------------------------------
// l, r : a[l..r)
int l = 0, r = 0;
while (true) {
// is_ok( a[l..r) ) = true
if (is_ok()) {
// l r l
min_left[r] = l;
//
if (r == n) break;
// 1
insert_right(r++);
}
// is_ok( a[l..r) ) = false
else {
// r l r 1
max_right[l] = r - 1;
// 1
erase_left(l++);
}
}
// is_ok( a[l..n) ) = true l true
for (; l <= n; l++) max_right[l] = n;
}
int main() {
input_from_file("input.txt");
// output_to_file("output.txt");
dump(INFL); dump(1LL << 60);
int n;
cin >> n;
vi x(n);
cin >> x;
vi acc(n);
rep(i, n - 1) acc[i + 1] = acc[i] + (x[i] == x[i + 1]);
dump(acc);
int q;
cin >> q;
rep(hoge, q) {
int l, r; ll s;
cin >> l >> r >> s;
l--;
if (truncated_pow(2, acc[r - 1] - acc[l]) > s) {
cout << 0 << "\n";
continue;
}
if (truncated_pow(2, r - l - 1) <= s) {
cout << -1 << "\n";
continue;
}
if (pow(1.6, r - l - 1) > s + 1000) {
cout << 1 << "\n";
continue;
}
int n2 = r - l;
vi a(n2);
repi(i, l, r - 1) a[i - l] = x[i];
auto okQ = [&](int k) {
K = k;
vi ml, mr;
two_pointers(a, mr, ml);
vector<__int128> dp(n2 + 1), acc(n2 + 2);
dp[0] = 1; acc[1] = 1;
repi(i, 1, n2) {
dp[i] = acc[i] - acc[ml[i]];
acc[i + 1] = acc[i] + dp[i];
if (dp[i] > s) return false;
}
return true;
};
cout << meguru_search(1, n2, okQ) << "\n";
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0