結果
問題 | No.1304 あなたは基本が何か知っていますか?私は知っています. |
ユーザー | kappybar |
提出日時 | 2020-12-05 20:02:47 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 541 ms / 2,000 ms |
コード長 | 2,730 bytes |
コンパイル時間 | 1,750 ms |
コンパイル使用メモリ | 169,084 KB |
実行使用メモリ | 484,636 KB |
最終ジャッジ日時 | 2023-09-03 04:07:22 |
合計ジャッジ時間 | 86,378 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 13 ms
17,988 KB |
testcase_01 | AC | 55 ms
271,524 KB |
testcase_02 | AC | 13 ms
17,996 KB |
testcase_03 | AC | 541 ms
484,636 KB |
testcase_04 | AC | 14 ms
18,044 KB |
testcase_05 | AC | 13 ms
18,052 KB |
testcase_06 | AC | 14 ms
18,056 KB |
testcase_07 | AC | 13 ms
18,008 KB |
testcase_08 | AC | 89 ms
51,596 KB |
testcase_09 | AC | 14 ms
257,012 KB |
testcase_10 | AC | 14 ms
20,788 KB |
testcase_11 | AC | 13 ms
18,044 KB |
testcase_12 | AC | 14 ms
256,924 KB |
testcase_13 | AC | 14 ms
256,968 KB |
testcase_14 | AC | 13 ms
257,004 KB |
testcase_15 | AC | 13 ms
20,692 KB |
testcase_16 | AC | 14 ms
20,896 KB |
testcase_17 | AC | 56 ms
28,020 KB |
testcase_18 | AC | 14 ms
13,668 KB |
testcase_19 | AC | 13 ms
13,728 KB |
testcase_20 | AC | 14 ms
13,616 KB |
testcase_21 | AC | 54 ms
28,088 KB |
testcase_22 | AC | 15 ms
13,604 KB |
testcase_23 | AC | 14 ms
13,704 KB |
testcase_24 | AC | 14 ms
13,664 KB |
testcase_25 | AC | 199 ms
93,720 KB |
testcase_26 | AC | 88 ms
44,492 KB |
testcase_27 | AC | 93 ms
44,716 KB |
testcase_28 | AC | 129 ms
60,848 KB |
testcase_29 | AC | 90 ms
44,436 KB |
testcase_30 | AC | 166 ms
77,304 KB |
testcase_31 | AC | 273 ms
126,468 KB |
testcase_32 | AC | 92 ms
44,488 KB |
testcase_33 | AC | 194 ms
93,708 KB |
testcase_34 | AC | 91 ms
44,440 KB |
testcase_35 | AC | 165 ms
77,240 KB |
testcase_36 | AC | 246 ms
110,060 KB |
testcase_37 | AC | 168 ms
77,240 KB |
testcase_38 | AC | 169 ms
77,304 KB |
testcase_39 | AC | 316 ms
142,864 KB |
testcase_40 | AC | 168 ms
77,304 KB |
testcase_41 | AC | 320 ms
143,172 KB |
testcase_42 | AC | 175 ms
77,312 KB |
testcase_43 | AC | 167 ms
77,372 KB |
testcase_44 | AC | 252 ms
110,108 KB |
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 | TLE | - |
05_evil_B_02 | TLE | - |
05_evil_B_03 | TLE | - |
05_evil_B_04 | TLE | - |
05_evil_B_05 | TLE | - |
05_evil_B_06 | TLE | - |
05_evil_B_07 | TLE | - |
05_evil_B_08 | TLE | - |
05_evil_B_09 | TLE | - |
05_evil_B_10 | TLE | - |
06_evil_C_01 | TLE | - |
06_evil_C_02 | TLE | - |
06_evil_C_03 | TLE | - |
06_evil_C_04 | TLE | - |
06_evil_C_05 | RE | - |
06_evil_C_06 | TLE | - |
06_evil_C_07 | RE | - |
06_evil_C_08 | RE | - |
06_evil_C_09 | RE | - |
06_evil_C_10 | WA | - |
ソースコード
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<(int)(n);i++) #define chmin(x,y) x = min((x),(y)); #define chmax(x,y) x = max((x),(y)); using namespace std; using ll = long long ; using P = pair<int,int> ; using pll = pair<long long,long long>; const int INF = 1e9; const long long LINF = 1e17; //const int MOD = 1000000007; const int MOD = 998244353; const double PI = 3.14159265358979323846; template<int mod> struct ModInt{ long long x=0; constexpr ModInt(long long x=0):x((x%mod+mod)%mod){} constexpr ModInt operator+(const ModInt& r)const{return ModInt(*this)+=r;} constexpr ModInt operator-(const ModInt& r)const{return ModInt(*this)-=r;} constexpr ModInt operator*(const ModInt& r)const{return ModInt(*this)*=r;} constexpr ModInt operator/(const ModInt& r)const{return ModInt(*this)/=r;} constexpr ModInt& operator+=(const ModInt& r){ if((x+=r.x)>=mod) x-=mod; return *this;} constexpr ModInt& operator-=(const ModInt& r){ if((x-=r.x)<0) x+=mod; return *this;} constexpr ModInt& operator*=(const ModInt& r){ if((x*=r.x)>=mod) x%=mod; return *this;} constexpr ModInt& operator/=(const ModInt& r){ return *this*=r.inv();} ModInt inv() const { long long s=x,sx=1,sy=0,t=mod,tx=0,ty=1; while(s%t!=0){ long long temp=s/t,u=s-t*temp,ux=sx-temp*tx,uy=sy-temp*ty; s=t;sx=tx;sy=ty; t=u;tx=ux;ty=uy; } return ModInt(tx); } ModInt pow(long long n) const { ModInt a=1; ModInt b=*this; while(n>0){ if(n&1) a*=b; b*=b; n>>=1; } return a; } friend constexpr ostream& operator<<(ostream& os,const ModInt<mod>& a) {return os << a.x;} friend constexpr istream& operator>>(istream& is,ModInt<mod>& a) {return is >> a.x;} }; using mint = ModInt<MOD>; mint dp[42][1025][1025]; mint a[1024]; int main(){ int n,k; cin >> n >> k; ll x,y; cin >> x >> y; rep(i,k){ int b; cin >> b; a[b]+=1; } vector<mint> dpp(1024,0); for(int i=0;i<1024;i++){ for(int j=0;j<1024;j++){ if(i == j) continue; dp[1][i^j][j] = a[i] * a[j]; dpp[i^j] += a[i] * a[j]; } } for(int i=1;i<n-1;i++){ vector<mint> new_dpp(1024,0); for(int j=0;j<1024;j++){ for(int k=0;k<1024;k++){ dp[i+1][k][j] += (dpp[j] - dp[i][j][k]) * a[j^k]; new_dpp[k] += (dpp[j] - dp[i][j][k]) * a[j^k]; } } swap(new_dpp,dpp); } mint ans = 0; for(int i=x;i<=y;i++){ for(int j=0;j<1024;j++) ans += dp[n-1][i][j]; } cout << ans << endl; return 0; }