結果

問題 No.726 Tree Game
ユーザー はまやんはまやんはまやんはまやん
提出日時 2018-08-25 09:34:18
言語 C++14
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,504 Byte
コンパイル時間 1,532 ms
使用メモリ 3,580 KB
最終ジャッジ日時 2022-04-23 10:46:36
合計ジャッジ時間 2,623 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
3,468 KB
testcase_01 AC 1 ms
3,572 KB
testcase_02 AC 2 ms
3,464 KB
testcase_03 AC 1 ms
3,496 KB
testcase_04 AC 2 ms
3,500 KB
testcase_05 AC 1 ms
3,512 KB
testcase_06 AC 1 ms
3,544 KB
testcase_07 AC 1 ms
3,544 KB
testcase_08 AC 1 ms
3,400 KB
testcase_09 AC 1 ms
3,568 KB
testcase_10 AC 1 ms
3,400 KB
testcase_11 AC 1 ms
3,512 KB
testcase_12 AC 1 ms
3,440 KB
testcase_13 AC 1 ms
3,404 KB
testcase_14 AC 1 ms
3,580 KB
testcase_15 AC 1 ms
3,492 KB
testcase_16 AC 1 ms
3,536 KB
testcase_17 AC 1 ms
3,516 KB
testcase_18 AC 1 ms
3,528 KB
testcase_19 AC 2 ms
3,548 KB
testcase_20 AC 2 ms
3,500 KB
testcase_21 AC 1 ms
3,424 KB
testcase_22 AC 1 ms
3,400 KB
testcase_23 AC 1 ms
3,492 KB
testcase_24 AC 1 ms
3,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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; }
//---------------------------------------------------------------------------------------------------
#ifdef _MSC_VER
#pragma push_macro("long")
#undef long
#ifdef _WIN32
inline unsigned int __builtin_ctz(unsigned int x) { unsigned long r; _BitScanForward(&r, x); return r; }
inline unsigned int __builtin_clz(unsigned int x) { unsigned long r; _BitScanReverse(&r, x); return 31 - r; }
inline unsigned int __builtin_ffs(unsigned int x) { unsigned long r; return _BitScanForward(&r, x) ? r + 1 : 0; }
inline unsigned int __builtin_popcount(unsigned int x) { return __popcnt(x); }
inline unsigned int hidword(unsigned long long x) { return static_cast<unsigned int>(x >> 32); }
inline unsigned int lodword(unsigned long long x) { return static_cast<unsigned int>(x & 0xFFFFFFFF); }
inline unsigned long long __builtin_ctzll(unsigned long long x) { return lodword(x) ? __builtin_ctz(lodword(x)) : __builtin_ctz(hidword(x)) + 32; }
inline unsigned long long __builtin_clzll(unsigned long long x) { return hidword(x) ? __builtin_clz(hidword(x)) : __builtin_clz(lodword(x)) + 32; }
inline unsigned long long __builtin_ffsll(unsigned long long x) { return lodword(x) ? __builtin_ffs(lodword(x)) : hidword(x) ? __builtin_ffs(hidword(x)) + 32 : 0; }
inline unsigned long long __builtin_popcountll(unsigned long long x) { return __builtin_popcount(lodword(x)) + __builtin_popcount(hidword(x)); }
#endif // _WIN32
#pragma pop_macro("long")
#endif // _MSC_VER
typedef long long ll;
typedef __int128 int128_t;
//typedef ll int128_t;
int128_t powmod(int128_t x, int128_t y, int128_t p) { // O(log y)
    assert(0 <= x and x < p);
    assert(0 <= y);
    int128_t z = 1;
    for (int128_t i = 1; i <= y; i <<= 1) {
        if (y & i) z = z * x % p;
        x = x * x % p;
    }
    return z;
}
int K = 10;
int getrand(int l, int r) { // [l, r]
    static uint32_t y = time(NULL);
    y ^= (y << 13); y ^= (y >> 17);
    y ^= (y << 5);
    return y % (r - l + 1) + l;
}
ll getrandll(ll l, ll r) { // [l,r]
    ll a = getrand(0, 999999999);
    ll b = getrand(0, 999999999);

    ll x = a * 1000000000LL + b;
    assert(0 <= x);

    return x % (r - l + 1) + l;
}
bool isprime(ll v, int loop = 50) {
    ll d = v - 1;
    int s = 0, i, j;
    if (v <= 1) return false;
    if (v == 2) return true;
    if (v % 2 == 0) return false;
    while (d % 2 == 0) d /= 2, s++;

    rep(i, 0, loop) {
        ll a = getrandll(1, v - 1);
        ll r = powmod(a, d, v);
        if (r == 1 || r == v - 1) continue;
        int j;
        for (j = 0; j < s; j++) {
            r = powmod(r, 2, v);
            if (r == v - 1) break;
        }
        if (j == s) return false;
    }
    return true;
}
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/




ll Y, X;
//---------------------------------------------------------------------------------------------------
#define first "First"
#define second "Second"
string solve() {
    if (isprime(X) and isprime(Y)) return second;
    if (X == 2 or Y == 2) return second;

    ll cnt = 0;
    int rev = 0;
    if (isprime(X)) cnt++, X++;
    else if (isprime(Y)) cnt++, Y++;

    ll x = X, y = Y;
    while (!isprime(x)) x++;
    while (!isprime(y)) y++;

    cnt += (y - Y - 1) + (x - X - 1);
    if (cnt % 2 == 0) return second;
    return first;
}
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> Y >> X;
    cout << solve() << endl;
}
0