結果

問題 No.2819 Binary Binary-Operator
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2024-07-26 21:43:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 5,358 bytes
コンパイル時間 2,468 ms
コンパイル使用メモリ 217,356 KB
実行使用メモリ 25,324 KB
平均クエリ数 3.00
最終ジャッジ日時 2024-07-26 21:43:19
合計ジャッジ時間 7,049 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
24,940 KB
testcase_01 AC 21 ms
24,940 KB
testcase_02 AC 21 ms
25,196 KB
testcase_03 AC 21 ms
25,196 KB
testcase_04 AC 22 ms
25,196 KB
testcase_05 AC 22 ms
24,556 KB
testcase_06 AC 19 ms
24,556 KB
testcase_07 AC 20 ms
25,196 KB
testcase_08 AC 21 ms
25,196 KB
testcase_09 AC 24 ms
24,940 KB
testcase_10 AC 23 ms
24,812 KB
testcase_11 AC 24 ms
25,196 KB
testcase_12 AC 24 ms
24,812 KB
testcase_13 AC 24 ms
25,196 KB
testcase_14 AC 23 ms
24,940 KB
testcase_15 AC 21 ms
24,940 KB
testcase_16 AC 23 ms
24,556 KB
testcase_17 AC 24 ms
25,196 KB
testcase_18 AC 20 ms
24,940 KB
testcase_19 AC 21 ms
25,196 KB
testcase_20 AC 21 ms
24,940 KB
testcase_21 AC 20 ms
24,940 KB
testcase_22 AC 22 ms
24,940 KB
testcase_23 AC 21 ms
24,940 KB
testcase_24 AC 21 ms
24,812 KB
testcase_25 AC 21 ms
24,812 KB
testcase_26 AC 22 ms
24,812 KB
testcase_27 AC 22 ms
24,812 KB
testcase_28 AC 21 ms
24,556 KB
testcase_29 AC 21 ms
24,556 KB
testcase_30 AC 22 ms
25,196 KB
testcase_31 AC 21 ms
24,556 KB
testcase_32 AC 22 ms
24,556 KB
testcase_33 AC 23 ms
25,196 KB
testcase_34 AC 22 ms
24,812 KB
testcase_35 AC 24 ms
24,556 KB
testcase_36 AC 23 ms
25,196 KB
testcase_37 AC 24 ms
25,196 KB
testcase_38 AC 23 ms
24,556 KB
testcase_39 AC 23 ms
25,196 KB
testcase_40 AC 23 ms
25,196 KB
testcase_41 AC 24 ms
25,196 KB
testcase_42 AC 24 ms
24,812 KB
testcase_43 AC 24 ms
24,812 KB
testcase_44 AC 24 ms
24,556 KB
testcase_45 AC 24 ms
25,196 KB
testcase_46 AC 24 ms
25,196 KB
testcase_47 AC 21 ms
24,556 KB
testcase_48 AC 21 ms
24,812 KB
testcase_49 AC 23 ms
25,196 KB
testcase_50 AC 22 ms
24,940 KB
testcase_51 AC 21 ms
24,556 KB
testcase_52 AC 21 ms
25,052 KB
testcase_53 AC 21 ms
24,940 KB
testcase_54 AC 21 ms
24,556 KB
testcase_55 AC 22 ms
25,196 KB
testcase_56 AC 23 ms
24,556 KB
testcase_57 AC 22 ms
25,040 KB
testcase_58 AC 21 ms
24,940 KB
testcase_59 AC 21 ms
24,940 KB
testcase_60 AC 21 ms
24,556 KB
testcase_61 AC 22 ms
25,324 KB
testcase_62 AC 21 ms
24,940 KB
testcase_63 AC 21 ms
24,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
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 (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
T ceil_div(T a, T b) {
    return (a + b - 1) / b;
}
template <class T>
T safe_mul(T a, T b) {
    if (a == 0 || b == 0) return 0;
    if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();
    return a * b;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
vector<int> gen_perm(int n) {
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
        cerr << fixed << setprecision(25);
    }
} setup_io;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
// #define mp make_pair

struct dice {
    mt19937 mt;
    dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
    // [0, x)の一様乱数
    ll operator()(ll x) { return this->operator()(0, x); }
    // [x, y)の一様乱数
    ll operator()(ll x, ll y) {
        uniform_int_distribution<ll> dist(x, y - 1);
        return dist(mt);
    }
    vl operator()(int n, ll x, ll y) {
        vl res(n);
        for (int i = 0; i < n; i++)
            res[i] = this->operator()(x, y);
        return res;
    }
} rnd;

std::random_device seed_gen;
std::mt19937 engine(seed_gen());

int check(vi v, vii a) {
    int now = v[0];
    for (int i = 1; i < v.size(); i++) {
        now = a[now][v[i]];
    }
    return now;
}

signed main() {
    int x, y;
    cin >> x >> y;

    while (true) {
        vi v;
        rep(_, 4) {
            v.push_back(rnd(2));
        }

        vii agg(2);
        rep(i, 1 << 4) {
            vii a(2, vi(2));
            int idx = 0;
            rep(j, 2) rep(k, 2) {
                a[j][k] = (i >> idx) & 1;
                idx++;
            }

            int res = check(v, a);
            agg[a[x][y]].push_back(res);
        }

        rep(_, 2) {
            sort(all(agg[_]));
            UNIQUE(agg[_]);
        }

        if (agg[0].size() == 1 && agg[1].size() == 1 && agg[0][0] != agg[1][0]) {
            cout << v.size() << endl;
            for (int i = 0; i < v.size(); i++) {
                cout << v[i] << " ";
            }
            cout << endl;

            int t;
            cin >> t;
            cout << agg[t][0] << endl;
            return 0;
        }
    }
}
0