結果

問題 No.1258 コインゲーム
ユーザー LayCurseLayCurse
提出日時 2020-10-16 22:14:03
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 64 ms / 2,000 ms
コード長 6,261 bytes
コンパイル時間 2,506 ms
コンパイル使用メモリ 214,572 KB
実行使用メモリ 5,600 KB
最終ジャッジ日時 2023-09-28 03:27:00
合計ジャッジ時間 7,491 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
4,376 KB
testcase_01 AC 16 ms
4,376 KB
testcase_02 AC 6 ms
4,376 KB
testcase_03 AC 50 ms
5,276 KB
testcase_04 AC 56 ms
5,404 KB
testcase_05 AC 10 ms
4,376 KB
testcase_06 AC 41 ms
5,220 KB
testcase_07 AC 5 ms
4,380 KB
testcase_08 AC 5 ms
4,376 KB
testcase_09 AC 21 ms
4,376 KB
testcase_10 AC 50 ms
5,068 KB
testcase_11 AC 53 ms
5,360 KB
testcase_12 AC 41 ms
5,012 KB
testcase_13 AC 14 ms
4,376 KB
testcase_14 AC 6 ms
4,380 KB
testcase_15 AC 47 ms
5,184 KB
testcase_16 AC 10 ms
4,376 KB
testcase_17 AC 55 ms
5,260 KB
testcase_18 AC 21 ms
4,528 KB
testcase_19 AC 19 ms
4,380 KB
testcase_20 AC 39 ms
4,996 KB
testcase_21 AC 52 ms
5,236 KB
testcase_22 AC 37 ms
4,988 KB
testcase_23 AC 26 ms
4,872 KB
testcase_24 AC 11 ms
4,376 KB
testcase_25 AC 25 ms
4,636 KB
testcase_26 AC 22 ms
4,624 KB
testcase_27 AC 50 ms
5,092 KB
testcase_28 AC 14 ms
4,376 KB
testcase_29 AC 15 ms
4,376 KB
testcase_30 AC 64 ms
5,340 KB
testcase_31 AC 17 ms
4,380 KB
testcase_32 AC 8 ms
4,380 KB
testcase_33 AC 42 ms
5,032 KB
testcase_34 AC 50 ms
5,168 KB
testcase_35 AC 19 ms
4,380 KB
testcase_36 AC 49 ms
5,440 KB
testcase_37 AC 20 ms
4,376 KB
testcase_38 AC 48 ms
5,344 KB
testcase_39 AC 14 ms
4,376 KB
testcase_40 AC 41 ms
5,424 KB
testcase_41 AC 40 ms
5,368 KB
testcase_42 AC 39 ms
5,460 KB
testcase_43 AC 41 ms
5,492 KB
testcase_44 AC 40 ms
5,328 KB
testcase_45 AC 40 ms
5,392 KB
testcase_46 AC 41 ms
5,376 KB
testcase_47 AC 41 ms
5,524 KB
testcase_48 AC 38 ms
5,600 KB
testcase_49 AC 39 ms
5,372 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MD (1000000007U)
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;
  }
}
inline int rd_int(void){
  int x;
  rd(x);
  return 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');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class T, class S> inline T pow_L(T a, S b){
  T res = 1;
  res = 1;
  for(;;){
    if(b&1){
      res *= a;
    }
    b >>= 1;
    if(b==0){
      break;
    }
    a *= a;
  }
  return res;
}
inline double pow_L(double a, double b){
  return pow(a,b);
}
int main(){
  int Lj4PdHRW;
  int KL2GvlyY = rd_int();
  for(Lj4PdHRW=(0);Lj4PdHRW<(KL2GvlyY);Lj4PdHRW++){
    int N;
    rd(N);
    int M;
    rd(M);
    int X;
    rd(X);
    Modint res;
    if(N%2==0){
      res = ((pow_L(Modint(M+1),N))+(pow_L(Modint(M-1),N))) / 2;
    }
    else{
      res = ((pow_L(Modint(M+1),(N-1))) +(pow_L(Modint(M-1),(N-1))) + M * ((pow_L(Modint(M+1),(N-1))) -(pow_L(Modint(M-1),(N-1))))) / 2;
    }
    if(X==1){
      res =(pow_L(Modint(M+1),N))- res;
    }
    wt_L(res);
    wt_L('\n');
  }
  return 0;
}
// cLay varsion 20201003-1

// --- original code ---
// {
//   REP(rd_int()){
//     int @N, @M, @X;
//     Modint res;
// 
//     if(N%2==0){
//       res = (Modint(M+1) ** N + Modint(M-1) ** N) / 2;
//     } else {
//       res = (Modint(M+1) ** (N-1) + Modint(M-1) ** (N-1) + M * (Modint(M+1) ** (N-1) - Modint(M-1) ** (N-1))) / 2;
//     }
//     if(X==1) res = Modint(M+1) ** N - res;
// 
//     wt(res);
//   }
// }
0