#989356 (C++23(gcc13)) No.130 XOR Minimax

• 問題: No.130 XOR Minimax
• ユーザー: ir5
• 提出日時: 2024-06-17 21:37:50
• 言語: C++23(gcc13) (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 193 ms / 5,000 ms
• コード長: 2,140 bytes
• コンパイル時間: 1,778 ms
• コンパイル使用メモリ: 137,832 KB
• 実行使用メモリ: 51,072 KB
• 最終ジャッジ日時: 2024-06-17 21:37:56
• 合計ジャッジ時間: 5,438 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	94 ms; 24,064 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	20 ms; 5,376 KB
testcase_05	AC	50 ms; 5,376 KB
testcase_06	AC	53 ms; 9,856 KB
testcase_07	AC	64 ms; 9,856 KB
testcase_08	AC	160 ms; 51,072 KB
testcase_09	AC	12 ms; 5,504 KB
testcase_10	AC	18 ms; 6,144 KB
testcase_11	AC	56 ms; 8,192 KB
testcase_12	AC	8 ms; 5,376 KB
testcase_13	AC	46 ms; 7,808 KB
testcase_14	AC	193 ms; 41,856 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	127 ms; 31,104 KB
testcase_17	AC	137 ms; 32,256 KB
testcase_18	AC	142 ms; 34,176 KB
testcase_19	AC	168 ms; 39,424 KB
testcase_20	AC	80 ms; 21,888 KB
testcase_21	AC	178 ms; 41,472 KB
testcase_22	AC	36 ms; 12,544 KB
testcase_23	AC	12 ms; 6,400 KB

ソースコード

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};


template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

struct T {
  T *zero, *one;
  T() : zero(nullptr), one(nullptr) {};
};

const int N = 31;

ll dp(T* now, int h) {
  if (now == nullptr) return 0;
  if (now->zero && now->one) {
    dump(now << " " << h);
    return (1LL << h) + min(dp(now->zero, h - 1), dp(now->one, h - 1));
  }
  return dp(now->zero, h - 1) | dp(now->one, h - 1);
}

ll solve() {
  int n; cin >> n;
  T* par = new T();
  while (n--) {
    ll x; cin >> x;
    T* now = par;
    for (int i : range(N)) {
      if (x & (1LL << (N - 1 - i))) {
        if (now->one == nullptr) now->one = new T();
        now = now->one;
      } else {
        if (now->zero == nullptr) now->zero = new T();
        now = now->zero;
      }
    }
  }
  ll res = dp(par, N - 1);
  return res;
}

int main() {
  cout << fixed << setprecision(12);
  cout << solve() << endl;
}