結果
| 問題 | No.2809 Sort Query |
| ユーザー |
 だれ
|
| 提出日時 | 2024-07-12 22:07:30 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,344 bytes |
| コンパイル時間 | 5,641 ms |
| コンパイル使用メモリ | 230,616 KB |
| 実行使用メモリ | 221,312 KB |
| 最終ジャッジ日時 | 2024-07-12 22:07:59 |
| 合計ジャッジ時間 | 26,246 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 143 ms
217,804 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | AC | 463 ms
221,184 KB |
| testcase_12 | AC | 483 ms
221,184 KB |
| testcase_13 | AC | 459 ms
221,224 KB |
| testcase_14 | AC | 461 ms
221,184 KB |
| testcase_15 | AC | 487 ms
221,148 KB |
| testcase_16 | AC | 463 ms
221,184 KB |
| testcase_17 | AC | 491 ms
221,204 KB |
| testcase_18 | AC | 463 ms
221,184 KB |
| testcase_19 | AC | 464 ms
221,184 KB |
| testcase_20 | AC | 500 ms
221,208 KB |
| testcase_21 | TLE | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
| testcase_45 | -- | - |
| testcase_46 | -- | - |
| testcase_47 | -- | - |
| testcase_48 | -- | - |
| testcase_49 | -- | - |
| testcase_50 | -- | - |
| testcase_51 | -- | - |
| testcase_52 | -- | - |
| testcase_53 | -- | - |
| testcase_54 | -- | - |
| testcase_55 | -- | - |
| testcase_56 | -- | - |
| testcase_57 | -- | - |
| testcase_58 | -- | - |
| testcase_59 | -- | - |
| testcase_60 | -- | - |
| testcase_61 | -- | - |
| testcase_62 | -- | - |
| testcase_63 | -- | - |
| testcase_64 | -- | - |
| testcase_65 | -- | - |
| testcase_66 | -- | - |
| testcase_67 | -- | - |
| testcase_68 | -- | - |
| testcase_69 | -- | - |
| testcase_70 | -- | - |
ソースコード
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(x) \
std::sort((x).begin(), (x).end()); \
(x).erase(std::unique((x).begin(), (x).end()), (x).end())
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned int;
using i32 = int;
using ld = long double;
using f64 = double;
template <class T, class U>
bool chmin(T& a, const U& b) {
return (b < a) ? (a = b, true) : false;
}
template <class T, class U>
bool chmax(T& a, const U& b) {
return (b > a) ? (a = b, true) : false;
}
template <class T = std::string, class U = std::string>
inline void YesNo(bool f = 0, const T yes = "Yes", const U no = "No") {
if (f)
std::cout << yes << "\n";
else
std::cout << no << "\n";
}
namespace io {
template <class T, class U>
istream& operator>>(istream& i, pair<T, U>& p) {
i >> p.first >> p.second;
return i;
}
template <class T, class U>
ostream& operator<<(ostream& o, pair<T, U>& p) {
o << p.first << " " << p.second;
return o;
}
template <typename T>
istream& operator>>(istream& i, vector<T>& v) {
rep(j, v.size()) i >> v[j];
return i;
}
template <typename T>
string join(vector<T>& v) {
stringstream s;
rep(i, v.size()) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T>
ostream& operator<<(ostream& o, vector<T>& v) {
if (v.size()) o << join(v);
return o;
}
template <typename T>
string join(vector<vector<T>>& vv) {
string s = "\n";
rep(i, vv.size()) s += join(vv[i]) + "\n";
return s;
}
template <typename T>
ostream& operator<<(ostream& o, vector<vector<T>>& vv) {
if (vv.size()) o << join(vv);
return o;
}
void OUT() { std::cout << "\n"; }
template <class Head, class... Tail>
void OUT(Head&& head, Tail&&... tail) {
std::cout << head;
if (sizeof...(tail)) std::cout << ' ';
OUT(std::forward<Tail>(tail)...);
}
void OUTL() { std::cout << std::endl; }
template <class Head, class... Tail>
void OUTL(Head&& head, Tail&&... tail) {
std::cout << head;
if (sizeof...(tail)) std::cout << ' ';
OUTL(std::forward<Tail>(tail)...);
}
void IN() {}
template <class Head, class... Tail>
void IN(Head&& head, Tail&&... tail) {
cin >> head;
IN(std::forward<Tail>(tail)...);
}
} // namespace io
using namespace io;
namespace useful {
long long modpow(long long a, long long b, long long mod) {
long long res = 1;
while (b) {
if (b & 1) res *= a, res %= mod;
a *= a;
a %= mod;
b >>= 1;
}
return res;
}
bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }
template <class T>
void rearrange(vector<T>& a, vector<int>& p) {
vector<T> b = a;
for (int i = 0; i < int(a.size()); i++) {
a[i] = b[p[i]];
}
return;
}
template <class T>
vector<pair<T, int>> rle_sequence(vector<T>& a) {
vector<pair<T, int>> res;
int n = a.size();
int l = 1;
rep(i, n - 1) {
if (a[i] == a[i + 1])
l++;
else {
res.emplace_back(a[i], l);
l = 1;
}
}
res.emplace_back(a.back(), l);
return res;
}
vector<pair<char, int>> rle_string(string a) {
vector<pair<char, int>> res;
int n = a.size();
if (n == 1) return vector<pair<char, int>>{{a[0], 1}};
int l = 1;
rep(i, n - 1) {
if (a[i] == a[i + 1])
l++;
else {
res.emplace_back(a[i], l);
l = 1;
}
}
res.emplace_back(a.back(), l);
return res;
}
vector<int> linear_sieve(int n) {
vector<int> primes;
vector<int> res(n + 1);
iota(all(res), 0);
for (int i = 2; i <= n; i++) {
if (res[i] == i) primes.emplace_back(i);
for (auto j : primes) {
if (j * i > n) break;
res[j * i] = j;
}
}
return res;
// return primes;
}
template <class T>
vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) {
int n = graph.size();
vector<long long> res(n, 2e18);
res[start] = 0;
priority_queue<pair<long long, int>, vector<pair<long long, int>>,
greater<pair<long long, int>>>
que;
que.push({0, start});
while (!que.empty()) {
auto [c, v] = que.top();
que.pop();
if (res[v] < c) continue;
for (auto [nxt, cost] : graph[v]) {
auto x = c + cost;
if (x < res[nxt]) {
res[nxt] = x;
que.push({x, nxt});
}
}
}
return res;
}
} // namespace useful
using namespace useful;
template <class T, T l, T r>
struct RandomIntGenerator {
std::random_device seed;
std::mt19937_64 engine;
std::uniform_int_distribution<T> uid;
RandomIntGenerator() {
engine = std::mt19937_64(seed());
uid = std::uniform_int_distribution<T>(l, r);
}
T gen() { return uid(engine); }
};
template <class U = unsigned int, int B = 31>
struct BinaryTrie {
static const int MAX_SIZE = B * 300001;
struct node {
int cnt;
int ch[2];
node() : cnt(0), ch(0) {}
};
static inline node nodes[MAX_SIZE];
static inline int cnter = 2;
int root;
public:
BinaryTrie() : root(1) { nodes[1] = node(); }
void insert(U x) { insert_(root, x, B); }
bool contains(U x) { return contains_(root, x, B); }
void erase(U x) { erase_(root, x, B); }
U get_kth(int k, U x = 0) { return get_kth_(root, k, x, B); }
U get_min(U x = 0) { return get_kth(0, x); }
U get_max(U x = 0) { return get_kth(nodes[root].cnt - 1, x); }
int count_less(U x, bool eq = false) { return count_less_(root, x, B, eq); }
int count_greater(U x, bool eq = false) {
return count_greater_(root, x, B, eq);
}
int count(U x) { return count_less(x) - count_less(x, true); }
private:
void insert_(int t, U x, int b) {
node& it = nodes[t];
it.cnt++;
if (b < 0) return;
if (it.ch[x >> b & 1] == 0) {
nodes[cnter] = node();
it.ch[x >> b & 1] = cnter++;
}
insert_(it.ch[x >> b & 1], x, b - 1);
return;
}
bool contains_(int t, U x, int b) {
node& it = nodes[t];
if (it.cnt <= 0) {
return false;
}
if (b < 0) return true;
return contains_(nodes[t].ch[x >> b & 1], x, b - 1);
}
bool erase_(int t, U x, int b) {
node& it = nodes[t];
if (it.cnt <= 0) return false;
if (b < 0) {
it.cnt--;
return true;
}
bool res = erase_(it.ch[x >> b & 1], x, b - 1);
it.cnt -= res;
return res;
}
U get_kth_(int t, int k, U x, int b) {
if (b == -1) return 0;
node& it = nodes[t];
int f = x >> b & 1;
if (nodes[it.ch[f]].cnt <= k) {
k -= nodes[it.ch[f]].cnt;
return get_kth_(it.ch[f ^ 1], k, x, b - 1) + (U(1) << b);
} else {
return get_kth_(it.ch[f], k, x, b - 1);
}
}
int count_less_(int t, U x, int b, bool eq) {
node& it = nodes[t];
if (b == -1) return eq ? it.cnt : 0;
if (x >> b & 1) {
return nodes[it.ch[0]].cnt + count_less_(it.ch[1], x, b - 1, eq);
} else {
return count_less_(it.ch[0], x, b - 1, eq);
}
}
int count_greater_(int t, U x, int b, bool eq) {
node& it = nodes[t];
if (b == -1) return eq ? it.cnt : 0;
if (x >> b & 1) {
return count_greater_(it.ch[1], x, b - 1, eq);
} else {
return nodes[it.ch[1]].cnt + count_greater_(it.ch[0], x, b - 1, eq);
}
}
};
int main() {
std::cout << fixed << setprecision(15);
cin.tie(nullptr);
ios::sync_with_stdio(false);
i64 n, q;
IN(n, q);
vector<i64> a(n);
IN(a);
int last = -2;
BinaryTrie<u64, 61> trie;
rep(i, n) trie.insert(a[i]);
vector<int> pre(n, -1);
rep(i, q) {
int t;
IN(t);
if (t == 1) {
i64 k, x;
IN(k, x);
k--;
if (pre[k] > last) {
trie.erase(a[k]);
trie.insert(x);
a[k] = x;
}
else {
trie.erase(trie.get_kth(k));
trie.insert(x);
a[k] = x;
}
pre[k] = i;
}
if (t == 2) {
last = i;
}
if (t == 3) {
int k;
IN(k);
k--;
if (pre[k] > last) OUT(a[k]);
else OUT(trie.get_kth(k));
}
}
}