結果
問題 | No.130 XOR Minimax |
ユーザー | is_eri23 |
提出日時 | 2015-01-18 03:37:42 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 80 ms / 5,000 ms |
コード長 | 2,669 bytes |
コンパイル時間 | 1,343 ms |
コンパイル使用メモリ | 151,468 KB |
実行使用メモリ | 14,488 KB |
最終ジャッジ日時 | 2023-10-10 00:06:48 |
合計ジャッジ時間 | 3,425 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
5,772 KB |
testcase_01 | AC | 2 ms
4,352 KB |
testcase_02 | AC | 2 ms
4,352 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 7 ms
4,352 KB |
testcase_05 | AC | 13 ms
4,352 KB |
testcase_06 | AC | 64 ms
14,476 KB |
testcase_07 | AC | 66 ms
14,488 KB |
testcase_08 | AC | 58 ms
9,356 KB |
testcase_09 | AC | 11 ms
4,708 KB |
testcase_10 | AC | 17 ms
5,512 KB |
testcase_11 | AC | 59 ms
9,604 KB |
testcase_12 | AC | 6 ms
4,356 KB |
testcase_13 | AC | 47 ms
8,676 KB |
testcase_14 | AC | 70 ms
8,252 KB |
testcase_15 | AC | 2 ms
4,348 KB |
testcase_16 | AC | 48 ms
6,596 KB |
testcase_17 | AC | 49 ms
7,036 KB |
testcase_18 | AC | 56 ms
7,292 KB |
testcase_19 | AC | 75 ms
8,124 KB |
testcase_20 | AC | 31 ms
5,668 KB |
testcase_21 | AC | 80 ms
8,232 KB |
testcase_22 | AC | 13 ms
4,400 KB |
testcase_23 | AC | 4 ms
4,348 KB |
ソースコード
#include <bits/stdc++.h> #define EPS 1e-9 #define INF 1070000000LL #define MOD 1000000007LL #define fir first #define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++) #define numa(x,a) for(auto x: a) #define ite iterator #define mp make_pair #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<(n);i++) #define pb push_back #define pf push_front #define sec second #define sz(x) ((int)(x).size()) #define ALL( c ) (c).begin(), (c).end() #define gcd(a,b) __gcd(a,b) #define mem(x,n) memset(x,n,sizeof(x)) #define endl "\n" using namespace std; template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){} template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); } template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; } template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; } #define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; } #define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); } #define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); } #define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); } using ll = long long; int N; int go(int b, vector <int> &nums) { if (sz(nums) <= 1) { return 0; } vector <int> next_nums; vector <int> next_nums2; numa(x,nums){ if (x & (1<<b)) { next_nums.pb(x); }else{ next_nums2.pb(x); } } if (sz(next_nums) == 0) { return go(b-1,next_nums2); }else if (sz(next_nums2) == 0) { return go(b-1,next_nums); } return (1<<b)+min(go(b-1,next_nums2), go(b-1,next_nums)); } int main() { cin.tie(0); ios_base::sync_with_stdio(0); set <int> nums_set; cin >> N; rep(i,N){ int x; cin >> x; nums_set.insert(x); } vector <int> nums(ALL(nums_set)); cout << go(30,nums) << endl; return 0; }