結果

問題 No.761 平均値ゲーム
ユーザー maimai
提出日時 2018-12-09 00:16:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 10 ms / 2,000 ms
コード長 5,860 bytes
コンパイル時間 2,770 ms
コンパイル使用メモリ 213,700 KB
実行使用メモリ 7,136 KB
最終ジャッジ日時 2023-10-12 19:35:37
合計ジャッジ時間 7,501 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 1 ms
4,352 KB
testcase_04 AC 1 ms
4,348 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 1 ms
4,352 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 2 ms
4,348 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 2 ms
4,352 KB
testcase_11 AC 2 ms
4,348 KB
testcase_12 AC 2 ms
4,348 KB
testcase_13 AC 2 ms
4,352 KB
testcase_14 AC 2 ms
4,352 KB
testcase_15 AC 2 ms
4,348 KB
testcase_16 AC 1 ms
4,348 KB
testcase_17 AC 2 ms
4,348 KB
testcase_18 AC 2 ms
4,352 KB
testcase_19 AC 1 ms
4,348 KB
testcase_20 AC 1 ms
4,352 KB
testcase_21 AC 1 ms
4,352 KB
testcase_22 AC 2 ms
4,348 KB
testcase_23 AC 2 ms
4,348 KB
testcase_24 AC 1 ms
4,348 KB
testcase_25 AC 1 ms
4,348 KB
testcase_26 AC 2 ms
4,352 KB
testcase_27 AC 1 ms
4,352 KB
testcase_28 AC 1 ms
4,348 KB
testcase_29 AC 1 ms
4,348 KB
testcase_30 AC 1 ms
4,352 KB
testcase_31 AC 1 ms
4,348 KB
testcase_32 AC 1 ms
4,348 KB
testcase_33 AC 6 ms
5,012 KB
testcase_34 AC 8 ms
5,080 KB
testcase_35 AC 2 ms
4,348 KB
testcase_36 AC 5 ms
4,352 KB
testcase_37 AC 6 ms
4,740 KB
testcase_38 AC 6 ms
4,808 KB
testcase_39 AC 7 ms
5,284 KB
testcase_40 AC 8 ms
5,248 KB
testcase_41 AC 7 ms
4,960 KB
testcase_42 AC 7 ms
5,132 KB
testcase_43 AC 3 ms
4,348 KB
testcase_44 AC 6 ms
4,360 KB
testcase_45 AC 7 ms
5,264 KB
testcase_46 AC 4 ms
4,352 KB
testcase_47 AC 5 ms
4,356 KB
testcase_48 AC 2 ms
4,348 KB
testcase_49 AC 7 ms
5,232 KB
testcase_50 AC 3 ms
4,352 KB
testcase_51 AC 2 ms
4,352 KB
testcase_52 AC 2 ms
4,348 KB
testcase_53 AC 8 ms
5,116 KB
testcase_54 AC 5 ms
4,388 KB
testcase_55 AC 8 ms
5,120 KB
testcase_56 AC 3 ms
4,356 KB
testcase_57 AC 8 ms
5,336 KB
testcase_58 AC 2 ms
4,348 KB
testcase_59 AC 7 ms
5,012 KB
testcase_60 AC 4 ms
4,352 KB
testcase_61 AC 9 ms
5,380 KB
testcase_62 AC 8 ms
5,128 KB
testcase_63 AC 3 ms
4,352 KB
testcase_64 AC 7 ms
4,956 KB
testcase_65 AC 4 ms
4,352 KB
testcase_66 AC 2 ms
4,348 KB
testcase_67 AC 4 ms
4,352 KB
testcase_68 AC 2 ms
4,348 KB
testcase_69 AC 6 ms
4,988 KB
testcase_70 AC 5 ms
4,348 KB
testcase_71 AC 3 ms
4,348 KB
testcase_72 AC 2 ms
4,348 KB
testcase_73 AC 4 ms
4,348 KB
testcase_74 AC 3 ms
4,348 KB
testcase_75 AC 5 ms
4,352 KB
testcase_76 AC 4 ms
4,352 KB
testcase_77 AC 6 ms
4,800 KB
testcase_78 AC 5 ms
4,408 KB
testcase_79 AC 3 ms
4,352 KB
testcase_80 AC 3 ms
4,352 KB
testcase_81 AC 3 ms
4,352 KB
testcase_82 AC 5 ms
4,364 KB
testcase_83 AC 9 ms
5,484 KB
testcase_84 AC 9 ms
5,340 KB
testcase_85 AC 9 ms
5,296 KB
testcase_86 AC 9 ms
5,300 KB
testcase_87 AC 8 ms
5,412 KB
testcase_88 AC 9 ms
5,408 KB
testcase_89 AC 9 ms
5,360 KB
testcase_90 AC 8 ms
5,508 KB
testcase_91 AC 10 ms
5,300 KB
testcase_92 AC 8 ms
5,296 KB
testcase_93 AC 1 ms
4,348 KB
testcase_94 AC 2 ms
4,352 KB
testcase_95 AC 7 ms
5,212 KB
testcase_96 AC 9 ms
5,500 KB
testcase_97 AC 8 ms
5,508 KB
testcase_98 AC 10 ms
7,136 KB
testcase_99 AC 8 ms
5,792 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:132:20: 警告: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
  132 |         printer << "First\n";
      |                    ^~~~~~~~~
main.cpp:134:20: 警告: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
  134 |         printer << "Second\n";
      |                    ^~~~~~~~~~

ソースコード

diff #

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=decltype(l)();(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) noexcept {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() noexcept { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) noexcept {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) noexcept { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this <<* begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


int N;
ll A[100010];

bool dig(vector<int> sel) {
    if (sel.size() == 0) return false;
    ll m = sel.size();
    ll sum = 0;
    for (auto i : sel) sum += A[i];
    
    vector<int> low;
    vector<int> high;
    
    for (auto i : sel) {
        (sum <= A[i]*m ? high : low).push_back(i);
    }
    
    if (low.empty()) return true;
    if (high.empty()) return true;
    
    if (!dig(move(low))) return true;
    return !dig(move(high));
}

int main(){
    
    scanner >> N;
    scanner.in(A, A+N);
    
    vector<int> sel(N);
    iota(ALL(sel), 0);
    
    bool res = dig(sel);
    
    if (res)
        printer << "First\n";
    else
        printer << "Second\n";
    
    return 0;
}
0