結果
| 問題 | No.2809 Sort Query |
| ユーザー |
👑  rin204
|
| 提出日時 | 2024-07-12 22:19:58 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,510 ms / 2,000 ms |
| コード長 | 14,144 bytes |
| コンパイル時間 | 4,372 ms |
| コンパイル使用メモリ | 279,176 KB |
| 実行使用メモリ | 71,232 KB |
| 最終ジャッジ日時 | 2024-07-12 22:21:34 |
| 合計ジャッジ時間 | 69,482 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | AC | 674 ms
68,028 KB |
| testcase_02 | AC | 675 ms
68,056 KB |
| testcase_03 | AC | 616 ms
67,912 KB |
| testcase_04 | AC | 672 ms
68,040 KB |
| testcase_05 | AC | 617 ms
68,148 KB |
| testcase_06 | AC | 505 ms
65,624 KB |
| testcase_07 | AC | 500 ms
65,752 KB |
| testcase_08 | AC | 523 ms
65,752 KB |
| testcase_09 | AC | 494 ms
65,752 KB |
| testcase_10 | AC | 526 ms
65,756 KB |
| testcase_11 | AC | 1,062 ms
66,544 KB |
| testcase_12 | AC | 997 ms
66,412 KB |
| testcase_13 | AC | 1,027 ms
66,544 KB |
| testcase_14 | AC | 1,036 ms
66,416 KB |
| testcase_15 | AC | 1,061 ms
66,548 KB |
| testcase_16 | AC | 1,064 ms
66,416 KB |
| testcase_17 | AC | 1,075 ms
66,544 KB |
| testcase_18 | AC | 1,009 ms
66,548 KB |
| testcase_19 | AC | 1,069 ms
66,540 KB |
| testcase_20 | AC | 1,082 ms
66,544 KB |
| testcase_21 | AC | 1,460 ms
71,232 KB |
| testcase_22 | AC | 1,492 ms
71,196 KB |
| testcase_23 | AC | 1,451 ms
71,160 KB |
| testcase_24 | AC | 1,458 ms
71,028 KB |
| testcase_25 | AC | 1,510 ms
71,160 KB |
| testcase_26 | AC | 1,163 ms
68,812 KB |
| testcase_27 | AC | 1,144 ms
68,732 KB |
| testcase_28 | AC | 1,166 ms
68,736 KB |
| testcase_29 | AC | 1,154 ms
68,900 KB |
| testcase_30 | AC | 1,153 ms
68,836 KB |
| testcase_31 | AC | 843 ms
65,248 KB |
| testcase_32 | AC | 810 ms
65,372 KB |
| testcase_33 | AC | 832 ms
65,252 KB |
| testcase_34 | AC | 829 ms
65,380 KB |
| testcase_35 | AC | 838 ms
65,248 KB |
| testcase_36 | AC | 1,001 ms
66,472 KB |
| testcase_37 | AC | 1,040 ms
66,540 KB |
| testcase_38 | AC | 1,040 ms
66,420 KB |
| testcase_39 | AC | 1,056 ms
66,432 KB |
| testcase_40 | AC | 1,039 ms
66,544 KB |
| testcase_41 | AC | 640 ms
66,508 KB |
| testcase_42 | AC | 681 ms
66,508 KB |
| testcase_43 | AC | 670 ms
66,500 KB |
| testcase_44 | AC | 648 ms
66,544 KB |
| testcase_45 | AC | 673 ms
66,508 KB |
| testcase_46 | AC | 563 ms
66,632 KB |
| testcase_47 | AC | 577 ms
66,508 KB |
| testcase_48 | AC | 612 ms
66,508 KB |
| testcase_49 | AC | 564 ms
66,564 KB |
| testcase_50 | AC | 592 ms
66,508 KB |
| testcase_51 | AC | 1,011 ms
66,380 KB |
| testcase_52 | AC | 956 ms
66,508 KB |
| testcase_53 | AC | 833 ms
66,504 KB |
| testcase_54 | AC | 831 ms
66,508 KB |
| testcase_55 | AC | 855 ms
66,504 KB |
| testcase_56 | AC | 425 ms
45,712 KB |
| testcase_57 | AC | 362 ms
37,116 KB |
| testcase_58 | AC | 329 ms
37,240 KB |
| testcase_59 | AC | 323 ms
36,080 KB |
| testcase_60 | AC | 477 ms
49,428 KB |
| testcase_61 | AC | 574 ms
59,628 KB |
| testcase_62 | AC | 334 ms
37,396 KB |
| testcase_63 | AC | 486 ms
47,944 KB |
| testcase_64 | AC | 626 ms
63,588 KB |
| testcase_65 | AC | 390 ms
41,712 KB |
| testcase_66 | AC | 3 ms
6,944 KB |
| testcase_67 | AC | 2 ms
6,940 KB |
| testcase_68 | AC | 2 ms
6,940 KB |
| testcase_69 | AC | 2 ms
6,940 KB |
| testcase_70 | AC | 2 ms
6,944 KB |
ソースコード
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE
#include <bits/stdc++.h>
using namespace std;
namespace templates {
// type
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on
// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)
// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on
// const value
const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;
const double PI = acos(-1);
// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)
// function
vector<char> stoc(string &S) {
int n = S.size();
vector<char> ret(n);
for (int i = 0; i < n; i++) ret[i] = S[i];
return ret;
}
string ctos(vector<char> &S) {
int n = S.size();
string ret = "";
for (int i = 0; i < n; i++) ret += S[i];
return ret;
}
template <class T>
auto min(const T &a) {
return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
auto b = clamp(a, l, r);
return (a != b ? a = b, 1 : 0);
}
template <typename T>
T sum(vector<T> &A) {
T tot = 0;
for (auto a : A) tot += a;
return tot;
}
template <typename T>
vector<T> compression(vector<T> X) {
sort(all(X));
X.erase(unique(all(X)), X.end());
return X;
}
// input and output
namespace io {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
for (auto &a : A) is >> a;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << ' ';
}
return os;
}
// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
for (auto &a : A) is >> a;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << endl;
}
return os;
}
// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
is >> A.first >> A.second;
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
os << A.first << ' ' << A.second;
return os;
}
// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
is >> A[i];
}
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << endl;
}
return os;
}
// tuple
template <typename T, size_t N>
struct TuplePrint {
static ostream &print(ostream &os, const T &t) {
TuplePrint<T, N - 1>::print(os, t);
os << ' ' << get<N - 1>(t);
return os;
}
};
template <typename T>
struct TuplePrint<T, 1> {
static ostream &print(ostream &os, const T &t) {
os << get<0>(t);
return os;
}
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
return os;
}
// io functions
void FLUSH() {
cout << flush;
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(Tail)) cout << spa;
print(std::forward<Tail>(tail)...);
}
template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
int n = A.size();
for (int i = 0; i < n; i++) {
cout << A[i];
if (i != n - 1) cout << sep;
}
cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
cout << A << end;
}
template <typename T>
void prispa(T A) {
priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
if (f)
print(A);
else
print(B);
return f;
}
template <class... T>
void inp(T &...a) {
(cin >> ... >> a);
}
} // namespace io
using namespace io;
// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<int>> edges(n, vector<int>());
for (int i = 0; i < m; i++) {
INT(u, v);
u -= indexed;
v -= indexed;
edges[u].push_back(v);
if (!direct) edges[v].push_back(u);
}
return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
return read_edges(n, n - 1, false, indexed);
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
for (int i = 0; i < m; i++) {
INT(u, v);
T w;
inp(w);
u -= indexed;
v -= indexed;
edges[u].push_back({v, w});
if (!direct) edges[v].push_back({u, w});
}
return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
return read_wedges<T>(n, n - 1, false, indexed);
}
// yes / no
namespace yesno {
// yes
inline bool yes(bool f = true) {
cout << (f ? "yes" : "no") << endl;
return f;
}
inline bool Yes(bool f = true) {
cout << (f ? "Yes" : "No") << endl;
return f;
}
inline bool YES(bool f = true) {
cout << (f ? "YES" : "NO") << endl;
return f;
}
// no
inline bool no(bool f = true) {
cout << (!f ? "yes" : "no") << endl;
return f;
}
inline bool No(bool f = true) {
cout << (!f ? "Yes" : "No") << endl;
return f;
}
inline bool NO(bool f = true) {
cout << (!f ? "YES" : "NO") << endl;
return f;
}
// possible
inline bool possible(bool f = true) {
cout << (f ? "possible" : "impossible") << endl;
return f;
}
inline bool Possible(bool f = true) {
cout << (f ? "Possible" : "Impossible") << endl;
return f;
}
inline bool POSSIBLE(bool f = true) {
cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return f;
}
// impossible
inline bool impossible(bool f = true) {
cout << (!f ? "possible" : "impossible") << endl;
return f;
}
inline bool Impossible(bool f = true) {
cout << (!f ? "Possible" : "Impossible") << endl;
return f;
}
inline bool IMPOSSIBLE(bool f = true) {
cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return f;
}
// Alice Bob
inline bool Alice(bool f = true) {
cout << (f ? "Alice" : "Bob") << endl;
return f;
}
inline bool Bob(bool f = true) {
cout << (f ? "Bob" : "Alice") << endl;
return f;
}
// Takahashi Aoki
inline bool Takahashi(bool f = true) {
cout << (f ? "Takahashi" : "Aoki") << endl;
return f;
}
inline bool Aoki(bool f = true) {
cout << (f ? "Aoki" : "Takahashi") << endl;
return f;
}
} // namespace yesno
using namespace yesno;
} // namespace templates
using namespace templates;
template <typename T>
struct BIT {
int n;
std::vector<T> tree;
BIT(int n) : n(n) {
tree.assign(n + 1, T(0));
}
BIT() = default;
T _sum(int i) {
i++;
T res = T(0);
while (i > 0) {
res += tree[i];
i -= i & -i;
}
return res;
}
T sum(int l, int r) {
return _sum(r - 1) - _sum(l - 1);
}
T sum(int r) {
return _sum(r - 1);
}
T get(int i) {
return _sum(i) - _sum(i - 1);
}
void add(int i, T x) {
i++;
while (i <= n) {
tree[i] += x;
i += i & -i;
}
}
int lower_bound(T x) {
int pos = 0;
int plus = 1;
while (plus * 2 <= n) plus *= 2;
while (plus > 0) {
if ((pos + plus <= n) && (tree[pos + plus] < x)) {
x -= tree[pos + plus];
pos += plus;
}
plus >>= 1;
}
return pos;
}
};
void solve() {
INT(n, Q);
VEC(ll, A, n);
auto X = A;
vvec(ll, query, Q);
fori(i, Q) {
INT(t);
if (t == 1) {
LL(k, x);
query[i] = {t, k, x};
X.push_back(x);
} else if (t == 2) {
query[i] = {t};
} else {
LL(k);
query[i] = {t, k};
}
}
X = compression(X);
for (auto &a : A) {
a = lower_bound(all(X), a) - X.begin();
}
BIT<ll> bit(len(X));
for (auto a : A) bit.add(a, 1);
map<int, ll> fr;
map<int, ll> to;
{
auto Y = A;
sort(all(Y));
fori(i, n) {
fr[i + 1] = Y[i];
to[i + 1] = A[i];
}
}
fori(i, Q) {
if (query[i][0] == 1) {
int k = query[i][1];
ll x = query[i][2];
x = lower_bound(all(X), x) - X.begin();
if (!fr.count(k)) {
ll bef = bit.lower_bound(k);
fr[k] = bef;
}
to[k] = x;
} else if (query[i][0] == 2) {
for (auto [k, x] : fr) {
bit.add(x, -1);
bit.add(to[k], 1);
}
fr.clear();
to.clear();
} else {
int k = query[i][1];
int x;
if (to.count(k)) {
x = to[k];
} else {
x = bit.lower_bound(k);
}
print(X[x]);
}
}
}
int main() {
#ifndef INTERACTIVE
cin.tie(0)->sync_with_stdio(0);
#endif
// cout << fixed << setprecision(12);
int t;
t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// #include "data_structure/BIT.hpp"
//
// void solve() {
// INT(n, Q);
// VEC(ll, A, n);
// auto X = A;
// vvec(ll, query, Q);
// fori(i, Q) {
// INT(t);
// if (t == 1) {
// LL(k, x);
// query[i] = {t, k, x};
// X.push_back(x);
// } else if (t == 2) {
// query[i] = {t};
// } else {
// LL(k);
// query[i] = {t, k};
// }
// }
//
// X = compression(X);
// for (auto &a : A) {
// a = lower_bound(all(X), a) - X.begin();
// }
// BIT<ll> bit(len(X));
// for (auto a : A) bit.add(a, 1);
// map<int, ll> fr;
// map<int, ll> to;
// {
// auto Y = A;
// sort(all(Y));
// fori(i, n) {
// fr[i + 1] = Y[i];
// to[i + 1] = A[i];
// }
// }
// fori(i, Q) {
// if (query[i][0] == 1) {
// int k = query[i][1];
// ll x = query[i][2];
// x = lower_bound(all(X), x) - X.begin();
// if (!fr.count(k)) {
// ll bef = bit.lower_bound(k);
// fr[k] = bef;
// }
// to[k] = x;
// } else if (query[i][0] == 2) {
// for (auto [k, x] : fr) {
// bit.add(x, -1);
// bit.add(to[k], 1);
// }
// fr.clear();
// to.clear();
// } else {
// int k = query[i][1];
// int x;
// if (to.count(k)) {
// x = to[k];
// } else {
// x = bit.lower_bound(k);
// }
// print(X[x]);
// }
// }
// }
//
// int main() {
// #ifndef INTERACTIVE
// cin.tie(0)->sync_with_stdio(0);
// #endif
// // cout << fixed << setprecision(12);
// int t;
// t = 1;
// // cin >> t;
// while (t--) solve();
// return 0;
// }