結果
問題 | No.2809 Sort Query |
ユーザー | noya2 |
提出日時 | 2024-07-12 22:59:07 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,508 bytes |
コンパイル時間 | 5,010 ms |
コンパイル使用メモリ | 286,428 KB |
実行使用メモリ | 28,956 KB |
最終ジャッジ日時 | 2024-07-12 23:00:24 |
合計ジャッジ時間 | 76,048 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 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 | 906 ms
27,904 KB |
testcase_12 | AC | 949 ms
27,700 KB |
testcase_13 | WA | - |
testcase_14 | AC | 950 ms
27,904 KB |
testcase_15 | AC | 916 ms
28,032 KB |
testcase_16 | AC | 900 ms
27,732 KB |
testcase_17 | AC | 934 ms
27,776 KB |
testcase_18 | AC | 890 ms
27,896 KB |
testcase_19 | AC | 897 ms
27,904 KB |
testcase_20 | AC | 1,007 ms
27,776 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 969 ms
27,852 KB |
testcase_32 | AC | 1,006 ms
27,904 KB |
testcase_33 | AC | 1,005 ms
27,904 KB |
testcase_34 | AC | 1,003 ms
27,732 KB |
testcase_35 | AC | 1,027 ms
27,904 KB |
testcase_36 | AC | 981 ms
27,864 KB |
testcase_37 | AC | 983 ms
27,904 KB |
testcase_38 | AC | 991 ms
27,788 KB |
testcase_39 | AC | 948 ms
27,896 KB |
testcase_40 | AC | 963 ms
27,684 KB |
testcase_41 | AC | 1,186 ms
27,904 KB |
testcase_42 | AC | 1,253 ms
27,836 KB |
testcase_43 | AC | 1,227 ms
27,776 KB |
testcase_44 | AC | 1,243 ms
27,904 KB |
testcase_45 | AC | 1,240 ms
27,876 KB |
testcase_46 | AC | 789 ms
27,904 KB |
testcase_47 | AC | 800 ms
27,776 KB |
testcase_48 | AC | 828 ms
27,904 KB |
testcase_49 | AC | 799 ms
27,668 KB |
testcase_50 | AC | 847 ms
27,788 KB |
testcase_51 | AC | 442 ms
27,904 KB |
testcase_52 | AC | 398 ms
27,820 KB |
testcase_53 | AC | 449 ms
27,888 KB |
testcase_54 | AC | 386 ms
27,904 KB |
testcase_55 | AC | 377 ms
27,904 KB |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | AC | 2 ms
6,940 KB |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" #line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << std::min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(std::vector<T> &v){ std::sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<class S> using orderset = tree<S, null_type, less<S>, rb_tree_tag, tree_order_statistics_node_update>; void solve(){ int n, q; in(n,q); orderset<pli> st; vector<ll> a(n); in(a); vector<int> ids(n); iota(all(ids),0); rep(i,n) st.insert(pli(a[i],i)); vector<ll> pre = a; while (q--){ int t; in(t); if (t == 1){ int k; in(k); k--; ll x; in(x); ids.emplace_back(k); a[k] = x; } if (t == 2){ for (int i : ids){ if (a[i] == -1) continue; st.erase(pli(pre[i],i)); st.insert(pli(a[i],i)); pre[i] = a[i]; a[i] = -1; } ids.clear(); } if (t == 3){ int k; in(k); k--; if (a[k] != -1){ out(a[k]); } else { auto val = st.find_by_order(k); out(val->first); } } } } int main(){ int t = 1; //in(t); while (t--) { solve(); } }