結果
問題 | No.1921 Range LthKth Query |
ユーザー | hitonanode |
提出日時 | 2022-05-02 00:59:24 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,052 bytes |
コンパイル時間 | 1,953 ms |
コンパイル使用メモリ | 180,356 KB |
実行使用メモリ | 52,480 KB |
最終ジャッジ日時 | 2024-07-01 03:21:09 |
合計ジャッジ時間 | 16,099 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,376 KB |
testcase_02 | AC | 3 ms
5,376 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 4 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 3 ms
5,376 KB |
testcase_09 | AC | 5 ms
5,376 KB |
testcase_10 | AC | 7 ms
5,376 KB |
testcase_11 | AC | 31 ms
7,568 KB |
testcase_12 | AC | 70 ms
12,288 KB |
testcase_13 | AC | 496 ms
35,712 KB |
testcase_14 | AC | 696 ms
43,776 KB |
testcase_15 | AC | 1,203 ms
51,456 KB |
testcase_16 | AC | 614 ms
36,736 KB |
testcase_17 | AC | 697 ms
39,936 KB |
testcase_18 | WA | - |
testcase_19 | AC | 1,092 ms
52,480 KB |
testcase_20 | AC | 887 ms
52,480 KB |
testcase_21 | AC | 341 ms
27,904 KB |
testcase_22 | AC | 1,077 ms
52,352 KB |
evil_01.txt | RE | - |
evil_02.txt | RE | - |
evil_03.txt | RE | - |
ソースコード
#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 <numeric> #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, typename V> void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); } template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } 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; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <typename 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 <typename 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 <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } #endif template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const 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) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl #define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr) #else #define dbg(x) 0 #define dbgif(cond, x) 0 #endif // 2-dimentional 1-indexed BIT (i : [1, lenX][1, lenY]) template <typename T, int lenX, int lenY> struct BIT_2D { std::array<T, (lenX + 1) * (lenY + 1)> val; constexpr static int M = lenY + 1; BIT_2D() {} void add(int posx, int posy, T v) noexcept { for (int x = posx; x <= lenX; x += x & -x) { for (int y = posy; y <= lenY; y += y & -y) val[x * M + y] += v; } } // [1, posx] * [1, posy] の和 T sum(int posx, int posy) const noexcept { T res = 0; for (int x = posx; x > 0; x -= x & -x) { for (int y = posy; y > 0; y -= y & -y) { res += val[x * M + y]; } } return res; } // [xmin, xmax] * [ymin, ymax] の和(閉区間) T sum(int xmin, int xmax, int ymin, int ymax) const noexcept { return sum(xmax, ymax) - sum(xmin - 1, ymax) - sum(xmax, ymin - 1) + sum(xmin - 1, ymin - 1); } }; int main() { int N, K, L; cin >> N >> K >> L; vector<int> A(N); cin >> A; vector X(N, vector<short>(N, -1)); REP(i, N) { priority_queue<int> pq; FOR(j, i, N) { pq.push(A[j]); if (int(pq.size()) > K) pq.pop(); if (int(pq.size()) == K) X[i][j] = pq.top(); } } // vector bit(N + 1, vector<int>(N + 2)); BIT_2D<int, 2525, 2525> bit; vector ret(N, vector<short>(N, -1)); REP(r, N) { REP(l, r + 1) { if (X[l][r] >= 0) bit.add(l + 1, X[l][r], 1); } int current_sol = N + 1; IREP(l, r + 1) { while (current_sol > 2 and bit.sum(l + 1, r + 2, 1, current_sol - 1) >= L) --current_sol; ret[l][r] = current_sol; } } int Q; cin >> Q; while (Q--) { int l, r; cin >> l >> r; --l, --r; cout << ret[l][r] << '\n'; } }