結果

問題 No.1712 Read and Pile
ユーザー snukesnuke
提出日時 2021-10-27 09:05:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 487 ms / 2,000 ms
コード長 6,421 bytes
コンパイル時間 2,513 ms
コンパイル使用メモリ 219,712 KB
実行使用メモリ 29,636 KB
最終ジャッジ日時 2024-10-07 05:12:05
合計ジャッジ時間 15,824 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 1 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,816 KB
testcase_06 AC 2 ms
6,820 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 314 ms
16,624 KB
testcase_09 AC 401 ms
28,984 KB
testcase_10 AC 298 ms
16,568 KB
testcase_11 AC 354 ms
29,072 KB
testcase_12 AC 262 ms
16,644 KB
testcase_13 AC 295 ms
16,588 KB
testcase_14 AC 277 ms
16,700 KB
testcase_15 AC 351 ms
16,524 KB
testcase_16 AC 337 ms
16,632 KB
testcase_17 AC 315 ms
16,624 KB
testcase_18 AC 325 ms
16,632 KB
testcase_19 AC 293 ms
16,516 KB
testcase_20 AC 303 ms
16,636 KB
testcase_21 AC 368 ms
28,948 KB
testcase_22 AC 337 ms
29,032 KB
testcase_23 AC 432 ms
29,428 KB
testcase_24 AC 413 ms
29,300 KB
testcase_25 AC 443 ms
29,360 KB
testcase_26 AC 487 ms
29,364 KB
testcase_27 AC 486 ms
29,636 KB
testcase_28 AC 243 ms
16,580 KB
testcase_29 AC 378 ms
29,260 KB
testcase_30 AC 306 ms
29,128 KB
testcase_31 AC 238 ms
29,424 KB
testcase_32 AC 176 ms
29,208 KB
testcase_33 AC 315 ms
29,164 KB
testcase_34 AC 293 ms
29,104 KB
testcase_35 AC 435 ms
29,308 KB
testcase_36 AC 483 ms
29,348 KB
testcase_37 AC 434 ms
29,192 KB
testcase_38 AC 2 ms
6,816 KB
testcase_39 AC 138 ms
9,944 KB
testcase_40 AC 143 ms
16,300 KB
testcase_41 AC 159 ms
16,148 KB
testcase_42 AC 173 ms
16,336 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>;
using P = pair<int,int>; using vp = vc<P>;
int getInt(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

// Mod int
const uint mod = 998244353;
struct mint {
  uint x;
  mint(): x(0) {}
  mint(ll x):x((x%mod+mod)%mod) {}
  mint operator-() const { return mint(0) - *this;}
  mint operator~() const { return mint(1) / *this;}
  mint& operator+=(const mint& a) { if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a) { if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a) { x=(ull)x*a.x%mod; return *this;}
  mint& operator/=(const mint& a) { x=(ull)x*a.pow(mod-2).x%mod; return *this;}
  mint operator+(const mint& a) const { return mint(*this) += a;}
  mint operator-(const mint& a) const { return mint(*this) -= a;}
  mint operator*(const mint& a) const { return mint(*this) *= a;}
  mint operator/(const mint& a) const { return mint(*this) /= a;}
  mint pow(ll t) const {
    if(!t) return 1;
    mint res = pow(t/2);
    res *= res;
    return (t&1)?res*x:res;
  }
  bool operator<(const mint& a) const { return x < a.x;}
  bool operator==(const mint& a) const { return x == a.x;}
  bool operator!=(const mint& a) const { return x != a.x;}
};
mint ex(mint x, ll t) { return x.pow(t);}
istream& operator>>(istream&i,mint&a) {i>>a.x;return i;}
//*
ostream& operator<<(ostream&o,const mint&a) {o<<a.x;return o;}
/*/
ostream& operator<<(ostream&o, const mint&x) {
  int a = x.x, b = 1;
  rep(s,2)rrep(i,1000) {
    int y = ((s?-x:x)*i).x;
    if (abs(a)+b > y+i) a = s?-y:y, b = i;
  }
  o<<a; if (b != 1) o<<'/'<<b; return o;
}//*/
using vm = vector<mint>;
using vvm = vector<vm>;
struct modinv {
  int n; vm d;
  modinv(): n(2), d({0,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(-d[mod%n]*(mod/n)), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} invs;
struct modfact {
  int n; vm d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(d.back()*n), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} facs;
struct modfactinv {
  int n; vm d;
  modfactinv(): n(2), d({1,1}) {}
  mint operator()(int i) { while (n <= i) d.pb(d.back()*invs(n)), ++n; return d[i];}
  mint operator[](int i) const { return d[i];}
} ifacs;
mint comb(int a, int b) {
  if (a < b || b < 0) return 0;
  return facs(a)*ifacs(b)*ifacs(a-b);
}
//

// Segment tree
struct F {
  int k;
  mint d, e;
  mint s2, d2, e2;
  F(int k=0, mint d=0, mint e=1, mint s2=0, mint d2=0, mint e2=1):k(k),d(d),e(e),s2(s2),d2(d2),e2(e2) {}
  F& operator+=(const F& f) {
    k += f.k;
    d *= f.e; d += f.d;
    e *= f.e;
    s2 += d2*f.k; s2 *= f.e2; s2 += f.s2;
    d2 *= f.e2; d2 += f.d2;
    e2 *= f.e2;
    return *this;
  }
  F operator+(const F& f) const { return F(*this) += f;}
};
struct seg {
  vector<F> d; int n;
  seg(){}
  seg(int mx) {
    n = 1; while (n < mx) n <<= 1;
    d = vector<F>(n<<1);
  }
  void upd(int i) { d[i] = d[i<<1]+d[i<<1|1];}
  F& operator[](int i) { return d[n+i];}
  void init() { for(int i=n-1;i;--i) upd(i);}
  void add(int i, F f) { for (i+=n,d[i]+=f,i>>=1;i;i>>=1) upd(i);}
  void set(int i, F f) { for (i+=n,d[i]=f,i>>=1;i;i>>=1) upd(i);}
  F get(int l, int r) {
    l += n; r += n;
    F lf, rf;
    while (l < r) {
      if (l&1) lf += d[l++];
      if (r&1) rf = d[--r] + rf;
      l >>= 1; r >>= 1;
    }
    return lf += rf;
  }
};
//

struct Solver {
  void solve() {
    int n,m;
    scanf("%d%d",&n,&m);
    vi a(m);
    cin>>a;
    seg t(m+n);
    mint ans;
    vi p(n);
    rep(i,n) p[i] = n-1-i, t.set(i, F(1));
    mint c1 = mint(n-1)/n;
    mint c2 = mint(n-2)/n;
    rep(i,m) {
      int na = a[i];
      if (na == -1) {
        ans += mint(n-1)/2;
        t.set(n+i, F(0,1,c1,0,1,c2));
      } else {
        --na;
        F d = t.get(p[na]+1, n+i);
        {
          mint now = (d.d-d.d2)*(n-1) + d.s2;
          now /= n;
          now += (d.e-d.e2)*(n-1) + d.e2*d.k;
          ans += now;
        }
        t.set(p[na], F(0));
        p[na] = n+i;
        t.set(p[na], F(1));
      }
    }
    ans += m;
    cout<<ans<<endl;
  }
};

int main() {
  int ts = 1;
  // scanf("%d",&ts);
  rrep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0