結果
問題 | No.130 XOR Minimax |
ユーザー |
|
提出日時 | 2023-02-15 18:40:36 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,317 bytes |
コンパイル時間 | 3,862 ms |
コンパイル使用メモリ | 232,540 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-18 02:52:15 |
合計ジャッジ時間 | 5,674 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 2 ms
6,812 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 21 ms
6,940 KB |
testcase_05 | AC | 28 ms
6,940 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
コンパイルメッセージ
main.cpp:36:59: warning: overflow in conversion from 'long long int' to 'int' changes value from '-9223372036854775808' to '0' [-Woverflow] 36 | long long pow_(const int a, const int b, const int m = INF) { | ^
ソースコード
#include <bits/stdc++.h> #include "atcoder/all" #define debug cout << "OK" << endl; template<typename T> inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; } template<typename T> inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; } inline int Code(char c) { if ('A' <= c and c <= 'Z')return (int)(c - 'A'); if ('a' <= c and c <= 'z')return (int)(c - 'a'); if ('0' <= c and c <= '9')return (int)(c - '0'); assert(false); } using namespace std; using namespace atcoder; using minit = modint1000000007; constexpr int MOD = 1000000007; constexpr int MOD2 = 998244353; constexpr long long INF = (1LL << 63); template<typename T> ostream& operator << (ostream& st, const vector<T>& v) { for (const T value : v) { st << value << " "; } return st; } template<typename T> istream& operator >> (istream& st, vector<T>& v) { for (T& value : v) { st >> value; } return st; } long long pow_(const int a, const int b, const int m = INF) { long long res = 1; long long base = a; for (int i = 0; i < 64; i++) { if (b & (1ll << i))res *= base; res %= m; base = base * base; base %= m; } return res; } inline int gcd(const int a, const int b) { return (b == 0 ? a : gcd(b, a % b)); } inline int lcm(const int a, const int b) { return a * b / gcd(a, b); } // class nCk { public: const int m; const int MAXIMUM = 1000000; vector<int> fac, facinv, inv; nCk(int m_); ~nCk(); int com(int n, int k)const; }; nCk::nCk(int m_):m(m_) { fac.resize(MAXIMUM + 3); facinv.resize(MAXIMUM + 3); inv.resize(MAXIMUM + 3); fac[0] = fac[1] = 1; facinv[0] = facinv[1] = 1; inv[1] = 1; for (int i = 2; i < MAXIMUM + 2; i++) { fac[i] = fac[i - 1] * i % m; inv[i] = m - inv[m % i] * (m / i) % m; facinv[i] = facinv[i - 1] * inv[i] % m; } } nCk::~nCk(){} int nCk::com(int n, int k)const { if (n < k)return 0; assert(!(n < 0 || k < 0)); return fac[n] * (facinv[k] * facinv[n - k] % m) % m; } template<typename T> vector<long long> press(const vector<T>& arr) { vector<T> X = arr; sort(X.begin(), X.end()); X.erase(unique(X.begin(), X.end()), X.end()); vector<long long> ans(arr.size()); for (int i = 0; i < arr.size(); i++) { ans[i] = lower_bound(X.begin(), X.end(), arr[i]) - X.begin(); } return ans; } // class Solver { public: int T; Solver() :T(1) {} ~Solver(){} void ios()const; void multi(); void solve() const; void sp(int x)const; void ft()const; // // }; void Solver::ios() const { cin.tie(nullptr); ios_base::sync_with_stdio(false); return; } void Solver::multi() { cin >> T; return; } void Solver::sp(const int x)const { cout << fixed << setprecision(x) << endl; return; } void Solver::ft() const { } void Solver::solve() const { int N; cin >> N; vector<int> A(N); cin >> A; int ans = 0; for (int i = 0; i < 34; i++) { vector<bool> f; for (const int a : A) { f.push_back((bool)(a & (1ll << i))); } bool base = f[0]; for (const bool flag : f) { if (flag != base) { ans |= (1ll << i); } } } cout << ans << endl; } signed main() { Solver solver; solver.ios(); //solver.ft(); //solver.multi(); //solver.sp(); for (int i = 0; i < solver.T; i++) solver.solve(); return 0; } /* * わらびのコードこーどすぺーす (σ・∀・)σゲッツ!! */