AtCoder Grand Contest 010

Submission #1356787

Source codeソースコード

// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N;
int A[MAXN];

void input()
{
    read(N);
    for (int i = 1; i <= N; ++i) {
        read(A[i]);
    }
}

void solve()
{
    if (N == 2) {
        puts((A[1] + A[2]) & 1 ? "First" : "Second");
        return;
    }

    for (int side = 0; ; side ^= 1) {
        LL cntodd = 0, sum = 0, cnt1 = 0;
        for (int i = 1; i <= N; ++i) {
            sum += A[i];
            if (A[i] & 1)
                ++cntodd;
            if (A[i] == 1)
                ++cnt1;
        }
        if ((sum - N) & 1) {
            puts(side ? "Second" : "First");
            break;
        }
        if (cnt1 != 0 || cntodd != 1) {
            puts(side ? "First" : "Second");
            break;
        }
        int g = 0;
        for (int i = 1; i <= N; ++i) {
            if (A[i] & 1) --A[i];
            g = std::__gcd(g, A[i]);
        }
        assert(g != 1);
        for (int i = 1; i <= N; ++i) {
            A[i] /= g;
        }
    }
}

int main()
{
#ifdef __DEBUG
    freopen("D.in", "r", stdin);
    freopen("D.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 月出惊山鸟,时鸣春涧中。
//     -- 王维《鸟鸣涧》

Submission

Task問題 D - Decrementing
User nameユーザ名 Ivlleio
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1000
Source lengthソースコード長 3342 Byte
File nameファイル名
Exec time実行時間 34 ms
Memory usageメモリ使用量 640 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample1.txt,sample2.txt,sample3.txt
All 1000 / 1000 sample1.txt,sample2.txt,sample3.txt,in1.txt,in10.txt,in11.txt,in12.txt,in13.txt,in14.txt,in15.txt,in16.txt,in17.txt,in18.txt,in19.txt,in2.txt,in20.txt,in21.txt,in22.txt,in23.txt,in24.txt,in25.txt,in26.txt,in27.txt,in28.txt,in29.txt,in3.txt,in30.txt,in31.txt,in32.txt,in33.txt,in34.txt,in35.txt,in36.txt,in37.txt,in4.txt,in5.txt,in6.txt,in7.txt,in8.txt,in9.txt,sample1.txt,sample2.txt,sample3.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
in1.txt AC 4 ms 640 KB
in10.txt AC 4 ms 640 KB
in11.txt AC 13 ms 640 KB
in12.txt AC 4 ms 640 KB
in13.txt AC 11 ms 640 KB
in14.txt AC 29 ms 640 KB
in15.txt AC 10 ms 640 KB
in16.txt AC 28 ms 640 KB
in17.txt AC 8 ms 640 KB
in18.txt AC 34 ms 640 KB
in19.txt AC 13 ms 640 KB
in2.txt AC 4 ms 640 KB
in20.txt AC 31 ms 640 KB
in21.txt AC 15 ms 640 KB
in22.txt AC 13 ms 640 KB
in23.txt AC 12 ms 640 KB
in24.txt AC 15 ms 640 KB
in25.txt AC 13 ms 640 KB
in26.txt AC 13 ms 640 KB
in27.txt AC 14 ms 640 KB
in28.txt AC 15 ms 640 KB
in29.txt AC 13 ms 640 KB
in3.txt AC 4 ms 640 KB
in30.txt AC 12 ms 640 KB
in31.txt AC 4 ms 640 KB
in32.txt AC 4 ms 640 KB
in33.txt AC 15 ms 640 KB
in34.txt AC 17 ms 640 KB
in35.txt AC 15 ms 640 KB
in36.txt AC 1 ms 256 KB
in37.txt AC 1 ms 256 KB
in4.txt AC 4 ms 640 KB
in5.txt AC 4 ms 640 KB
in6.txt AC 4 ms 640 KB
in7.txt AC 4 ms 640 KB
in8.txt AC 4 ms 640 KB
in9.txt AC 4 ms 640 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB