結果

問題 No.1548 [Cherry 2nd Tune B] 貴方と私とサイクルとモーメント
ユーザー PCTprobabilityPCTprobability
提出日時 2021-04-30 23:03:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 186 ms / 4,500 ms
コード長 6,159 bytes
コンパイル時間 6,901 ms
コンパイル使用メモリ 315,588 KB
実行使用メモリ 31,744 KB
最終ジャッジ日時 2024-05-08 16:15:39
合計ジャッジ時間 14,078 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 141 ms
17,152 KB
testcase_03 AC 39 ms
10,496 KB
testcase_04 AC 125 ms
29,952 KB
testcase_05 AC 13 ms
5,376 KB
testcase_06 AC 101 ms
16,384 KB
testcase_07 AC 106 ms
31,360 KB
testcase_08 AC 146 ms
17,664 KB
testcase_09 AC 100 ms
10,880 KB
testcase_10 AC 81 ms
29,568 KB
testcase_11 AC 104 ms
29,824 KB
testcase_12 AC 71 ms
6,784 KB
testcase_13 AC 55 ms
29,696 KB
testcase_14 AC 112 ms
9,984 KB
testcase_15 AC 54 ms
31,488 KB
testcase_16 AC 111 ms
18,048 KB
testcase_17 AC 143 ms
29,440 KB
testcase_18 AC 114 ms
30,976 KB
testcase_19 AC 54 ms
10,112 KB
testcase_20 AC 78 ms
30,208 KB
testcase_21 AC 93 ms
16,512 KB
testcase_22 AC 183 ms
31,744 KB
testcase_23 AC 184 ms
31,616 KB
testcase_24 AC 184 ms
31,616 KB
testcase_25 AC 184 ms
31,616 KB
testcase_26 AC 183 ms
31,616 KB
testcase_27 AC 180 ms
31,616 KB
testcase_28 AC 186 ms
31,616 KB
testcase_29 AC 183 ms
31,616 KB
testcase_30 AC 183 ms
31,616 KB
testcase_31 AC 184 ms
31,744 KB
testcase_32 AC 151 ms
31,744 KB
testcase_33 AC 158 ms
31,616 KB
testcase_34 AC 160 ms
31,616 KB
testcase_35 AC 157 ms
31,616 KB
testcase_36 AC 157 ms
31,616 KB
testcase_37 AC 159 ms
31,616 KB
testcase_38 AC 156 ms
31,744 KB
testcase_39 AC 158 ms
31,616 KB
testcase_40 AC 165 ms
31,616 KB
testcase_41 AC 163 ms
31,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = long long;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define pll pair<ll,ll>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define in scanner.read_int()
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}
void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } }
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
const ll t0=1,t1=10,t2=100,t3=1000,t4=10000,t5=100000,t6=1000000,t7=10000000,t8=t7*10,t9=t8*10,t10=t9*10,t11=t10*10,t12=t11*10,t13=t12*10,t14=t13*10,t15=t14*10,t16=t15*10,t17=t16*10,t18=t17*10;
void gbjsmzmfuuvdf(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(20);
}
class Scanner {
    vector<char> buffer;
    ssize_t n_written;
    ssize_t n_read;

public:
    Scanner(): buffer(1024*1024) { do_read(); }

    int64_t read_int() {
        int64_t ret = 0, sgn = 1;
        int ch = current_char();
        while (isspace(ch)) { ch = next_char(); }
        if (ch == '-') { sgn = -1; ch = next_char(); }
        for (; isdigit(ch); ch = next_char())
            ret = (ret * 10) + (ch - '0');
        return sgn * ret;
    }

private:
    void do_read() {
        ssize_t r = read(0, &buffer[0], buffer.size());
        if (r < 0) {
            throw runtime_error(strerror(errno));
        }
        n_written = r;
        n_read = 0;
    }

    inline int next_char() {
        ++n_read;
        if (n_read == n_written) { do_read(); }
        return current_char();
    }

