#996612 (C++17) No.2809 Sort Query

提出ソース

結果

問題	No.2809 Sort Query
ユーザー	akiaa11
提出日時	2024-07-20 18:10:34
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	5,872 bytes
コンパイル時間	5,263 ms
コンパイル使用メモリ	282,580 KB
実行使用メモリ	784,960 KB
最終ジャッジ日時	2024-07-20 18:12:44
合計ジャッジ時間	48,149 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	TLE	-
testcase_02	TLE	-
testcase_03	MLE	-
testcase_04	MLE	-
testcase_05	MLE	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	AC	1,080 ms 120,272 KB
testcase_12	AC	1,142 ms 120,688 KB
testcase_13	WA	-
testcase_14	AC	1,082 ms 118,092 KB
testcase_15	AC	1,096 ms 118,708 KB
testcase_16	AC	1,101 ms 119,560 KB
testcase_17	AC	1,093 ms 119,428 KB
testcase_18	AC	1,122 ms 118,032 KB
testcase_19	AC	1,102 ms 120,564 KB
testcase_20	AC	1,155 ms 119,444 KB
testcase_21	MLE	-
testcase_22	TLE	-
testcase_23	TLE	-
testcase_24	TLE	-
testcase_25	TLE	-
testcase_26	TLE	-
testcase_27	TLE	-
testcase_28	TLE	-
testcase_29	TLE	-
testcase_30	TLE	-
testcase_31	AC	1,082 ms 65,860 KB
testcase_32	AC	1,043 ms 65,064 KB
testcase_33	AC	1,096 ms 65,772 KB
testcase_34	AC	984 ms 64,540 KB
testcase_35	AC	1,040 ms 65,160 KB
testcase_36	AC	1,206 ms 119,444 KB
testcase_37	AC	1,096 ms 120,696 KB
testcase_38	AC	1,088 ms 120,328 KB
testcase_39	AC	1,295 ms 119,216 KB
testcase_40	AC	1,270 ms 118,660 KB
testcase_41	AC	1,953 ms 333,320 KB
testcase_42	AC	1,965 ms 334,356 KB
testcase_43	TLE	-
testcase_44	TLE	-
testcase_45	AC	1,908 ms 333,440 KB
testcase_46	AC	1,753 ms 333,440 KB
testcase_47	AC	1,797 ms 333,412 KB
testcase_48	AC	1,770 ms 333,556 KB
testcase_49	AC	1,819 ms 333,500 KB
testcase_50	AC	1,796 ms 333,568 KB
testcase_51	TLE	-
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	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	3 ms 6,948 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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 l){
		int cur = root;
		string s;
		for(int i = 0; i < l; ++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, c;
	rep(i, q){
		int ty;cin>>ty;
		if(ty == 1){
			int k;
			ll x;cin>>k>>x;
			k--;
			st.insert(k);
			b.push_back(f(a[k]));
			c.push_back(f(x));
			a[k] = x;
		}else if(ty == 2){
			while(c.size()){
				t.insert(c.back());
				c.pop_back();
			}
			while(b.size()){
				t.erase(b.back());
				b.pop_back();
			}
			st.clear();
		}else{
			int k;cin>>k;
			k--;
			if(st.find(k) != st.end()) cout<<a[k]<<endl;
			else{
				auto s = t.get(k + 1, 61);
				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;
}

yukicoder

結果

テストケース

ソースコード