結果

問題 No.2809 Sort Query
ユーザー akiaa11akiaa11
提出日時 2024-07-20 18:18:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 5,821 bytes
コンパイル時間 4,253 ms
コンパイル使用メモリ 281,228 KB
実行使用メモリ 706,068 KB
最終ジャッジ日時 2024-07-20 18:20:43
合計ジャッジ時間 109,633 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 TLE -
testcase_02 MLE -
testcase_03 MLE -
testcase_04 TLE -
testcase_05 MLE -
testcase_06 AC 860 ms
190,896 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 944 ms
190,984 KB
testcase_10 AC 852 ms
191,136 KB
testcase_11 AC 803 ms
50,432 KB
testcase_12 AC 940 ms
50,432 KB
testcase_13 AC 815 ms
50,560 KB
testcase_14 AC 916 ms
50,432 KB
testcase_15 AC 886 ms
50,560 KB
testcase_16 AC 851 ms
50,536 KB
testcase_17 AC 878 ms
50,560 KB
testcase_18 AC 867 ms
50,432 KB
testcase_19 AC 849 ms
50,432 KB
testcase_20 AC 915 ms
50,556 KB
testcase_21 TLE -
testcase_22 TLE -
testcase_23 TLE -
testcase_24 MLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 TLE -
testcase_29 TLE -
testcase_30 TLE -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 AC 902 ms
50,560 KB
testcase_37 AC 841 ms
50,304 KB
testcase_38 AC 797 ms
50,560 KB
testcase_39 AC 863 ms
50,560 KB
testcase_40 AC 837 ms
50,560 KB
testcase_41 AC 1,844 ms
333,456 KB
testcase_42 AC 1,901 ms
333,588 KB
testcase_43 AC 1,937 ms
333,456 KB
testcase_44 AC 1,820 ms
333,456 KB
testcase_45 TLE -
testcase_46 AC 1,846 ms
333,328 KB
testcase_47 AC 1,677 ms
333,456 KB
testcase_48 AC 1,743 ms
333,324 KB
testcase_49 AC 1,686 ms
333,456 KB
testcase_50 AC 1,692 ms
333,456 KB
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 AC 1,313 ms
333,344 KB
testcase_62 AC 1,074 ms
343,416 KB
testcase_63 WA -
testcase_64 WA -
testcase_65 AC 1,074 ms
332,568 KB
testcase_66 WA -
testcase_67 WA -
testcase_68 AC 3 ms
5,376 KB
testcase_69 WA -
testcase_70 AC 3 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<int(n);++i)
#define rep2(i,a,n) for(int i=int(a);i<int(n);++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

template<int char_size>
struct Trie{
	struct Node{
		Node() : size(0), end_word(0){memset(nx, -1, sizeof(nx));}
		int nx[char_size + 1];
		int size;
		int end_word;
	};
	std::vector<Node> nodes;
	int root;
	char base;

	Trie(char base2 = 'a') : base(base2), root(0){
		nodes.push_back(Node());
	}
	void insert(const std::string& s){
		int now = root;
		for(int i = 0 ; i < s.size() ; ++i){
			assert(base <= s[i] && s[i] - base < char_size);
			int c = s[i] - base;
			if(nodes[now].nx[c] == -1){
				nodes[now].nx[c] = (int)nodes.size();
				nodes.push_back(Node());
			}
			++nodes[now].size;
			now = nodes[now].nx[c];
		}
		++nodes[now].size;
		++nodes[now].end_word;
	}

	bool search(const std::string& s){
		int now = root;
		for(int i = 0 ; i < s.size() ; ++i){
			assert(base <= s[i] && s[i] - base < char_size);
			int c = s[i] - base;
			int nx = nodes[now].nx[c];
			if(nx == -1 || nodes[now].size == 0) return false;
			now = nx;
		}
		if(nodes[now].end_word == 0) return false;
		return true;
	}

	void erase(const std::string& s){
		if(!search(s)) return;
		int now = root;
		for(int i = 0 ; i < s.size() ; ++i){
			assert(base <= s[i] && s[i] - base < char_size);
			int c = s[i] - base;
			int nx = nodes[now].nx[c];
			--nodes[now].size;
			now = nx;
		}
		--nodes[now].size;
		--nodes[now].end_word;
	}

	string get(int k){
		int cur = root;
		string s;
		for(int i = 0; i < 61; ++i){
			if(nodes[cur].nx[0] != -1){
				if(nodes[nodes[cur].nx[0]].size >= k){
					cur = nodes[cur].nx[0];
					s.push_back(0 + base);
				}else{
					k -= nodes[nodes[cur].nx[0]].size;
					cur = nodes[cur].nx[1];
					s.push_back(1 + base);
				}
			}else{
				cur = nodes[cur].nx[1];
				s.push_back(1 + base);
			}
		}
		return s;
	}
};

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, q;cin>>n>>q;
	vecll a(n);
	rep(i, n) cin>>a[i];
	Trie<2> t('0');
	auto f = [&](ll c){
		string s;
		while(c > 0){
			s.push_back((c & 1) + '0');
			c >>= 1;
		}
		while(s.size() < 61) s.push_back('0');
		reverse(all(s));
		return s;
	};
	rep(i, n){
		auto s = f(a[i]);
		t.insert(s);
	}
	vecll ans;
	set<int> st;
	vecs b(n);
	rep(i, q){
		int ty;cin>>ty;
		if(ty == 1){
			int k;
			ll x;cin>>k>>x;
			st.insert(k);
			b[k - 1] = f(x);
		}else if(ty == 2){
			for(auto it = st.rbegin(); it != st.rend(); ++it){
				auto s = t.get(*it);
				t.erase(s);
			}
			for(auto v : st) t.insert(b[v - 1]);
			st.clear();
		}else{
			int k;cin>>k;
			k--;
			if(st.find(k) != st.end()) cout<<b[k]<<endl;
			else{
				auto s = t.get(k + 1);
				ll r = 0;
				rep(i, s.size()) if(s[i] - '0') r += 1LL << (s.size() - i - 1);
				ans.push_back(r);
			}
		}
	}
	for(auto v : ans) cout<<v<<endl;
}
0