#286098 (C++17) No.130 XOR Minimax

• 問題: No.130 XOR Minimax
• ユーザー: mai
• 提出日時: 2018-09-19 10:57:54
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 133 ms / 5,000 ms
• コード長: 6,751 bytes
• コンパイル時間: 3,173 ms
• コンパイル使用メモリ: 218,376 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-12 22:51:24
• 合計ジャッジ時間: 5,236 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	59 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	8 ms; 6,940 KB
testcase_05	AC	11 ms; 6,940 KB
testcase_06	AC	127 ms; 6,944 KB
testcase_07	AC	127 ms; 6,940 KB
testcase_08	AC	133 ms; 6,944 KB
testcase_09	AC	20 ms; 6,940 KB
testcase_10	AC	30 ms; 6,940 KB
testcase_11	AC	108 ms; 6,944 KB
testcase_12	AC	10 ms; 6,940 KB
testcase_13	AC	86 ms; 6,940 KB
testcase_14	AC	124 ms; 6,940 KB
testcase_15	AC	2 ms; 6,944 KB
testcase_16	AC	84 ms; 6,940 KB
testcase_17	AC	88 ms; 6,944 KB
testcase_18	AC	95 ms; 6,940 KB
testcase_19	AC	115 ms; 6,940 KB
testcase_20	AC	53 ms; 6,944 KB
testcase_21	AC	123 ms; 6,944 KB
testcase_22	AC	24 ms; 6,940 KB
testcase_23	AC	8 ms; 6,944 KB

ソースコード

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_reference<remove_const<decltype(l)>::type>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os;
}
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) noexcept {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() noexcept { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) noexcept {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) noexcept { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


int N;

/*
頭のbitを調べる
01が混ざる時，
 1をxorしたと仮定
  頭が0のやつだけ見る
 0をxorしたと仮定
  頭が1のやつだけ見る
 結果をminimize

*/

int dfs(int i, const vector<int>& A, const vector<int>& bit) {
    if (i < 0) return 0;
    if (bit[i] == 1 || bit[i] == 0) {
        // この桁は0だけ
        return dfs(i - 1, A, bit);
    }
    else if (bit[i] == 2) {
        // この桁は1だけ
        return dfs(i - 1, A, bit);
    }
    else {
        // 混合
        vector<int> new_A0; new_A0.reserve(A.size());
        vector<int> new_A1; new_A1.reserve(A.size());
        vector<int> new_bit0(32);
        vector<int> new_bit1(32);

        for (auto a : A) {
            if (a & (1 << i))
                new_A1.push_back(a);
            else
                new_A0.push_back(a | (1 << i));
            repeat(j, 31) {
                ((a & (1 << i)) ? new_bit1[j] : new_bit0[j]) |= 1 << ((a & (1 << j)) >> j);
            }
        }
        return min(dfs(i - 1, new_A1, new_bit1), dfs(i - 1, new_A0, new_bit0)) | (1 << i);
    }
}

int main() {
    scanner >> N;
    vector<int> A(N);
    scanner.in(ALL(A));

    vector<int> bit(32);
    for (int a : A) 
        repeat(j, 31)
            bit[j] |= 1 << ((a & (1 << j)) >> j);

    
    int ans = dfs(30, A, bit);
    cout << ans << endl;

    // {
    //     pair<int, int> best(2e9, 0);
    //     repeat(x, 31) {
    //         int z = 0;
    //         repeat(i, N) {
    //             maxset(z, A[i] ^ x);
    //         }
    //         minset(best, make_pair(z, x));
    //     }
    //     cout << best << endl;
    // }

    return 0;
}