#588052 (C++17) No.1304 あなたは基本が何か知っていますか？私は知っています．

提出ソース

結果

問題	No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー	👑 tute7627
提出日時	2020-12-02 02:02:36
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	MLE (最新) AC (最初)
実行時間	-
コード長	7,748 bytes
コンパイル時間	2,520 ms
コンパイル使用メモリ	217,176 KB
実行使用メモリ	790,904 KB
最終ジャッジ日時	2024-06-12 13:43:48
合計ジャッジ時間	52,304 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 13,760 KB
testcase_01	MLE	-
testcase_02	MLE	-
testcase_03	AC	2 ms 13,884 KB
testcase_04	MLE	-
testcase_05	AC	30 ms 13,884 KB
testcase_06	MLE	-
testcase_07	MLE	-
testcase_08	MLE	-
testcase_09	AC	47 ms 6,944 KB
testcase_10	AC	36 ms 6,944 KB
testcase_11	AC	51 ms 6,940 KB
testcase_12	AC	39 ms 6,940 KB
testcase_13	AC	27 ms 6,944 KB
testcase_14	AC	34 ms 6,944 KB
testcase_15	AC	31 ms 6,940 KB
testcase_16	AC	37 ms 6,940 KB
testcase_17	AC	5 ms 6,944 KB
testcase_18	AC	36 ms 6,944 KB
testcase_19	AC	20 ms 6,940 KB
testcase_20	AC	4 ms 6,940 KB
testcase_21	AC	9 ms 6,944 KB
testcase_22	AC	42 ms 6,940 KB
testcase_23	AC	50 ms 6,940 KB
testcase_24	AC	62 ms 7,296 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	3 ms 6,940 KB
testcase_27	AC	4 ms 6,940 KB
testcase_28	AC	2 ms 6,944 KB
testcase_29	AC	3 ms 6,940 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	4 ms 6,944 KB
testcase_33	AC	3 ms 6,940 KB
testcase_34	AC	4 ms 6,940 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	2 ms 6,944 KB
testcase_38	AC	2 ms 6,944 KB
testcase_39	AC	2 ms 6,944 KB
testcase_40	AC	2 ms 6,940 KB
testcase_41	AC	2 ms 6,944 KB
testcase_42	AC	2 ms 6,944 KB
testcase_43	AC	2 ms 6,944 KB
testcase_44	AC	2 ms 6,944 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	MLE	-
06_evil_C_01	MLE	-
06_evil_C_02	MLE	-
06_evil_C_03	MLE	-
06_evil_C_04	MLE	-
06_evil_C_05	MLE	-
06_evil_C_06	MLE	-
06_evil_C_07	MLE	-
06_evil_C_08	MLE	-
06_evil_C_09	MLE	-
06_evil_C_10	MLE	-

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

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
namespace BitConvolution{
  template<typename T>
  vector<T> or_zeta(const vector<T> &v){
    vector<T> ret = v;
    for(int i = 1; i < v.size(); i <<= 1){
      for(int j = 0; j < v.size(); j++){
        if(i & j)ret[j] += ret[j^i];
      }
    }
    return ret;
  }
  template<typename T>
  vector<T> or_meb(const vector<T> &v){
    vector<T> ret = v;
    for(int i = 1; i < v.size(); i <<= 1){
      for(int j = 0; j < v.size(); j++){
        if(i & j)ret[j] -= ret[j^i];
      }
    }
    return ret;
  }
  template<typename T>
  vector<T> and_zeta(const vector<T> &v){
    vector<T> ret = v;
    for(int i = 1; i < v.size(); i <<= 1){
      for(int j = 0; j < v.size(); j++){
        if(i & j)ret[j^i] += ret[j];
      }
    }
    return ret;
  }
  template<typename T>
  vector<T> or_conv(const vector<T> &a, const vector<T> &b){
    auto az = or_zeta(a);
    auto bz = or_zeta(b);
    for(int i = 0; i < az.size(); i++){
      az[i] *= bz[i];
    }
    return or_meb(az);
  }
  template<typename T>
  vector<T> and_meb(const vector<T> &v){
    vector<T> ret = v;
    for(int i = 1; i < v.size(); i <<= 1){
      for(int j = 0; j < v.size(); j++){
        if(i & j)ret[j^i] -= ret[j];
      }
    }
    return ret;
  }
  template<typename T>
  vector<T> xor_zeta(const vector<T> &v){
    vector<T> ret = v;
    for(int i = 1; i < v.size(); i <<= 1){
      for(int j = 0; j < v.size(); j++){
        if((i & j) == 0){
          T x = ret[j], y = ret[j | i];
          ret[j] = x + y, ret[j | i] = x - y;
        }
      }
    }
    return ret;
  }
  template<typename T>
  vector<T> and_conv(const vector<T> &a, const vector<T> &b){
    auto az = and_zeta(a);
    auto bz = and_zeta(b);
    for(int i = 0; i < az.size(); i++){
      az[i] *= bz[i];
    }
    return and_meb(az);
  }
  template<typename T>
  vector<T> xor_meb(const vector<T> &v){
    vector<T> ret = v;
    T inv=T(1)/2;
    for(int i = 1; i < v.size(); i <<= 1){
      for(int j = 0; j < v.size(); j++){
        if((i & j) == 0){
          T x = ret[j], y = ret[j | i];
          ret[j] = (x + y) * inv, ret[j | i] = (x - y) * inv;
        }
      }
    }
    return ret;
  }
  template<typename T>
  vector<T> xor_conv(const vector<T> &a, const vector<T> &b){
    auto az = xor_zeta(a);
    auto bz = xor_zeta(b);
    for(int i = 0; i < az.size(); i++){
      az[i] *= bz[i];
    }
    return xor_meb(az);
  }
};template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) += rhs;
  }
  friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) -= rhs;
  }
  friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) *= rhs;
  }
  friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) /= rhs;
  }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};
using modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}
//using modint=ld;
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,k,x,y;cin>>n>>k>>x>>y;
  vector<ll>a(k);
  rep(i,0,k)cin>>a[i];
  sort(ALL(a));
  a.erase(unique(ALL(a)),a.end());
  k=a.size();
  ll sz=1<<10;
  auto b=vec(k+1,sz,modint(0));
  auto dfs=[&](auto &&f,ll d,ll pre,ll x)->void{
    if(d*2==n){
      b[pre][x]+=1;
      b[k][x]+=1;
      return;
    }
    rep(i,0,k){
      if(i==pre)continue;
      f(f,d+1,i,x^a[i]);
    }
  };
  dfs(dfs,0,-1,0);
  modint ret=0;
  chmin(y,sz-1);
  rep(i,0,k+1){
    auto v=BitConvolution::xor_conv(b[i],b[i]);
    rep(j,x,y+1){
      if(i<k)ret-=v[j];
      else ret+=v[j];
    }
  }
  cout<<ret<<endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード