結果

問題 No.2735 Demarcation
ユーザー 👑 AngrySadEight
提出日時 2024-04-03 02:36:47
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,095 bytes
コンパイル時間 18,833 ms
コンパイル使用メモリ 260,948 KB
最終ジャッジ日時 2025-02-20 19:47:36
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample RE * 2
other AC * 4 WA * 19 RE * 5
権限があれば一括ダウンロードができます

ソースコード

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

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>
// using mint = modint998244353;
template <typename T>
void debug(T e) {
cerr << e << endl;
}
template <typename T>
void debug(vector<T> &v) {
rep(i, v.size()) { cerr << v[i] << " "; }
cerr << endl;
}
template <typename T>
void debug(vector<vector<T>> &v) {
rep(i, v.size()) {
rep(j, v[i].size()) { cerr << v[i][j] << " "; }
cerr << endl;
}
}
template <typename T>
void debug(vector<pair<T, T>> &v) {
rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}
template <typename T>
void debug(set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); itr++) {
cerr << *itr << " ";
}
cerr << endl;
}
template <typename T>
void debug(multiset<T> &ms) {
for (auto itr = ms.begin(); itr != ms.end(); itr++) {
cerr << *itr << " ";
}
cerr << endl;
}
template <typename T>
void debug(map<T, T> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
cerr << itr->first << " " << itr->second << endl;
}
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << H << " ";
debug_out(T...);
}
int main() {
ll N;
cin >> N;
vector<ll> X(N);
for (ll i = 0; i < N; i++) {
cin >> X[i];
X[i]--;
}
vector<ll> diff_sum(N, 0);
for (ll i = 0; i < N - 1; i++) {
if (X[i] == X[i + 1]) {
diff_sum[i + 1] = diff_sum[i] + 1;
} else {
diff_sum[i + 1] = diff_sum[i];
}
}
vector<ll> kinds(N, 0);
ll Q;
cin >> Q;
for (ll i = 0; i < Q; i++) {
ll l, r, S;
cin >> l >> r >> S;
l--;
r--;
//
if (r - l >= 90) {
// 1
if (diff_sum[r] - diff_sum[l] >= 60) {
cout << 0 << endl;
} else {
if (S >= (1LL << (diff_sum[r] - diff_sum[l]))) {
cout << (1LL << (diff_sum[r] - diff_sum[l])) << endl;
} else {
cout << 0 << endl;
}
}
} else {
vector<ll> vec(r - l + 1);
for (ll j = l; j <= r; j++) {
vec[j - l] = X[j];
}
ll len = r - l + 1;
// debug(vec);
vector<ll> ans(len + 2, 0);
//
ll ok = 0;
ll ng = len + 2;
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
vector<ll> prev_idx(len + 1, -1);
ll now_kind = 0;
ll left = 0;
ll right = 0;
while (true) {
if (now_kind <= mid) {
if (right == len) {
prev_idx[right] = left;
break;
} else {
prev_idx[right] = left;
if (kinds[vec[right]] == 0) {
now_kind++;
}
kinds[vec[right]]++;
right++;
}
} else {
kinds[vec[left]]--;
if (kinds[vec[left]] == 0) {
now_kind--;
}
left++;
}
}
vector<ll> dp(len + 1, 0);
vector<ll> dp_sum(len + 1, 0);
dp[0] = 1;
dp_sum[0] = 1;
bool inf = false;
for (ll j = 1; j <= len; j++) {
ll sum_val = dp_sum[j - 1];
if (prev_idx[j] > 0) {
sum_val = (sum_val - dp_sum[prev_idx[j] - 1]);
}
if (sum_val > S) {
inf = true;
break;
}
dp[j] = sum_val;
dp_sum[j] = (dp[j] + dp_sum[j - 1]);
}
if (inf) {
ng = mid;
} else {
ok = mid;
ans[mid] = dp[len];
}
// debug(mid);
// debug(dp);
for (ll j = 0; j < len; j++) {
kinds[vec[j]] = 0;
}
}
// debug(ans);
if (ok >= len) {
cout << -1 << endl;
} else {
cout << ans[ok] << endl;
}
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0