結果

問題 No.2977 Kth Xor Pair
ユーザー akiaa11
提出日時 2024-12-14 18:44:23
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,260 ms / 3,000 ms
コード長 4,470 bytes
コンパイル時間 6,291 ms
コンパイル使用メモリ 303,284 KB
最終ジャッジ日時 2025-02-26 14:30:27
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

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);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n;cin>>n;
	ll k;cin>>k;
	veci a(n);
	rep(i, n) cin>>a[i];
	ll bs, sa, sb, sc, sd, cnt;
	vector ls(32, vector<veci>(4));
	auto rec = [&](auto f, int l, int r, int j, int u) -> void{
		if(ls[j + 1][l].empty()) return;
		if(!u && ls[j + 1][r].empty()) return;
		if(j == -1){
			if(u) cnt += ls[0][l].size() * (ll(ls[0][l].size()) - 1) / 2;
			else cnt += 1LL * ls[0][l].size() * ls[0][r].size();
			return;
		}
		for(auto c : ls[j + 1][l]){
			if(c >> j & 1) ls[j][0].push_back(c);
			else ls[j][1].push_back(c);
		}
		for(auto c : ls[j + 1][r]){
			if(c >> j & 1) ls[j][2].push_back(c);
			else ls[j][3].push_back(c);
		}
		sa = ls[j][0].size(), sb = ls[j][1].size(), sc = ls[j][2].size(), sd = ls[j][3].size();
		if(u){
			if(bs >> j & 1){
				cnt += sa * (sa - 1) / 2 + sb * (sb - 1) / 2;
				f(f, 0, 1, j - 1, 0);
			}else{
				f(f, 0, 0, j - 1, 1);
				f(f, 1, 0, j - 1, 1);
			}
		}else{
			if(bs >> j & 1){
				cnt += sa * sc + sb * sd;
				f(f, 0, 3, j - 1, 0);
				f(f, 1, 2, j - 1, 0);
			}else{
				f(f, 0, 2, j - 1, 0);
				f(f, 1, 3, j - 1, 0);
			}
		}
		rep(p, 4) ls[j][p].clear();
	};
	ls[31][0] = a;
	ll l = -1, r = 1LL << 31;
	while(r - l > 1){
		bs = (l + r) / 2;
		cnt = 0;
		rec(rec, 0, 1, 30, 1);
		if(cnt >= k) r = bs;
		else l = bs;
	}
	cout<<r<<endl;
}
0