結果
| 問題 |
No.3059 Range Tournament
|
| コンテスト | |
| ユーザー |
 hitonanode
|
| 提出日時 | 2025-03-14 23:16:59 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,168 bytes |
| コンパイル時間 | 3,705 ms |
| コンパイル使用メモリ | 243,744 KB |
| 実行使用メモリ | 7,328 KB |
| 最終ジャッジ日時 | 2025-03-14 23:17:10 |
| 合計ジャッジ時間 | 10,869 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | WA * 2 |
| other | WA * 5 TLE * 1 -- * 21 |
ソースコード
#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_LOCAL
const 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
#include <cassert>
#include <vector>
// Static sequence sparse table
// Complexity: O(NlogN) for precalculation, O(1) per query
template <class S, S (*op)(S, S), S (*e)()> struct sparse_table {
int N, lgN;
std::vector<std::vector<S>> d;
std::vector<int> lgx_table;
sparse_table() {}
sparse_table(const std::vector<S> &sequence) : N(sequence.size()) {
lgx_table.resize(N + 1);
for (int i = 2; i < N + 1; ++i) lgx_table[i] = lgx_table[i >> 1] + 1;
lgN = lgx_table[N] + 1;
d.assign(lgN, std::vector<S>(N, e()));
d[0] = sequence;
for (int h = 1; h < lgN; ++h) {
for (int i = 0; i + (1 << h) <= N; ++i) {
d[h][i] = op(d[h - 1][i], d[h - 1][i + (1 << (h - 1))]);
}
}
}
S prod(int l, int r) const { // [l, r), 0-indexed
assert(l >= 0 and r <= N);
if (l >= r) return e();
int h = lgx_table[r - l];
return op(d[h][l], d[h][r - (1 << h)]);
}
};
int op(int l, int r) { return max(l, r); }
int e() { return -1; }
int main() {
int N;
cin >> N;
vector<int> P(N);
cin >> P;
REP(i, N) P.at(i)--;
dbg(P);
vector<int> A = P;
A.reserve(N * 2);
REP(i, N) {
if (i % 2 == 0) A.push_back(max(A.at(i), A.at((i + 1) % N)));
}
REP(i, N) {
if (i % 2 == 1) A.push_back(max(A.at(i), A.at((i + 1) % N)));
}
auto encode = [&](int i) {
if (i % 2 == 0) return N + i / 2;
return N + (N + 1) / 2 + i / 2;
};
REP(i, N) dbg(make_tuple(i, encode(i) - N));
dbg(A);
dbg(make_tuple(N, A.size()));
sparse_table<int, op, e> st(A);
using Tournament = tuple<int, int, int>; // (length, left, right)
map<Tournament, int> memo;
vector<int> ret(N);
vector<int> cs(N * 2 + 1);
int Q;
cin >> Q;
while (Q--) {
int L, R;
cin >> L >> R;
--L;
const int D = 1 << floor_lg(R - L);
dbg(make_tuple(L, R, D));
const int red = R - L - D;
vector<pint> segs;
segs.emplace_back(L + red * 2, R);
if (red) {
segs.emplace_back(encode(L), encode(L) + red);
cs.at(encode(L))++;
cs.at(encode(L) + red)--;
}
while (segs.size() > 1) {
auto [l1, r1] = segs.at(0);
auto [l2, r2] = segs.at(1);
const int s1 = r1 - l1, s2 = r2 - l2;
ret.at(max(st.prod(l1, r1), st.prod(l2, r2)))++;
const int nxtsz = (s1 + s2) / 2;
if (s1 < s2) {
memo[{nxtsz, r2 - nxtsz, r2}]++;
segs = {{l1, r1}, {l2, r2 - nxtsz}};
} else if (s1 > s2) {
memo[{nxtsz, l1, l1 + nxtsz}]++;
segs = {{l1, r1 - nxtsz}, {l2, r2}};
} else {
memo[{nxtsz, l1, r1}]++;
memo[{nxtsz, l2, r2}]++;
break;
}
}
}
while (memo.size()) {
auto itr = prev(memo.end());
auto [len, left, right] = itr->first;
if (len == 1) break;
const auto cnt = itr->second;
memo.erase(prev(memo.end()));
const int mid = (left + right) / 2;
ret.at(max(st.prod(left, mid), st.prod(mid, right))) += cnt;
if (len > 2) {
memo[{len / 2, left, mid}] += cnt;
memo[{len / 2, mid, right}] += cnt;
}
}
FOR(i, 1, cs.size()) cs.at(i) += cs.at(i - 1);
REP(i, A.size()) ret.at(A.at(i)) += cs.at(i);
for (auto x : ret) cout << x << '\n';
}