    inline int current_char() {
        return (n_read == n_written) ? EOF : buffer[n_read];
    }
};
//Scanner scanner;
//void vin(vector<ll> &n){for(int i=0;i<int(n.size());i++) n[i]=in;}
using mint = modint998244353;
struct S{
    mint value;
    int size;
};
using F = mint;
const F ID = mint(2000000000);
S op(S a, S b){ return {a.value+b.value, a.size+b.size}; }
S e(){ return {0, 0}; }
S mapping(F f, S x){
    if(f != ID) x.value = x.size * f;
    return x;
}
F composition(F f, F g){ return (f == ID ? g : f); }
F id(){ return ID; }
int main() {
  gbjsmzmfuuvdf();
  ll n;
  cin>>n;
  assert(3<=n&&n<=200000);
  vector<S> f1(n,{0,1});
  vector<S> f2(n,{0,1});
  vector<S> f3(n,{0,1});
  vector<S> f4(n,{0,1});
  vector<ll> x(n);
  vcin(x);
  for(int i=0;i<n;i++){
    assert(x[i]>=0&&x[i]<mod);
    mint u=x[i];
    f1[i].value=u;
    f2[i].value=u.pow(2);
    f3[i].value=u.pow(3);
    f4[i].value=u.pow(4);
  }
  lazy_segtree<S, op, e, F, mapping, composition, id> seg1(f1);
  lazy_segtree<S, op, e, F, mapping, composition, id> seg2(f2);
  lazy_segtree<S, op, e, F, mapping, composition, id> seg3(f3);
  lazy_segtree<S, op, e, F, mapping, composition, id> seg4(f4);
  ll q;
  cin>>q;
  assert(1<=q&&q<=25000);
  ll count=0;
  while(q--){
    ll t;
    cin>>t;
    assert(t>=0&&t<=4);
    if(t==0){
      ll u,v,w,b;
      cin>>u>>v>>w>>b;
      assert(1<=u&&u<=n&&1<=v&&v<=n&&1<=w&&w<=n&&(u-v)*(v-w)*(w-u)!=0);
      assert(0<=b&&b<mod);
      u--;
      v--;
      w--;
      if(u>v) swap(u,v);
      mint p=b;
      if(u<w&&w<v){
        seg1.apply(u,v+1,p);
        seg2.apply(u,v+1,p.pow(2));
        seg3.apply(u,v+1,p.pow(3));
        seg4.apply(u,v+1,p.pow(4));
      }
      else{
        seg1.apply(0,u+1,p);
        seg2.apply(0,u+1,p.pow(2));
        seg3.apply(0,u+1,p.pow(3));
        seg4.apply(0,u+1,p.pow(4));
        seg1.apply(v,n,p);
        seg2.apply(v,n,p.pow(2));
        seg3.apply(v,n,p.pow(3));
        seg4.apply(v,n,p.pow(4));
      }
    }
    else{
      ll u,v,w;
      cin>>u>>v>>w;
      assert(1<=u&&u<=n&&1<=v&&v<=n&&1<=w&&w<=n&&(u-v)*(v-w)*(w-u)!=0);
      u--;
      v--;
      w--;
      if(u>v) swap(u,v);
      mint u1=0,u2=0,u3=0,u4=0;
      mint h=v-u+1;
      if(u<w&&w<v){
        u1+=seg1.prod(u,v+1).value;
        u2+=seg2.prod(u,v+1).value;
        u3+=seg3.prod(u,v+1).value;
        u4+=seg4.prod(u,v+1).value;
      }
      else{
        h=n-h+2;
        u1+=seg1.prod(0,u+1).value;
        u2+=seg2.prod(0,u+1).value;
        u3+=seg3.prod(0,u+1).value;
        u4+=seg4.prod(0,u+1).value;
        u1+=seg1.prod(v,n).value;
        u2+=seg2.prod(v,n).value;
        u3+=seg3.prod(v,n).value;
        u4+=seg4.prod(v,n).value;
      }
      mint y=u1/h;
      if(t==1){
        cout<<0<<endl;
      }
      if(t==2){
        cout<<((u2-2*y*u1+y*y*h)/h).val()<<endl;
      }
      if(t==3){
        cout<<((u3-3*u2*y+3*u1*y*y-y*y*y*h)/h).val()<<endl;
      }
      if(t==4){
        cout<<((u4-4*u3*y+6*u2*y*y-4*u1*y*y*y+y*y*y*y*h)/h).val()<<endl;
      }
    }
  }
}
0