結果

問題 No.2809 Sort Query
ユーザー noya2noya2
提出日時 2024-07-12 23:10:25
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,337 ms / 2,000 ms
コード長 5,776 bytes
コンパイル時間 4,971 ms
コンパイル使用メモリ 285,176 KB
実行使用メモリ 28,924 KB
最終ジャッジ日時 2024-07-12 23:12:33
合計ジャッジ時間 80,721 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 977 ms
28,796 KB
testcase_02 AC 977 ms
28,920 KB
testcase_03 AC 966 ms
28,792 KB
testcase_04 AC 971 ms
28,880 KB
testcase_05 AC 948 ms
28,916 KB
testcase_06 AC 924 ms
28,788 KB
testcase_07 AC 916 ms
28,788 KB
testcase_08 AC 927 ms
28,796 KB
testcase_09 AC 901 ms
28,792 KB
testcase_10 AC 903 ms
28,920 KB
testcase_11 AC 1,183 ms
28,920 KB
testcase_12 AC 1,201 ms
28,788 KB
testcase_13 AC 1,293 ms
28,916 KB
testcase_14 AC 1,176 ms
28,792 KB
testcase_15 AC 1,224 ms
28,920 KB
testcase_16 AC 1,194 ms
28,796 KB
testcase_17 AC 1,224 ms
28,920 KB
testcase_18 AC 1,207 ms
28,920 KB
testcase_19 AC 1,154 ms
28,792 KB
testcase_20 AC 1,165 ms
28,916 KB
testcase_21 AC 1,330 ms
28,920 KB
testcase_22 AC 1,330 ms
28,796 KB
testcase_23 AC 1,337 ms
28,880 KB
testcase_24 AC 1,337 ms
28,792 KB
testcase_25 AC 1,331 ms
28,916 KB
testcase_26 AC 1,172 ms
28,792 KB
testcase_27 AC 1,204 ms
28,792 KB
testcase_28 AC 1,176 ms
28,788 KB
testcase_29 AC 1,189 ms
28,920 KB
testcase_30 AC 1,164 ms
28,792 KB
testcase_31 AC 1,055 ms
28,792 KB
testcase_32 AC 1,100 ms
28,788 KB
testcase_33 AC 1,078 ms
28,920 KB
testcase_34 AC 1,085 ms
28,792 KB
testcase_35 AC 1,062 ms
28,920 KB
testcase_36 AC 1,126 ms
28,760 KB
testcase_37 AC 1,164 ms
28,920 KB
testcase_38 AC 1,144 ms
28,788 KB
testcase_39 AC 1,154 ms
28,796 KB
testcase_40 AC 1,148 ms
28,788 KB
testcase_41 AC 981 ms
28,924 KB
testcase_42 AC 948 ms
28,792 KB
testcase_43 AC 963 ms
28,788 KB
testcase_44 AC 998 ms
28,792 KB
testcase_45 AC 994 ms
28,796 KB
testcase_46 AC 880 ms
28,920 KB
testcase_47 AC 919 ms
28,788 KB
testcase_48 AC 904 ms
28,792 KB
testcase_49 AC 907 ms
28,796 KB
testcase_50 AC 915 ms
28,888 KB
testcase_51 AC 655 ms
28,884 KB
testcase_52 AC 667 ms
28,920 KB
testcase_53 AC 633 ms
28,920 KB
testcase_54 AC 642 ms
28,668 KB
testcase_55 AC 659 ms
28,768 KB
testcase_56 AC 617 ms
17,600 KB
testcase_57 AC 476 ms
13,568 KB
testcase_58 AC 500 ms
15,568 KB
testcase_59 AC 463 ms
11,736 KB
testcase_60 AC 709 ms
23,580 KB
testcase_61 AC 940 ms
28,456 KB
testcase_62 AC 479 ms
14,808 KB
testcase_63 AC 705 ms
18,808 KB
testcase_64 AC 1,025 ms
28,132 KB
testcase_65 AC 554 ms
20,188 KB
testcase_66 AC 2 ms
6,944 KB
testcase_67 AC 2 ms
6,944 KB
testcase_68 AC 2 ms
6,944 KB
testcase_69 AC 2 ms
6,940 KB
testcase_70 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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,-1);
    rep(i,n) st.insert(pli(i,i));
    vector<int> ids;
    // st has {pre[i],i}
    vector<ll> pre(n); iota(all(pre),0);
    auto update = [&](int k, ll x){
        int pos = st.find_by_order(k)->second;
        a[pos] = x;
        ids.emplace_back(pos);
    };
    auto csort = [&](){
        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();
    };
    auto print = [&](int k){
        auto ite = st.find_by_order(k);
        int pos = ite->second;
        if (a[pos] != -1){
            out(a[pos]);
        }
        else {
            out(ite->first);
        }
    };
    rep(i,n){
        ll x; in(x);
        update(i,x);
    }
    while (q--){
        int t; in(t);
        if (t == 1){
            int k; in(k); k--;
            ll x; in(x);
            update(k,x);
        }
        if (t == 2){
            csort();
        }
        if (t == 3){
            int k; in(k); k--;
            print(k);
        }
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0