結果

問題 No.2809 Sort Query
ユーザー woodywoodywoodywoody
提出日時 2024-07-13 01:57:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,062 bytes
コンパイル時間 5,164 ms
コンパイル使用メモリ 281,020 KB
実行使用メモリ 83,080 KB
最終ジャッジ日時 2024-07-13 01:59:07
合計ジャッジ時間 79,429 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 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 488 ms
31,392 KB
testcase_12 AC 467 ms
31,408 KB
testcase_13 WA -
testcase_14 AC 518 ms
31,388 KB
testcase_15 AC 489 ms
31,432 KB
testcase_16 AC 498 ms
31,364 KB
testcase_17 AC 528 ms
31,436 KB
testcase_18 AC 509 ms
31,328 KB
testcase_19 AC 502 ms
31,360 KB
testcase_20 AC 500 ms
31,360 KB
testcase_21 WA -
testcase_22 TLE -
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 381 ms
31,360 KB
testcase_32 AC 402 ms
31,360 KB
testcase_33 AC 375 ms
31,348 KB
testcase_34 AC 385 ms
31,412 KB
testcase_35 AC 370 ms
31,324 KB
testcase_36 AC 453 ms
31,264 KB
testcase_37 AC 432 ms
31,312 KB
testcase_38 AC 428 ms
31,312 KB
testcase_39 AC 468 ms
31,320 KB
testcase_40 AC 455 ms
31,436 KB
testcase_41 AC 1,469 ms
56,944 KB
testcase_42 AC 1,509 ms
57,240 KB
testcase_43 AC 1,497 ms
57,680 KB
testcase_44 AC 1,429 ms
58,328 KB
testcase_45 AC 1,417 ms
56,924 KB
testcase_46 AC 796 ms
56,540 KB
testcase_47 AC 762 ms
56,712 KB
testcase_48 AC 809 ms
57,044 KB
testcase_49 AC 767 ms
57,864 KB
testcase_50 AC 782 ms
56,712 KB
testcase_51 AC 759 ms
62,896 KB
testcase_52 AC 663 ms
63,808 KB
testcase_53 AC 675 ms
63,840 KB
testcase_54 AC 837 ms
63,020 KB
testcase_55 AC 663 ms
64,500 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,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

int op(int a,int b){
    return a+b;
}
int e(){
    return 0;
}
int tar = 0;
bool f(int x){
    return x<tar;
}

void solve(){
    int n,q; cin>>n>>q;
    vl val(n,-1);
    vl pre(n,-1);
    vl a(n);
    vl t(q),k(q,-1),x(q,-1);
    map<ll,ll> mp;
    rep(i,n){
        cin>>a[i];
        mp[a[i]] = 0;
    }
    rep(i,q){
        cin>>t[i];
        if (t[i]==1){
            cin>>k[i]>>x[i];
            k[i]--;
            mp[x[i]] = 0;
        }else if(t[i]==3){
            cin>>k[i];
            k[i]--;
        }
    }
    int m = 0;
    vl mpr;
    fore(y , mp){
        y.se = m++;
        mpr.pb(y.fi);
    }
    segtree<int ,op,e> cnt(m);
    set<int> now;
    rep(i,n){
        val[i] = a[i];
        pre[i] = a[i];
        now.insert(i);
        cnt.set(mp[a[i]], cnt.get(mp[a[i]])+1);
    }
    
    vl ans;
    rep(i,q){
        if (t[i]==1){
            now.insert(k[i]);
            val[k[i]] = x[i];
        }else if(t[i]==2){
            fore(y, now){
                assert(cnt.get(mp[pre[y]])>0);
                cnt.set(mp[pre[y]], cnt.get(mp[pre[y]])-1);
                cnt.set(mp[val[y]], cnt.get(mp[val[y]])+1);
                pre[y] = val[y];
                val[y] = -1;
            }
            now.clear();
        }else{
            if (now.count(k[i])){
                ans.pb(val[k[i]]);
            }else{
                tar = k[i]+1;
                int r = cnt.max_right<f>(0);
                ans.pb(mpr[r]);
            }
        }
    }
    outv;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0