結果
問題 | No.130 XOR Minimax |
ユーザー |
![]() |
提出日時 | 2020-09-18 17:38:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 171 ms / 5,000 ms |
コード長 | 1,978 bytes |
コンパイル時間 | 2,376 ms |
コンパイル使用メモリ | 197,800 KB |
最終ジャッジ日時 | 2025-01-14 16:09:23 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
//#include <tourist>#include <bits/stdc++.h>//#include <atcoder/all>using namespace std;//using namespace atcoder;typedef long long ll;typedef unsigned int uint;typedef unsigned long long ull;typedef pair<ll, ll> p;const ll INF = 1e9 + 1;const ll LINF = ll(1e18);const int MOD = 1000000007;const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};#define yes cout << "Yes" << endl#define YES cout << "YES" << endl#define no cout << "No" << endl#define NO cout << "NO" << endl#define rep(i, n) for (int i = 0; i < n; i++)#define FOR(i, m, n) for (int i = m; i < n; i++)#define ALL(v) v.begin(), v.end()#define debug(v) \cout << #v << ":"; \for (auto x : v) \{ \cout << x << ' '; \} \cout << endl;template <class T>bool chmax(T &a, const T &b){if (a < b){a = b;return 1;}return 0;}template <class T>bool chmin(T &a, const T &b){if (b < a){a = b;return 1;}return 0;}//cout<<fixed<<setprecision(15);有効数字15桁//-std=c++14//g++ yarudake.cpp -std=c++17 -I .ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }ll dfs(ll cur, vector<ll> a){ll res = 0;if (cur < 0)return 0;vector<ll> c, b;rep(i, a.size()){if ((a[i]) & (1<<cur))b.push_back(a[i]);elsec.push_back(a[i]);}if (c.size() == 0 || b.size() == 0)return dfs(cur - 1, a);else{res += min(dfs(cur - 1, b), dfs(cur - 1, c));res += (1 << cur);}//cout<<res<<" "<<cur<<"\n";return res;}int main(){cin.tie(0);ios::sync_with_stdio(false);ll n, m;cin >> n;vector<ll> a(n);rep(i, n) cin >> a[i];cout << dfs(31, a) << "\n";}