結果

問題 No.1921 Range LthKth Query
ユーザー hitonanodehitonanode
提出日時 2022-05-02 00:02:24
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 7,422 bytes
コンパイル時間 2,140 ms
コンパイル使用メモリ 190,208 KB
実行使用メモリ 98,016 KB
最終ジャッジ日時 2024-07-01 01:57:18
合計ジャッジ時間 36,853 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 19 ms
28,448 KB
testcase_01 AC 21 ms
28,416 KB
testcase_02 AC 24 ms
28,416 KB
testcase_03 AC 13 ms
28,416 KB
testcase_04 AC 16 ms
28,416 KB
testcase_05 AC 20 ms
28,416 KB
testcase_06 AC 23 ms
28,416 KB
testcase_07 AC 27 ms
28,304 KB
testcase_08 AC 31 ms
28,288 KB
testcase_09 AC 36 ms
28,544 KB
testcase_10 AC 50 ms
28,544 KB
testcase_11 AC 137 ms
30,080 KB
testcase_12 AC 263 ms
31,900 KB
testcase_13 AC 1,443 ms
56,296 KB
testcase_14 AC 2,324 ms
65,420 KB
testcase_15 TLE -
testcase_16 AC 1,931 ms
57,816 KB
testcase_17 AC 2,386 ms
61,532 KB
testcase_18 AC 3,681 ms
83,052 KB
testcase_19 AC 3,520 ms
89,224 KB
testcase_20 AC 2,693 ms
94,368 KB
testcase_21 AC 309 ms
48,336 KB
testcase_22 AC 3,781 ms
98,016 KB
evil_01.txt RE -
evil_02.txt RE -
evil_03.txt RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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();
        }
    }

    int Q;
    cin >> Q;
    vector<pint> queries(Q);
    for (auto &[l, r] : queries) cin >> l >> r;

    vector<int> lo(Q, 0), hi(Q, N);
    BIT_2D<int, 2525, 2525> bit;
    REP(t, floor_lg(N) + 2) {
        vector<vector<pint>> tpls(N + 1);
        REP(i, N) FOR(j, i, N) {
            if (X[i][j] >= 0) tpls[X[i][j]].emplace_back(i, j);
        }
        REP(q, Q) tpls[(lo[q] + hi[q]) / 2].emplace_back(-1, q);

        bit.val.fill(0);
        REP(h, tpls.size()) {
            const auto &qs = tpls[h];
            for (auto p : qs) {
                if (p.first < 0) {
                    int q = p.second;
                    auto [l, r] = queries[q];
                    int su = bit.sum(l, r, l, r);
                    (su < L ? lo[q] : hi[q]) = h;

                } else {
                    auto [i, j] = p;
                    bit.add(i + 1, j + 1, 1);
                }
            }
        }
    }
    for (auto x : hi) cout << x << '\n';
}
0