#1034033 (C++17(gcc12)) No.2977 Kth Xor Pair

提出ソース

結果

問題	No.2977 Kth Xor Pair
ユーザー	siganai
提出日時	2025-01-02 22:30:07
言語	C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
結果	AC
実行時間	1,449 ms / 3,000 ms
コード長	7,073 bytes
コンパイル時間	1,940 ms
コンパイル使用メモリ	199,540 KB
実行使用メモリ	54,716 KB
最終ジャッジ日時	2025-01-02 22:30:55
合計ジャッジ時間	36,165 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	4 ms 6,816 KB
testcase_03	AC	4 ms 6,820 KB
testcase_04	AC	4 ms 6,816 KB
testcase_05	AC	4 ms 6,816 KB
testcase_06	AC	4 ms 6,816 KB
testcase_07	AC	652 ms 29,044 KB
testcase_08	AC	1,358 ms 53,760 KB
testcase_09	AC	1,158 ms 53,804 KB
testcase_10	AC	1,227 ms 54,492 KB
testcase_11	AC	1,283 ms 54,616 KB
testcase_12	AC	1,299 ms 54,716 KB
testcase_13	AC	1,299 ms 53,268 KB
testcase_14	AC	570 ms 28,596 KB
testcase_15	AC	1,132 ms 54,116 KB
testcase_16	AC	1,394 ms 53,804 KB
testcase_17	AC	1,358 ms 53,432 KB
testcase_18	AC	1,391 ms 53,492 KB
testcase_19	AC	1,420 ms 54,596 KB
testcase_20	AC	1,368 ms 53,728 KB
testcase_21	AC	1,355 ms 53,348 KB
testcase_22	AC	1,449 ms 53,836 KB
testcase_23	AC	1,426 ms 54,024 KB
testcase_24	AC	1,371 ms 53,428 KB
testcase_25	AC	1,380 ms 54,248 KB
testcase_26	AC	1,449 ms 53,912 KB
testcase_27	AC	588 ms 6,820 KB
testcase_28	AC	357 ms 6,820 KB
testcase_29	AC	405 ms 6,816 KB
testcase_30	AC	519 ms 6,816 KB
testcase_31	AC	477 ms 6,816 KB
testcase_32	AC	324 ms 6,820 KB
testcase_33	AC	386 ms 6,820 KB
testcase_34	AC	372 ms 6,820 KB
testcase_35	AC	367 ms 6,816 KB

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

ソースコード

raw source code

#line 1 "main.cpp"
#line 1 "main.cpp"
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
// #pragma GCC target("avx,avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename T>
T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}
template <typename T>
T ceil(T x, T y) {return floor(x + y - 1, y);}
template <typename T>
T bmod(T x, T y) {return x - y * floor(x, y);}
template <typename T>
pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;

#line 2 "library/data-structure/binarytrie.hpp"
// MAX_LOG 2^(MAX_LOG)までの値がOK
template <typename T,int LOG = 30,typename D = int>
struct BinaryTrie {
	struct Node {
		D cnt = 0;
		int ch[2] = {-1, -1};
	};
	vector<Node> ns;
	BinaryTrie() : ns(1) {}
	D size() const { return ns[0].cnt; }
	T operator[](D k) const { return kth_element(k, 0); }
	T kth_element(D k, T xor_add = 0) const {
		assert(0 <= k && k < size());
		int idx = 0;
		T val = 0;
		for(int i = LOG - 1;i >= 0;i--) {
			T c = xor_add >> i & 1;
			int low_ch = ns[idx].ch[c];
			D low_cnt = (low_ch >= 0 ? ns[low_ch].cnt : 0);
			if (k < low_cnt) {
				idx = low_ch;
			} else {
				k -= low_cnt;
				idx = ns[idx].ch[c ^ 1];
				val ^= 1LL << i;
			}
			assert(idx >= 0);
		}
		return val;
  	}
	void add(T val, D cnt = 1) {
		assert(0 <= val && val < (1LL << LOG));
		int idx = 0;
		for(int i = LOG - 1;i >= 0;i--) {
			ns[idx].cnt += cnt;
			assert(ns[idx].cnt >= 0);
			int &nxt = ns[idx].ch[val >> i & 1];
			if (nxt == -1) {
				idx = nxt = ns.size();
				ns.emplace_back();
			} else {
				idx = nxt;
			}
		}
		ns[idx].cnt += cnt;
		assert(ns[idx].cnt >= 0);
		return;
	}
	void erase(T val,D cnt = 1) {
		add(val,-cnt);
	}
	T lower_bound(T val, T xor_add = 0) {
		assert(0 <= val);
		if (val >= (1LL << LOG)) return size();
		int idx = 0;
		D cnt = 0;
		for(int i = LOG - 1;i >= 0;i--) {
			int b = val >> i & 1, c = xor_add >> i & 1;
			int ch = ns[idx].ch[c];
			cnt += (b & (ch >= 0) ? ns[ch].cnt : 0);
			idx = ns[idx].ch[b ^ c];
			if (idx < 0 or ns[idx].cnt == 0) break;
		}
		return cnt;
	}
	D count(T val) const {
		assert(0 <= val && val < (1LL << LOG));
		int idx = 0;
		for(int i = LOG - 1;i >= 0;i--) {
			idx = ns[idx].ch[val >> i & 1];
			if (idx < 0 or ns[idx].cnt == 0) return 0;
		}
		return ns[idx].cnt;
	}
	//[L,R)をcount
	D count(T L, T R, T xor_add = 0) {
		assert(0 <= L && L <= R && R <= (1LL << LOG));
		return lower_bound(R, xor_add) - lower_bound(L, xor_add);
	}
	T min_element(T xor_add = 0) { return kth_element(0, xor_add); }
	T max_element(T xor_add = 0) { return kth_element(size() - 1, xor_add); }
};
#line 101 "main.cpp"
int main() {
    INT(n);
    LL(k);
    VEC(int,a,n);
    BinaryTrie<int,30> BT;
    rep(i,n) BT.add(a[i]);
    ll ng = -1,ok = 1 << 30;
    while(ok - ng > 1) {
        ll mid = (ng + ok) / 2;
        ll cnt = 0;
        rep(i,n) {
            cnt += BT.lower_bound(mid+1,a[i]) - 1;
        }
        if(cnt >= 2 * k) ok = mid;
        else ng = mid;
    }
    cout << ok << '\n';
}

yukicoder

結果

テストケース

ソースコード