結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
ユーザー LayCurseLayCurse
提出日時 2020-05-29 22:00:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 178 ms / 2,000 ms
コード長 6,837 bytes
コンパイル時間 2,820 ms
コンパイル使用メモリ 218,900 KB
実行使用メモリ 147,820 KB
最終ジャッジ日時 2024-11-06 04:38:06
合計ジャッジ時間 6,997 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 105 ms
146,160 KB
testcase_01 AC 104 ms
144,164 KB
testcase_02 AC 103 ms
146,116 KB
testcase_03 AC 104 ms
146,264 KB
testcase_04 AC 103 ms
145,796 KB
testcase_05 AC 104 ms
146,320 KB
testcase_06 AC 103 ms
146,252 KB
testcase_07 AC 104 ms
146,232 KB
testcase_08 AC 103 ms
146,088 KB
testcase_09 AC 103 ms
146,356 KB
testcase_10 AC 103 ms
147,548 KB
testcase_11 AC 145 ms
146,212 KB
testcase_12 AC 132 ms
146,420 KB
testcase_13 AC 152 ms
145,976 KB
testcase_14 AC 128 ms
146,280 KB
testcase_15 AC 115 ms
146,268 KB
testcase_16 AC 114 ms
147,820 KB
testcase_17 AC 105 ms
146,248 KB
testcase_18 AC 133 ms
145,984 KB
testcase_19 AC 131 ms
146,204 KB
testcase_20 AC 123 ms
145,988 KB
testcase_21 AC 177 ms
146,236 KB
testcase_22 AC 177 ms
146,008 KB
testcase_23 AC 178 ms
146,792 KB
testcase_24 AC 102 ms
145,752 KB
testcase_25 AC 103 ms
146,080 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MD (998244353U)
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){
  sort(a, a+N);
}
template<class T1> void rsortA_L(int N, T1 a[], void *mem = wmem){
  sortA_L(N, a, mem);
  reverse(a, a+N);
}
struct Modint{
  unsigned val;
  Modint(){
    val=0;
  }
  Modint(int a){
    val = ord(a);
  }
  Modint(unsigned a){
    val = ord(a);
  }
  Modint(long long a){
    val = ord(a);
  }
  Modint(unsigned long long a){
    val = ord(a);
  }
  inline unsigned ord(unsigned a){
    return a%MD;
  }
  inline unsigned ord(int a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned ord(unsigned long long a){
    return a%MD;
  }
  inline unsigned ord(long long a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned get(){
    return val;
  }
  inline Modint &operator+=(Modint a){
    val += a.val;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator-=(Modint a){
    if(val < a.val){
      val = val + MD - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  inline Modint &operator*=(Modint a){
    val = ((unsigned long long)val*a.val)%MD;
    return *this;
  }
  inline Modint &operator/=(Modint a){
    return *this *= a.inverse();
  }
  inline Modint operator+(Modint a){
    return Modint(*this)+=a;
  }
  inline Modint operator-(Modint a){
    return Modint(*this)-=a;
  }
  inline Modint operator*(Modint a){
    return Modint(*this)*=a;
  }
  inline Modint operator/(Modint a){
    return Modint(*this)/=a;
  }
  inline Modint operator+(int a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(int a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(int a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(int a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator+(long long a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(long long a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(long long a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(long long a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator-(void){
    Modint res;
    if(val){
      res.val=MD-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  inline operator bool(void){
    return val!=0;
  }
  inline operator int(void){
    return get();
  }
  inline operator long long(void){
    return get();
  }
  inline Modint inverse(){
    int a = val;
    int b = MD;
    int u = 1;
    int v = 0;
    int t;
    Modint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += MD;
    }
    res.val = u;
    return res;
  }
  inline Modint pw(unsigned long long b){
    Modint a(*this);
    Modint res;
    res.val = 1;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  inline bool operator==(int a){
    return ord(a)==val;
  }
  inline bool operator!=(int a){
    return ord(a)!=val;
  }
}
;
inline Modint operator+(int a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(int a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(int a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(int a, Modint b){
  return Modint(a)/=b;
}
inline Modint operator+(long long a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(long long a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(long long a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(long long a, Modint b){
  return Modint(a)/=b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int N;
int Q;
int A[6000];
int L;
int R;
int P;
Modint dp[6001][6001];
Modint m[6001];
int main(){
  int t_ynMSdg;
  wmem = memarr;
  Modint tmp;
  int i;
  int res;
  rd(N);
  rd(Q);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  rsortA_L(N,A);
  dp[0][0] = 1;
  for(i=(0);i<(N);i++){
    int j;
    for(j=(0);j<(i+1);j++){
      dp[i+1][j] += dp[i][j] * (A[i] - 1);
      dp[i+1][j+1] += dp[i][j];
    }
  }
  m[N] = 1;
  for(i=(N)-1;i>=(0);i--){
    m[i] = m[i+1] * A[i];
  }
  for(t_ynMSdg=(0);t_ynMSdg<(Q);t_ynMSdg++){
    rd(L);
    rd(R);
    rd(P);
    i = res = 0;
    while(L <= R){
      while(i < N && A[i] >= R){
        i++;
      }
      res ^= (int)(dp[i][P] * m[i]);
      R--;
    }
    wt_L(res);
    wt_L('\n');
  }
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// #define MD 998244353
// int N, Q, A[6000], L, R, P;
// Modint dp[6001][6001], m[6001];
// {
//   Modint tmp;
//   int i, res;
//   rd(N,Q,A(N));
//   rsortA(N,A);
//   dp[0][0] = 1;
//   rep(i,N) rep(j,i+1){
//     dp[i+1][j] += dp[i][j] * (A[i] - 1);
//     dp[i+1][j+1] += dp[i][j];
//   }
//   m[N] = 1;
//   rrep(i,N) m[i] = m[i+1] * A[i];
//   rep(Q){
//     rd(L,R,P);
//     i = res = 0;
//     while(L <= R){
//       while(i < N && A[i] >= R) i++;
//       res ^= (int)(dp[i][P] * m[i]);
//       R--;
//     }
//     wt(res);
//   }
// }
0