#504862 (C++14) No.761 平均値ゲーム

提出ソース

結果

問題	No.761 平均値ゲーム
ユーザー	Gosu_Hiroo
提出日時	2020-06-30 01:47:23
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,010 ms / 2,000 ms
コード長	8,169 bytes
コンパイル時間	1,855 ms
コンパイル使用メモリ	171,324 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-07-19 06:12:20
合計ジャッジ時間	37,904 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	1 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	1 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	1 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	1 ms 5,376 KB
testcase_15	AC	1 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	1 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	1 ms 5,376 KB
testcase_24	AC	1 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	1 ms 5,376 KB
testcase_29	AC	2 ms 5,376 KB
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	745 ms 5,376 KB
testcase_34	AC	768 ms 5,376 KB
testcase_35	AC	69 ms 5,376 KB
testcase_36	AC	450 ms 5,376 KB
testcase_37	AC	651 ms 5,376 KB
testcase_38	AC	667 ms 5,376 KB
testcase_39	AC	811 ms 5,376 KB
testcase_40	AC	843 ms 5,376 KB
testcase_41	AC	795 ms 5,376 KB
testcase_42	AC	848 ms 5,376 KB
testcase_43	AC	155 ms 5,376 KB
testcase_44	AC	517 ms 5,376 KB
testcase_45	AC	742 ms 5,376 KB
testcase_46	AC	388 ms 5,376 KB
testcase_47	AC	408 ms 5,376 KB
testcase_48	AC	43 ms 5,376 KB
testcase_49	AC	826 ms 5,376 KB
testcase_50	AC	102 ms 5,376 KB
testcase_51	AC	62 ms 5,376 KB
testcase_52	AC	70 ms 5,376 KB
testcase_53	AC	799 ms 5,376 KB
testcase_54	AC	468 ms 5,376 KB
testcase_55	AC	844 ms 5,376 KB
testcase_56	AC	252 ms 5,376 KB
testcase_57	AC	872 ms 5,376 KB
testcase_58	AC	134 ms 5,376 KB
testcase_59	AC	751 ms 5,376 KB
testcase_60	AC	239 ms 5,376 KB
testcase_61	AC	875 ms 5,376 KB
testcase_62	AC	827 ms 5,376 KB
testcase_63	AC	162 ms 5,376 KB
testcase_64	AC	742 ms 5,376 KB
testcase_65	AC	301 ms 5,376 KB
testcase_66	AC	62 ms 5,376 KB
testcase_67	AC	236 ms 5,376 KB
testcase_68	AC	92 ms 5,376 KB
testcase_69	AC	627 ms 5,376 KB
testcase_70	AC	454 ms 5,376 KB
testcase_71	AC	190 ms 5,376 KB
testcase_72	AC	88 ms 5,376 KB
testcase_73	AC	280 ms 5,376 KB
testcase_74	AC	174 ms 5,376 KB
testcase_75	AC	377 ms 5,376 KB
testcase_76	AC	234 ms 5,376 KB
testcase_77	AC	642 ms 5,376 KB
testcase_78	AC	436 ms 5,376 KB
testcase_79	AC	154 ms 5,376 KB
testcase_80	AC	117 ms 5,376 KB
testcase_81	AC	100 ms 5,376 KB
testcase_82	AC	546 ms 5,376 KB
testcase_83	AC	982 ms 5,376 KB
testcase_84	AC	914 ms 5,376 KB
testcase_85	AC	929 ms 5,376 KB
testcase_86	AC	942 ms 5,376 KB
testcase_87	AC	917 ms 5,376 KB
testcase_88	AC	891 ms 5,376 KB
testcase_89	AC	925 ms 5,376 KB
testcase_90	AC	893 ms 5,376 KB
testcase_91	AC	938 ms 5,376 KB
testcase_92	AC	1,010 ms 5,376 KB
testcase_93	AC	2 ms 5,376 KB
testcase_94	AC	2 ms 5,376 KB
testcase_95	AC	13 ms 5,376 KB
testcase_96	AC	34 ms 5,376 KB
testcase_97	AC	14 ms 5,376 KB
testcase_98	AC	446 ms 5,376 KB
testcase_99	AC	484 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

#define VI vector<int>
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ ({int t;cin >> t;t;})
#define PII pair<int, int>

#define FOR(i, _begin, _end) for (__typeof(_end) end = _end, begin = _begin,  i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(),(x).end()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
# define BYE(a) do { cout << (a) << endl; return ; } while (false)

#ifdef DEBUG
#define ERR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(cerr,_it, args); }
#define DBG(x) cerr << #x << " is " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream& cerr,istream_iterator<string> it) {cerr << endl;}
template<typename T, typename... Args>
void _err(std::ostream& cerr, istream_iterator<string> it, T a, Args... args) {
    cerr << *it << " = " << a << "  ";
    _err(cerr,++it, args...);
}

const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll) (1e9) + 7;

template<class T>bool Chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool Chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

template <typename T>
istream& operator >> (istream& is, vector<T>& V) {
    for(auto&& ele : V)is >> ele;
    return is;
}

template <typename T>
ostream& operator << (ostream& os, const vector<T> V) {
    os << "[";
    int cnt = 0;
    T curr;
    if(!V.empty()){
        for (int i = 0; i < V.size() - 1; ++i) {
            if(V[i] == curr)cnt ++;
            else cnt = 0;
            if(cnt == 4)os << "... ";
            if(cnt < 4)
                os << i << ":" << V[i] << " ";
            curr = V[i];
        }
        os << V.size() - 1 << ":" << V.back();
    }
    os << "]\n";
    return os;
}

