結果

問題 No.761 平均値ゲーム
ユーザー au7777
提出日時 2024-08-21 01:50:21
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 3,960 bytes
コンパイル時間 5,034 ms
コンパイル使用メモリ 246,512 KB
実行使用メモリ 8,908 KB
最終ジャッジ日時 2024-08-21 01:50:33
合計ジャッジ時間 12,120 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif
#pragma region //使
const int MAX = 2000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll pow_ll(ll x, ll n) {
if (n == 0) return 1;
if (n % 2) {
return pow_ll(x, n - 1) * x;
}
else {
ll tmp = pow_ll(x, n / 2);
return tmp * tmp;
}
}
// floor(a^(1/k))
ll floor_root(ll a, ll k) {
assert(a >= 0);
assert(k >= 1);
if (a == 0) return 0;
if (k == 1) return a;
//
ll x = (ll)pow(a, 1.0 / k);
//
while ((pow_ll(x + 1, k)) <= a) {
x++;
}
//
while ((pow_ll(x, k)) > a) {
x--;
}
return x;
}
ll keta(ll num, ll arity) {
ll ret = 0;
while (num) {
num /= arity;
ret++;
}
return ret;
}
// ki (0)
ll keta_num(ll num, ll i, ll k) {
return (num / pow_ll(k, i)) % k;
}
ll ceil(ll n, ll m) {
// n > 0, m > 0
ll ret = n / m;
if (n % m) ret++;
return ret;
}
void compress(vector<ll>& v) {
// [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0]
vector<ll> u = v;
sort(u.begin(), u.end());
u.erase(unique(u.begin(),u.end()),u.end());
map<ll, ll> mp;
for (int i = 0; i < u.size(); i++) {
mp[u[i]] = i;
}
for (int i = 0; i < v.size(); i++) {
v[i] = mp[v[i]];
}
}
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<ll, ll> > res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0; //
//
while (N % a == 0) {
++ex;
N /= a;
}
// push
res.push_back({a, ex});
}
//
if (N != 1) res.push_back({N, 1});
return res;
}
#pragma endregion
// 1n
vector<bool> is_prime_list(int n) {
vector<bool> is_prime(n + 1, true);
is_prime[0] = false;
is_prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (!is_prime[i]) continue;
for (int j = i * 2; j <= n; j += i) {
is_prime[j] = false;
}
}
return is_prime;
}
//
bool win(vector<ll>& v) {
int n = v.size();
if (n == 0) {
return false;
}
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += v[i];
}
int i;
for (i = 0; i < n; i++) {
if (v[i] * (ll)n >= sum) {
break;
}
}
vector<ll> s;
vector<ll> b;
for (int j = 0; j < i; j++) {
s.push_back(v[j]);
}
for (int j = i; j < n; j++) {
b.push_back(v[j]);
}
if (s.size() == 0 || b.size() == 0) {
return true;
}
bool win1 = win(s);
bool win2 = win(b);
return !win1 || !win2;
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (win(a)) {
cout << "First" << endl;
}
else {
cout << "Second" << endl;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0