結果

問題 No.130 XOR Minimax
ユーザー kei
提出日時 2018-05-29 23:43:02
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 96 ms / 5,000 ms
コード長 1,930 bytes
コンパイル時間 1,675 ms
コンパイル使用メモリ 171,224 KB
実行使用メモリ 30,572 KB
最終ジャッジ日時 2024-09-12 22:50:53
合計ジャッジ時間 3,766 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out 
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << 
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
 <url:https://yukicoder.me/problems/no/130>
 問題文============================================================
 =================================================================
 解説=============================================================
 
 ================================================================
 */
ll rec(int x,vector<ll>& a){
    ll ret = 0;
    if(x < 0) return ret;
    vector<ll> l,r;
    for(int i = 0; i < a.size(); i++){
        if((a[i]>>x)&1){
            l.push_back(a[i]);
        }else{
            r.push_back(a[i]);
        }
    }
    
    if(l.empty()){
        ret = rec(x-1,r);
    }else if(r.empty()){
        ret = rec(x-1,l);
    }else{
        ret = (1<<x) + min(rec(x-1,l),rec(x-1,r));
    }
    return ret;
}
ll solve(){
    ll res = -1;
    ll N; cin >> N;
    vector<ll> a(N); for(auto& in:a) cin >> in;
    res = rec(32,a);
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0