結果
問題 | No.2538 2進元ゲーム |
ユーザー | fastmath |
提出日時 | 2023-11-10 23:20:21 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,476 bytes |
コンパイル時間 | 1,817 ms |
コンパイル使用メモリ | 145,636 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-26 02:19:53 |
合計ジャッジ時間 | 4,505 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 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 | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 3 ms
5,376 KB |
testcase_24 | AC | 3 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 3 ms
5,376 KB |
testcase_28 | AC | 4 ms
5,376 KB |
testcase_29 | AC | 14 ms
5,376 KB |
testcase_30 | WA | - |
testcase_31 | AC | 1,208 ms
5,376 KB |
testcase_32 | AC | 129 ms
5,376 KB |
testcase_33 | AC | 135 ms
5,376 KB |
testcase_34 | AC | 86 ms
5,376 KB |
testcase_35 | AC | 82 ms
5,376 KB |
testcase_36 | AC | 60 ms
5,376 KB |
ソースコード
#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <cmath>#include <vector>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <queue>#include <ctime>#include <cassert>#include <complex>#include <string>#include <cstring>#include <chrono>#include <random>#include <bitset>#include <fstream>#include <array>#include <functional>#include <stack>#include <memory>using namespace std;#define int long long#define ii pair <int, int>#define app push_back#define all(a) a.begin(), a.end()#define bp __builtin_popcountll#define ll long long#define mp make_pair#define x first#define y second#define Time (double)clock()/CLOCKS_PER_SEC#define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin())#define sz(a) ((int)a.size())#ifdef LOCAL#define debug(x) do { cout << #x << ": " << x << endl; } while(0)#define debug2(x, y) do { std::cerr << #x << ", " << #y << ": " << x << ", " << y << endl; } while (0)#define debug3(x, y, z) do {std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << endl; } while(0)#else#define debug(x)#define debug2(x, y)#define debug3(x, y, z)#endif#define FORI(i,a,b) for (int i = (a); i < (b); ++i)#define FOR(i,a) FORI(i,0,a)#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)#define ROF(i,a) ROFI(i,0,a)#define rep(a) FOR(_,a)#define each(a,x) for (auto& a: x)#define FORN(i, n) FORI(i, 1, n + 1)using vi = vector<int>;template <typename T>std::istream& operator >>(std::istream& input, std::pair <T, T> & data){input >> data.x >> data.y;return input;}template <typename T>std::istream& operator >>(std::istream& input, std::vector<T>& data){for (T& x : data)input >> x;return input;}template <typename T>std::ostream& operator <<(std::ostream& output, const pair <T, T> & data){output << "(" << data.x << "," << data.y << ")";return output;}template <typename T>std::ostream& operator <<(std::ostream& output, const std::vector<T>& data){for (const T& x : data)output << x << " ";return output;}ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded upll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded downll math_mod(ll a, ll b) { return a - b * div_down(a, b); }#define tcT template<class T#define tcTU tcT, class UtcT> using V = vector<T>;tcT> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;} // set a = min(a,b)tcT> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}tcT> vector <T> presum(vector <T> &a) {vector <T> p(a.size() + 1);FOR (i, a.size()) {p[i + 1] = p[i] + a[i];}return p;}tcT> vector <T> sufsum(vector <T> &a) {vector <T> p(a.size() + 1);for (int i = (int)a.size() - 1; i >= 0; --i) {p[i] = p[i + 1] + a[i];}return p;}ll gcd(ll a, ll b) {while (b) {tie(a, b) = mp(b, a % b);}return a;}int Bit(int mask, int bit) { return (mask >> bit) & 1; }const int L = 60;int code(int x) {if (x >= 0) {return x;}else {int ans = 0;for (int m = 0; m < L; ++m) {int t = 1ll << min(L, max(m + 1, -x));if (Bit(t + x, m)) {ans ^= 1ll << m;}}return ans;}}int getmex(vi a) {a.app(-1); a.app(a.size() + 10);sort(all(a));FOR (i,a.size())if(a[i]+1<a[i+1])return a[i]+1;assert(0);}signed main() {#ifdef LOCAL#else#define endl '\n'ios_base::sync_with_stdio(0); cin.tie(0);#endif/*for (int x = -1; x >= -10; --x) {debug2(x, (bitset<20>)code(x));}*/int n;cin >> n;vi a(n);cin >> a;const int T = 1000;vi nim(T);for (int i = 1; i < T; ++i) {vi go;FOR (j, L) {if (Bit(i, j)) {go.app(nim[j]);}}nim[i] = getmex(go);}int sum = 0;for (auto e : a) {vi go;FOR (j, L) {if (Bit(code(e), j)) {go.app(nim[j]);}}if (e < 0) {for (int j = L; j < T; ++j) {go.app(nim[j]);}}sum ^= getmex(go);}if (sum) {cout << 1 << endl;}else {cout << 2 << endl;}}