結果

問題 No.1546 [Cherry 2nd Tune D] 思ったよりも易しくない
ユーザー LayCurseLayCurse
提出日時 2021-06-11 23:35:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 78 ms / 2,000 ms
コード長 7,070 bytes
コンパイル時間 2,986 ms
コンパイル使用メモリ 220,600 KB
実行使用メモリ 10,264 KB
最終ジャッジ日時 2024-12-15 03:11:15
合計ジャッジ時間 9,250 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
7,500 KB
testcase_01 AC 2 ms
7,624 KB
testcase_02 AC 3 ms
7,752 KB
testcase_03 AC 3 ms
7,496 KB
testcase_04 AC 3 ms
7,632 KB
testcase_05 AC 3 ms
7,628 KB
testcase_06 AC 2 ms
7,632 KB
testcase_07 AC 2 ms
7,624 KB
testcase_08 AC 3 ms
7,496 KB
testcase_09 AC 3 ms
7,624 KB
testcase_10 AC 3 ms
7,628 KB
testcase_11 AC 2 ms
7,624 KB
testcase_12 AC 2 ms
7,628 KB
testcase_13 AC 30 ms
9,268 KB
testcase_14 AC 69 ms
9,416 KB
testcase_15 AC 37 ms
9,160 KB
testcase_16 AC 38 ms
9,552 KB
testcase_17 AC 29 ms
9,288 KB
testcase_18 AC 50 ms
9,548 KB
testcase_19 AC 49 ms
9,808 KB
testcase_20 AC 54 ms
10,220 KB
testcase_21 AC 5 ms
7,840 KB
testcase_22 AC 49 ms
9,292 KB
testcase_23 AC 41 ms
9,576 KB
testcase_24 AC 10 ms
8,544 KB
testcase_25 AC 72 ms
9,680 KB
testcase_26 AC 73 ms
9,416 KB
testcase_27 AC 36 ms
9,552 KB
testcase_28 AC 73 ms
10,056 KB
testcase_29 AC 74 ms
9,932 KB
testcase_30 AC 74 ms
10,224 KB
testcase_31 AC 73 ms
9,292 KB
testcase_32 AC 75 ms
9,808 KB
testcase_33 AC 73 ms
9,548 KB
testcase_34 AC 73 ms
9,416 KB
testcase_35 AC 73 ms
10,188 KB
testcase_36 AC 74 ms
10,264 KB
testcase_37 AC 74 ms
9,808 KB
testcase_38 AC 74 ms
9,800 KB
testcase_39 AC 78 ms
9,296 KB
testcase_40 AC 75 ms
9,288 KB
testcase_41 AC 74 ms
10,216 KB
testcase_42 AC 75 ms
9,548 KB
testcase_43 AC 72 ms
10,148 KB
testcase_44 AC 69 ms
9,420 KB
testcase_45 AC 68 ms
9,416 KB
testcase_46 AC 69 ms
9,164 KB
testcase_47 AC 68 ms
10,224 KB
testcase_48 AC 73 ms
9,676 KB
testcase_49 AC 73 ms
10,256 KB
testcase_50 AC 2 ms
7,628 KB
testcase_51 AC 3 ms
7,624 KB
testcase_52 AC 2 ms
7,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
#define MD (998244353U)
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++(){
    val++;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator--(){
    if(val == 0){
      val = MD - 1;
    }
    else{
      --val;
    }
    return *this;
  }
  inline Modint operator++(int a){
    Modint res(*this);
    val++;
    if(val >= MD){
      val -= MD;
    }
    return res;
  }
  inline Modint operator--(int a){
    Modint res(*this);
    if(val == 0){
      val = MD - 1;
    }
    else{
      --val;
    }
    return res;
  }
  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 void rd(long long &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');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class T> inline T pow2_L(T a){
  return a*a;
}
int N;
long long T[300000];
long long V[300000];
Modint tot;
Modint gt(Modint c){
  Modint res = 0;
  res -=(pow2_L((c * (c+1) / 2)));
  res += (tot) * c * (c+1) * (2*c+1) / 6;
  res += (tot + 1) * c * (c+1) / 2;
  return res / 2;
}
int main(){
  int i;
  Modint res = 0;
  Modint cur = 0;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(T[Lj4PdHRW]);
      rd(V[Lj4PdHRW]);
    }
  }
  for(i=(0);i<(N);i++){
    tot += T[i];
  }
  for(i=(0);i<(N);i++){
    res += V[i] * (gt(cur + T[i]) - gt(cur));
    cur += T[i];
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay version 20210611-1 [beta]

// --- original code ---
// #define MD 998244353
// int N; ll T[3d5], V[];
// Modint tot;
// 
// Modint gt(Modint c){
//   Modint res = 0;
//   res -= (c * (c+1) / 2) ** 2;
//   res += (tot) * c * (c+1) * (2*c+1) / 6;
//   res += (tot + 1) * c * (c+1) / 2;
//   return res / 2;
// }
// 
// {
//   Modint res = 0, cur = 0;
//   rd(N,(T,V)(N));
//   rep(i,N) tot += T[i];
//   rep(i,N){
//     res += V[i] * (gt(cur + T[i]) - gt(cur));
//     cur += T[i];
//   }
//   wt(res);
// }
0