結果

問題 No.715 集合と二人ゲーム
ユーザー kuhaku
提出日時 2024-08-03 19:36:05
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,936 bytes
コンパイル時間 4,047 ms
コンパイル使用メモリ 277,356 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-08-03 19:36:12
合計ジャッジ時間 6,299 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 35 WA * 25
権限があれば一括ダウンロードができます

ソースコード

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

// competitive-verifier: PROBLEM
#include <algorithm>
#include <iterator>
#include <vector>
/**
* @brief Mex
*
*/
struct minimum_excluded {
minimum_excluded() : n(), _size(), exists(64), v() {}
constexpr int operator()() const noexcept { return n; }
constexpr int get() const noexcept { return n; }
void add(int x) {
if (x < 0) return;
++_size;
if (_size == (int)exists.size()) {
exists.resize(_size << 1);
v.erase(std::remove_if(v.begin(), v.end(),
[&](int y) {
if (y < (int)exists.size()) {
if (exists[y]) --_size;
else exists[y] = true;
return true;
}
return false;
}),
v.end());
}
if (x < (int)exists.size()) {
if (exists[x]) --_size;
else exists[x] = true;
} else {
v.emplace_back(x);
}
while (exists[n]) ++n;
}
private:
int n, _size;
std::vector<bool> exists;
std::vector<int> v;
};
#ifdef ATCODER
#pragma GCC target("sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2")
#endif
#pragma GCC optimize("Ofast,fast-math,unroll-all-loops")
#include <bits/stdc++.h>
#ifndef ATCODER
#pragma GCC target("sse4.2,avx2,bmi2")
#endif
template <class T, class U>
constexpr bool chmax(T &a, const U &b) {
return a < (T)b ? a = (T)b, true : false;
}
template <class T, class U>
constexpr bool chmin(T &a, const U &b) {
return (T)b < a ? a = (T)b, true : false;
}
constexpr std::int64_t INF = 1000000000000000003;
constexpr int Inf = 1000000003;
constexpr double EPS = 1e-7;
constexpr double PI = 3.14159265358979323846;
#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)
#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)
#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)
#define rep(i, n) FOR (i, 0, n)
#define repn(i, n) FOR (i, 1, n + 1)
#define repr(i, n) FORR (i, n, 0)
#define repnr(i, n) FORR (i, n + 1, 1)
#define all(s) (s).begin(), (s).end()
struct Sonic {
Sonic() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(20);
}
constexpr void operator()() const {}
} sonic;
using namespace std;
using ll = std::int64_t;
using ld = long double;
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
return is >> p.first >> p.second;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (T &i : v) is >> i;
return is;
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? "" : " ") << *it;
return os;
}
template <class Head, class... Tail>
void co(Head &&head, Tail &&...tail) {
if constexpr (sizeof...(tail) == 0) std::cout << head << '\n';
else std::cout << head << ' ', co(std::forward<Tail>(tail)...);
}
template <class Head, class... Tail>
void ce(Head &&head, Tail &&...tail) {
if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n';
else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);
}
void Yes(bool is_correct = true) { std::cout << (is_correct ? "Yes\n" : "No\n"); }
void No(bool is_not_correct = true) { Yes(!is_not_correct); }
void YES(bool is_correct = true) { std::cout << (is_correct ? "YES\n" : "NO\n"); }
void NO(bool is_not_correct = true) { YES(!is_not_correct); }
void Takahashi(bool is_correct = true) { std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n'; }
void Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int &e : a) std::cin >> e;
vector<int> dp(1000);
repn (x, 999) {
minimum_excluded mex;
rep (i, x) {
mex.add(dp[i] ^ dp[std::max(0, x - i - 3)]);
}
dp[x] = mex.get();
}
int c = 0;
sort(all(a));
a.erase(unique(a.begin(), a.end()), a.end());
int x = a.front();
int ans = 0;
for (int e : a) {
if (e == x + c) {
++c;
continue;
}
if (c >= 500)
ans ^= dp[340 + (c + 1) % 34];
else
ans ^= dp[c + 1];
c = 0;
x = e;
}
if (c >= 500)
ans ^= dp[360 + (c + 1) % 36];
else
ans ^= dp[c + 1];
if (ans == 0)
co("First");
else
co("Second");
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0