結果

問題 No.2327 Inversion Sum
ユーザー jabeejabee
提出日時 2023-06-06 22:26:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,624 bytes
コンパイル時間 4,804 ms
コンパイル使用メモリ 276,484 KB
実行使用メモリ 23,720 KB
最終ジャッジ日時 2024-06-09 06:21:43
合計ジャッジ時間 7,388 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 29 ms
20,012 KB
testcase_12 AC 29 ms
19,840 KB
testcase_13 AC 28 ms
19,160 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 27 ms
18,880 KB
testcase_21 AC 27 ms
18,944 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 27 ms
18,900 KB
testcase_25 AC 27 ms
18,944 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 27 ms
18,944 KB
testcase_29 AC 27 ms
19,040 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
ll calc(vector<ll>l,ll n){
  ll siz = l.size();
  fenwick_tree<ll>fw(n+5);
  ll res = 0;
  rep(i,0,siz){
    res += fw.sum(l[i],n+5);
    fw.add(l[i],1);
  }
  return res;
}
void _main() {
  /*
  rep(i,1,6){
    vector<ll>v;
    rep(j,0,i)v.push_back(j);
    ll res = 0;
    do{
       res += calc(v,i);    
    }while(next_permutation(v.begin(),v.end()));
    cout << res << endl;
  }
  */
  ll n,m;
  cin >> n >> m;
  vector<ll>p(m),k(m);
  vector<ll>c(n,-1);
  vector<ll>l;
  vector<P>lp;
  rep(i,0,m){
    cin >> p[i] >> k[i];
    p[i]--;
    k[i]--;
    c[k[i]] = p[i];
    lp.push_back({k[i],p[i]});
  }
  sort(all(lp));
  rep(i,0,m)l.push_back(lp[i].second);
  ll cnt = 0;
  fenwick_tree<ll>fw(n+5);
  rep(i,0,n){
    fw.add(i,1);
    //if(c[i] != -1){
    //  fw.add(i,-1);
   // }else cnt++;
  }
  rep(i,0,m)fw.add(l[i],-1);
  cnt = n - m;
  mint perm = 1;
  rep(i,1,cnt+1)perm *= i;
  mint ans = 0;
  ll inv = calc(l,n);
 // cout << inv << endl;
 // cout << inv << " " << perm << " " << cnt << endl;
  ans += perm * inv;
  //cout << ans << endl;
  ll now = 0;
  /*
  rep(i,0,n)cout << fw.sum(i,i+1) << " ";
  cout << endl;
  rep(i,0,n)cout << c[i] << " ";
  cout << endl;
  */
  rep(i,0,n){
    if(c[i] == -1)now++;
    else{
      ll bigger = fw.sum(c[i],n+5);
      mint mbigger = bigger;
      mint mcnt = cnt;
   //   cout << mbigger << endl;
      ans += (mbigger / mcnt) * now * perm; 
    }
  }
//  cout << ans << endl;
  mint add = 1;
  rep(i,1,cnt+1)add *= i;
  add *= cnt;
  add *= cnt-1;
  add /= 4;
  ans += add;
  cout << ans << endl;
  
}
0