結果

問題 No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー ミドリムシミドリムシ
提出日時 2020-12-02 01:24:07
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,873 bytes
コンパイル時間 2,118 ms
コンパイル使用メモリ 182,580 KB
実行使用メモリ 20,096 KB
最終ジャッジ日時 2024-06-12 13:39:32
合計ジャッジ時間 61,004 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 792 ms
19,968 KB
testcase_01 WA -
testcase_02 AC 968 ms
19,840 KB
testcase_03 WA -
testcase_04 AC 1,047 ms
19,968 KB
testcase_05 AC 1,022 ms
19,968 KB
testcase_06 WA -
testcase_07 AC 1,000 ms
19,968 KB
testcase_08 WA -
testcase_09 AC 1,062 ms
19,968 KB
testcase_10 AC 897 ms
19,968 KB
testcase_11 AC 990 ms
19,968 KB
testcase_12 AC 1,039 ms
19,968 KB
testcase_13 AC 927 ms
19,968 KB
testcase_14 AC 1,051 ms
19,968 KB
testcase_15 AC 902 ms
19,968 KB
testcase_16 AC 1,074 ms
19,968 KB
testcase_17 WA -
testcase_18 AC 1,068 ms
19,968 KB
testcase_19 AC 985 ms
19,968 KB
testcase_20 AC 912 ms
19,968 KB
testcase_21 WA -
testcase_22 AC 1,086 ms
19,968 KB
testcase_23 AC 1,107 ms
19,968 KB
testcase_24 AC 1,010 ms
19,968 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 893 ms
20,096 KB
testcase_31 AC 1,000 ms
19,840 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 991 ms
19,968 KB
testcase_39 AC 948 ms
19,968 KB
testcase_40 WA -
testcase_41 AC 1,068 ms
19,968 KB
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
04_evil_A_01 RE -
04_evil_A_02 RE -
04_evil_A_03 RE -
04_evil_A_04 RE -
04_evil_A_05 RE -
04_evil_A_06 RE -
04_evil_A_07 RE -
04_evil_A_08 RE -
04_evil_A_09 RE -
04_evil_A_10 RE -
05_evil_B_01 RE -
05_evil_B_02 RE -
05_evil_B_03 RE -
05_evil_B_04 RE -
05_evil_B_05 RE -
05_evil_B_06 RE -
05_evil_B_07 RE -
05_evil_B_08 RE -
05_evil_B_09 RE -
05_evil_B_10 RE -
06_evil_C_01 WA -
06_evil_C_02 WA -
06_evil_C_03 WA -
06_evil_C_04 WA -
06_evil_C_05 WA -
06_evil_C_06 WA -
06_evil_C_07 WA -
06_evil_C_08 WA -
06_evil_C_09 WA -
06_evil_C_10 AC 780 ms
19,968 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)
#define mp(x, y) make_pair(x, y)
constexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;
inline void YES(bool condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
inline void Yes(bool condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
inline void assertNO(bool condition){ if(!condition){ cout << "NO" << endl; exit(0); } }
inline void assertNo(bool condition){ if(!condition){ cout << "No" << endl; exit(0); } }
inline void assertm1(bool condition){ if(!condition){ cout << -1 << endl; exit(0); } }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int x, y; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class T> string to_string(complex<T> x){ return to_string(make_pair(x.real(), x.imag())); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) cout << (i == start ? "" : " ") << (*i); if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint P(int n, int r){ if(r < 0 || n < r) return 0; return (fact[n] * inv[n - r] % mod); } lint C(int p, int q){ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }
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; }
inline int at(lint i, int j){ return (i >> j) & 1; }
random_device rnd;
bool is_in_board(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }
lint inv2 = power(2, mod - 2, mod);

vector<int> A;
vector<lint> cntA, cntB;

void dfs(int cum_xor, int remaining, int back, bool is_A){
    // cout << remaining << endl;
    if(remaining == 0){
        if(is_A) cntA[cum_xor]++;
        else cntB[cum_xor]++;
        return;
    }
    for(int i: A){
        if(i == back) continue;
        dfs(cum_xor ^ i, remaining - 1, i, is_A);
    }
}

int main(){
    int N, K, X, Y;
    cin >> N >> K >> X >> Y;
    A.resize(K);
    cins(all(A));
    sort(all(A));
    A.erase(unique(all(A)), A.end());
    K = int(A.size());
    
    int M = N / 2;
    cntA.resize(1024, 0);
    cntB.resize(1024, 0);
    dfs(0, M, -1, true);
    dfs(0, N - M, -1, false);
    auto cntAs = cntA, cntBs = cntB;
    
    vector<vector<lint>> cntAx(1024), cntBx(1024);
    rep(i, 1024){
        cntA = vector<lint>(1024, 0);
        cntB = vector<lint>(1024, 0);
        dfs(0, M - 1, i, true);
        dfs(0, N - M - 1, i, false);
        cntAx[i] = cntA;
        cntBx[i] = cntB;
    }
    
    lint ans = 0;
    rep(i, 1024) rep(j, 1024){
        if(X <= (i ^ j) && (i ^ j) <= Y) ans += cntAs[i] * cntBs[j];
    }
    
    rep(x, 1024) rep(i, 1024) rep(j, 1024){
        if(X <= (i ^ j) && (i ^ j) <= Y) ans -= cntAx[x][i] * cntBx[x][j];
    }
    
    cout << ans % mod << endl;
}
0