template <typename T, typename U>
ostream& operator << (ostream& os, const pair<T,U> P) {
    os << "(";
    os << P.first << "," << P.second;
    os << ")";
    return os;
}

template <typename T, typename U>
ostream& operator << (ostream& os, const set<T,U> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << *it << " ";
            it++;
        }
        os << *it;
    }
    os << "}\n";
    return os;
}

template <typename K, typename H, typename P>
ostream& operator << (ostream& os, const unordered_set<K, H, P> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << *it << " ";
            it++;
        }
        os << *it;
    }
    os << "}\n";
    return os;
}

template <typename K, typename C>
ostream& operator << (ostream& os, const multiset<K, C> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << *it << " ";
            it++;
        }
        os << *it;
    }
    os << "}";
    return os;
}

template <typename K, typename T, typename C>
ostream& operator << (ostream& os, const map<K,T,C> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << "(";
            os << it->first << "," << it->second;
            os << ") ";
            it++;
        }
        os << "(";
        os << it->first << "," << it->second;
        os << ")";
    }
    os << "}\n";
    return os;
}

template <typename K, typename T, typename C>
ostream& operator << (ostream& os, const unordered_map<K,T,C> V) {
    os << "{";
    if(!V.empty()){
        auto it = V.begin();
        for (int i = 0; i < V.size() -1; ++i) {
            os << "(";
            os << it->first << "," << it->second;
            os << ") ";
            it++;
        }
        os << "(";
        os << it->first << "," << it->second;
        os << ")";
    }
    os << "}\n";
    return os;
}

template <typename T>
ostream& operator << (ostream& os, const deque<T> V) {
    os << "[";
    if (!V.empty()) {
        for (int i = 0; i < V.size() - 1; ++i) {
            os << V[i] << "->";
        }
        if (!V.empty())os << V.back();
    }
    os << "]\n";
    return os;
};

template <typename T, typename Cont, typename Comp>
ostream& operator << (ostream& os, const priority_queue<T, Cont, Comp> V) {
    priority_queue<T, Cont, Comp> _V = V;
    os << "[";
    if(!_V.empty()){
        while(_V.size() > 1){
            os << _V.top() << "->";
            _V.pop();
        }
        os << _V.top();
    }
    os << "]\n";
    return os;
};

template <class F>
struct y_combinator {
    F f; // the lambda will be stored here

    // a forwarding operator():
    template <class... Args>
    decltype(auto) operator()(Args&&... args) const {
        // we pass ourselves to f, then the arguments.
        // the lambda should take the first argument as `auto&& recurse` or similar.
        return f(*this, std::forward<Args>(args)...);
    }
};
// helper function that deduces the type of the lambda:
template <class F>
y_combinator<std::decay_t<F>> recursive(F&& f){
return {std::forward<F>(f)};
}

struct hash_pair {
    template <class T1, class T2>
    size_t operator()(const pair<T1, T2>& p) const
    {
        auto hash1 = hash<T1>{}(p.first);
        auto hash2 = hash<T2>{}(p.second);
        return hash1 ^ hash2;
    }

};

template <typename T, typename U>
std::vector<T> multi_vector(int n, U v) {
    return std::vector<T>(n, v);
}

template <typename U, typename... Args>
auto multi_vector(int n, Args... args) {
    auto val = multi_vector<U>(std::forward<Args>(args)...);
    return std::vector<decltype(val)>(n, std::move(val));
}
class Task {
public:
    ll power_mod(ll x, ll y, ll p) {
        if (y < 0)return 0;
        ll res = 1;

        x = x % p;

        while (y) {
            if (y & 1)
                res = (res * x) % p;
            y = y >> 1;
            x = (x * x) % p;
        }
        return res;
    }
void solve(std::istream& cin, std::ostream& cout, std::ostream& cerr) {
        int N;cin >> N;
        vector<ll> a(N), s_a(N+1);cin >> a;
        REP(i,N)s_a[i+1] = s_a[i] + a[i];
        auto mex = [&](int a, int b){
            if(a > b)swap(a,b);
            if(a)return 0;
            if(b - a > 1)return a+1;
            return b+1;
        };
        auto dp = recursive([&](auto &&dp, int l, int r)->int{
            std::cerr << l << " " << r << endl;
            if(r - l == 1)return 1;
            if(r == l)return 0;
            ll sum = s_a[r] - s_a[l];
            if(sum % (r - l) == 0){
                int m = lower_bound(a.begin() + l, a.begin() + r, sum/(r-l)) - a.begin();
                if(l == m || r == m)return 1;
                return mex(dp(l,m), dp(m,r));
            }
            else{
                int m = lower_bound(a.begin() + l, a.begin() + r, (sum + r - l - 1)/(r-l)) - a.begin();
                if(l == m || r == m)return 1;
                return mex(dp(l,m), dp(m,r));
            }
        });
        print(dp(0, N)?"First":"Second");

}



};


#undef int
int main() {

	Task solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
    std::ostringstream err;
	in.tie(0); ios::sync_with_stdio(0);
    solver.solve(in, out,err);
	return 0;
}

yukicoder

結果

テストケース

ソースコード