結果
問題 | No.761 平均値ゲーム |
ユーザー | haruki_K |
提出日時 | 2020-11-11 15:12:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,124 bytes |
コンパイル時間 | 2,363 ms |
コンパイル使用メモリ | 207,404 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-22 18:30:50 |
合計ジャッジ時間 | 7,630 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | WA | - |
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 | WA | - |
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 | WA | - |
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 | WA | - |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | WA | - |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 13 ms
5,376 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 9 ms
5,376 KB |
testcase_37 | AC | 12 ms
5,376 KB |
testcase_38 | AC | 11 ms
5,376 KB |
testcase_39 | AC | 15 ms
5,376 KB |
testcase_40 | AC | 14 ms
5,376 KB |
testcase_41 | AC | 13 ms
5,376 KB |
testcase_42 | AC | 15 ms
5,376 KB |
testcase_43 | AC | 5 ms
5,376 KB |
testcase_44 | WA | - |
testcase_45 | AC | 13 ms
5,376 KB |
testcase_46 | AC | 8 ms
5,376 KB |
testcase_47 | AC | 9 ms
5,376 KB |
testcase_48 | AC | 2 ms
5,376 KB |
testcase_49 | AC | 15 ms
5,376 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | AC | 3 ms
5,376 KB |
testcase_53 | WA | - |
testcase_54 | AC | 9 ms
5,376 KB |
testcase_55 | AC | 15 ms
5,376 KB |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | AC | 14 ms
5,376 KB |
testcase_60 | AC | 6 ms
5,376 KB |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | AC | 5 ms
5,376 KB |
testcase_64 | AC | 14 ms
5,376 KB |
testcase_65 | AC | 7 ms
5,376 KB |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | AC | 3 ms
5,376 KB |
testcase_69 | AC | 13 ms
5,376 KB |
testcase_70 | AC | 9 ms
5,376 KB |
testcase_71 | AC | 5 ms
5,376 KB |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | AC | 5 ms
5,376 KB |
testcase_75 | AC | 8 ms
5,376 KB |
testcase_76 | AC | 6 ms
5,376 KB |
testcase_77 | AC | 12 ms
5,376 KB |
testcase_78 | AC | 9 ms
5,376 KB |
testcase_79 | AC | 4 ms
5,376 KB |
testcase_80 | WA | - |
testcase_81 | AC | 3 ms
5,376 KB |
testcase_82 | AC | 10 ms
5,376 KB |
testcase_83 | AC | 17 ms
5,760 KB |
testcase_84 | WA | - |
testcase_85 | AC | 17 ms
5,760 KB |
testcase_86 | WA | - |
testcase_87 | WA | - |
testcase_88 | WA | - |
testcase_89 | AC | 16 ms
5,504 KB |
testcase_90 | AC | 16 ms
5,632 KB |
testcase_91 | WA | - |
testcase_92 | WA | - |
testcase_93 | AC | 2 ms
5,376 KB |
testcase_94 | WA | - |
testcase_95 | AC | 15 ms
5,760 KB |
testcase_96 | WA | - |
testcase_97 | AC | 17 ms
5,760 KB |
testcase_98 | AC | 12 ms
5,632 KB |
testcase_99 | WA | - |
ソースコード
// >>> TEMPLATES #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) begin(x), end(x) #define allR(x) rbegin(x), rend(x) #define rng(x,l,r) begin(x) + (l), begin(x) + (r) #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1; auto constexpr INF32 = inf<int32_t>; auto constexpr INF64 = inf<int64_t>; auto constexpr INF = inf<int>; #ifdef LOCAL #include "debug.hpp" #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } }; template <class T> using pque_max = pque<T, less<T>>; template <class T> using pque_min = pque<T, greater<T>>; template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0> ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0> ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type> istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; } template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; } template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template <class F> struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward<F>(f)) {} template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); } }; struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template <class T, size_t d> struct vec_impl { using type = vector<typename vec_impl<T,d-1>::type>; template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); } }; template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } }; template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type; template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); } template <class T> void quit(T const& x) { cout << x << endl; exit(0); } template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); } template <class T> int sz(T const& x) { return x.size(); } template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); } template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); } const int dx[] = { 1,0,-1,0,1,-1,-1,1 }; const int dy[] = { 0,1,0,-1,1,1,-1,-1 }; constexpr int popcnt(ll x) { return __builtin_popcountll(x); } // [a,b] template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); } i64 irand(i64 a, i64 b) { return rand<i64>(a,b); } u64 urand(u64 a, u64 b) { return rand<u64>(a,b); } // <<< int32_t main() { int n; cin >> n; vector<int> a(n); cin >> a; vector<int> s(n+1); repR (i,n) s[i] = s[i+1] + a[i]; vector<int> dp(n + 1, -1); dp[n] = 0; def (solve, int i) -> int { int &res = dp[i]; if (res >= 0) return res; int lb = partition_point(rng(a, i, n), [&](int x) { return x*(n-i) < s[i]; }) - a.begin(); int ub = partition_point(rng(a, i, n), [&](int x) { return x*(n-i) <= s[i]; }) - a.begin(); return res = (solve(ub) == 0 || solve(lb) == 0); }; cout << (solve(0) ? "First" : "Second") << endl; }