#996587 (C++23) No.2814 Block Game

提出ソース

結果

問題	No.2814 Block Game
ユーザー	noya2
提出日時	2024-07-20 17:13:41
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,650 bytes
コンパイル時間	3,721 ms
コンパイル使用メモリ	265,452 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-07-20 17:13:50
合計ジャッジ時間	8,535 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-

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

ソースコード

raw source code

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

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

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void jikken1(){
    int n; in(n);
    vector dp0(n+1,vector(n+1,vector<bool>(n+1,false)));
    vector dp1(n+1,vector(n+1,vector<bool>(n+1,false)));
    dp0[0][0][0] = true;
    for (int i = 1; i <= n; i++){
        for (int a = 0; a <= i; a++) for (int b = 0; b <= i; b++){
            // 1, 1
            if (a > 0 && b > 0){
                // you can't make 1
                if (!dp1[i-1][a-1][b-1]){
                    dp1[i][a][b] = true;
                }
                // you can't make 0
                if (!dp0[i-1][a-1][b-1]){
                    dp0[i][a][b] = true;
                }
            }
            // 1 0
            if (a > 0 && b < i){
                if (!dp0[i-1][a-1][b]){
                    dp1[i][a][b] = true;
                }
                if (!dp1[i-1][a-1][b]){
                    dp0[i][a][b] = true;
                }
            }
            // 0 1
            if (a < i && b > 0){
                if (!dp0[i-1][a][b-1]){
                    dp1[i][a][b] = true;
                }
                if (!dp1[i-1][a][b-1]){
                    dp0[i][a][b] = true;
                }
            }
            // 0 0
            if (a < i && b < i){
                if (!dp0[i-1][a][b]){
                    dp1[i][a][b] = true;
                }
                if (!dp1[i-1][a][b]){
                    dp0[i][a][b] = true;
                }
            }
        }
    }
    vector<vector<int>> ncr(n+1,vector<int>(n+1,1));
    rep(i,n) rep(j,n){
        ncr[i+1][j+1] = (ncr[i][j+1]^ncr[i+1][j]);
    }
    vector<vector<int>> ans(4);
    repp(i,1,n+1){
        int a = 0;
        rep(j,i){
            a += ncr[j][i-j];
        }
        int b = ceil_div(i,2);
        int id = (int)(dp0[i][a][b]) * 2 + (int)(dp1[i][a][b]);
        ans[id].emplace_back(i);
        // out(i,":",dp0[i][a][b],dp1[i][a][b]);
    }
    rep(id,4){
        out(id," > ",ans[id]);
    }
}

void say(bool win){
    out(win ? "Alice" : "Bob");
}

void solve(){
    ull n; in(n);
    string s; in(s);
    if (n == 1){
        say(s[0] == 'O');
    }
    else if (n % 2 == 0 && has_single_bit(n) != 1){
        say(false);
    }
    else if (n == (1ULL << countr_one(n)) - 1){
        say(s[0] == 'E');
    }
    else {
        say(true);
    }
}

int main(){
    int t = 1; in(t);
    while (t--) { solve(); }
}

yukicoder

結果

テストケース

ソースコード