結果
問題 | No.2735 Demarcation |
ユーザー |
![]() |
提出日時 | 2024-04-19 22:14:21 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 11,557 bytes |
コンパイル時間 | 2,280 ms |
コンパイル使用メモリ | 193,828 KB |
実行使用メモリ | 11,136 KB |
最終ジャッジ日時 | 2024-10-11 15:36:51 |
合計ジャッジ時間 | 15,672 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 27 TLE * 1 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <cmath>#include <complex>#include <deque>#include <forward_list>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iostream>#include <limits>#include <list>#include <map>#include <memory>#include <numeric>#include <optional>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v<< ','; os << ']'; return os; }template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);},tpl); return is; }template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) {((os << args << ','), ...);}, tpl); return os << ')'; }template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os<< v << ','; os << '}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os <<'}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v <<','; os << '}'; return os; }template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for(auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET<< std::endl#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " <<__FILE__ << COLOR_RESET << std::endl : std::cerr)#else#define dbg(x) ((void)0)#define dbgif(cond, x) ((void)0)#endif// Sorted set of integers [0, n)// Space complexity: (64 / 63) n + O(log n) bitclass fast_set {static constexpr int B = 64;int n;int cnt;std::vector<std::vector<uint64_t>> _d;static int bsf(uint64_t x) { return __builtin_ctzll(x); }static int bsr(uint64_t x) { return 63 - __builtin_clzll(x); }public:// 0 以上 n_ 未満の整数が入れられる sorted set を作成fast_set(int n_) : n(n_), cnt(0) {do { n_ = (n_ + B - 1) / B, _d.push_back(std::vector<uint64_t>(n_)); } while (n_ > 1);}bool contains(int i) const {assert(0 <= i and i < n);return (_d.front().at(i / B) >> (i % B)) & 1;}void insert(int i) {assert(0 <= i and i < n);if (contains(i)) return;++cnt;for (auto &vec : _d) {bool f = vec.at(i / B);vec.at(i / B) |= 1ULL << (i % B), i /= B;if (f) break;}}void erase(int i) {assert(0 <= i and i < n);if (!contains(i)) return;--cnt;for (auto &vec : _d) {vec.at(i / B) &= ~(1ULL << (i % B)), i /= B;if (vec.at(i)) break;}}// i 以上の最小要素 なければ default_valint next(int i, const int default_val) const {assert(0 <= i and i <= n);for (auto itr = _d.cbegin(); itr != _d.cend(); ++itr, i = i / B + 1) {if (i / B >= int(itr->size())) break;if (auto d = itr->at(i / B) >> (i % B); d) {i += bsf(d);while (itr != _d.cbegin()) i = i * B + bsf((--itr)->at(i));return i;}}return default_val;}int next(const int i) const { return next(i, n); }// i 以下の最小要素 なければ default_valint prev(int i, int default_val = -1) const {assert(-1 <= i and i < n);for (auto itr = _d.cbegin(); itr != _d.cend() and i >= 0; ++itr, i = i / B - 1) {if (auto d = itr->at(i / B) << (B - 1 - i % B); d) {i += bsr(d) - (B - 1);while (itr != _d.cbegin()) i = i * B + bsr((--itr)->at(i));return i;}}return default_val;}// return minimum element (if exists) or `n` (empty)int min() const { return next(0); }// return maximum element (if exists) or `-1` (empty)int max() const { return prev(n - 1); }int size() const { return cnt; }bool empty() const { return cnt == 0; }void clear() {if (!cnt) return;cnt = 0;auto rec = [&](auto &&self, int d, int x) -> void {if (d) {for (auto m = _d.at(d).at(x); m;) {int i = bsf(m);m -= 1ULL << i, self(self, d - 1, x * B + i);}}_d.at(d).at(x) = 0;};rec(rec, _d.size() - 1, 0);}};int main() {int N;cin >> N;vector<int> X(N);cin >> X;vector<int> cs(N);REP(i, N - 1) cs.at(i + 1) = cs.at(i) + (X.at(i) == X.at(i + 1));dbg(cs);dbg(X);int Q;cin >> Q;fast_set fs(N + 1);constexpr lint inf = (1LL << 60) + 10;while (Q--) {auto solve = [&](int l, int r, lint S) -> int {const int sz = r - l;const int nsame = cs.at(r - 1) - cs.at(l);// check -1{lint tmp = 1;REP(_, sz - 1) {tmp *= 2;if (tmp > S) break;}if (tmp <= S) return -1;}// check 0{lint tmp = 1;REP(_, nsame) {tmp *= 2;if (tmp > S) break;}if (tmp > S) return 0;}if (sz <= 91) {vector<lint> dp(sz + 1);int ok = 1, ng = min(61, sz + 1);while (ng - ok > 1) {int mid = (ok + ng) / 2;dp.assign(sz + 1, 0);dp.at(0) = 1;FOR(i, l, r) {fs.clear();FOR(j, i, r) {fs.insert(X.at(j));if (fs.size() > mid) break;dp.at(j - l + 1) += dp.at(i - l);chmin(dp.at(j - l + 1), inf);}}if (dp.at(sz) <= S) {ok = mid;} else {ng = mid;}}return ok;}return 1;};int l, r;lint S;cin >> l >> r >> S;--l;cout << solve(l, r, S) << '\n';}}