結果
問題 | No.761 平均値ゲーム |
ユーザー |
![]() |
提出日時 | 2018-12-20 19:22:57 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 21 ms / 2,000 ms |
コード長 | 2,318 bytes |
コンパイル時間 | 1,381 ms |
コンパイル使用メモリ | 157,672 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-25 09:09:55 |
合計ジャッジ時間 | 5,002 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 100 |
ソースコード
#include <bits/stdc++.h>#define ADD(a, b) a = (a + ll(b)) % mod#define MUL(a, b) a = (a * ll(b)) % mod#define MAX(a, b) a = max(a, b)#define MIN(a, b) a = min(a, b)#define rep(i, a, b) for(int i = int(a); i < int(b); i++)#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)#define all(a) (a).begin(), (a).end()#define sz(v) (int)(v).size()#define pb push_back#define sec second#define fst first#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair<int, int> pi;typedef pair<ll, ll> pl;typedef pair<int, pi> ppi;typedef vector<int> vi;typedef vector<ll> vl;typedef vector<vl> mat;typedef complex<double> comp;void Debug() {cout << '\n'; }template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){cout<<arg<<" ";Debug(rest...);}template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){out<<"("<<v.first<<", "<<v.second<<")";return out;}const int MAX_N = 300010;const int MAX_V = 100010;const double eps = 1e-6;const ll mod = 1000000007;const int inf = 1 << 30;const ll linf = 1LL << 60;const double PI = 3.14159265358979323846;///////////////////////////////////////////////////////////////////////////////////////////////////int N;ll A[MAX_N];ll S[MAX_N];int loop(int l, int r) {int d = r - l;// debug(vi(A + l, A + r), 1.0 * (S[r] - S[l]) / d);int at = lower_bound(A + l, A + r, (S[r] - S[l] + d - 1) / d) - A;int res = 0;if(at == l) res = 1;else res = ((1 - loop(l, at)) | (1 - loop(at, r)));// debug(res);return res;}void solve() {cin >> N;rep(i, 0, N) {cin >> A[i];S[i + 1] = S[i] + A[i];}if(loop(0, N)) cout << "First\n";else cout << "Second\n";}int main() {#ifndef LOCALios::sync_with_stdio(false);cin.tie(0);#endifcout << fixed;cout.precision(20);srand((unsigned int)time(NULL));#ifdef LOCAL//freopen("in.txt", "wt", stdout); //for testerfreopen("in.txt", "rt", stdin);#endifsolve();#ifdef LOCALcerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";#endifreturn 0;}