結果

問題 No.121 傾向と対策：門松列（その２）
ユーザー jabeejabee
提出日時 2023-03-31 00:19:34
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,997 bytes
コンパイル時間 4,714 ms
コンパイル使用メモリ 285,424 KB
実行使用メモリ 206,372 KB
最終ジャッジ日時 2024-09-22 08:29:20
合計ジャッジ時間 11,621 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
26,256 KB
testcase_01 AC 112 ms
30,308 KB
testcase_02 AC 31 ms
19,980 KB
testcase_03 WA -
testcase_04 AC 3,425 ms
206,372 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 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 op(ll a, ll b){return a+b;}
ll e(){return 0;}

ll add(ll n, vector<vector<ll>>&mp){
  
  fenwick_tree<ll>fw(n+5);
//  segtree<ll,op,e>seg(n+5);
  //rep(i,1,n+1)seg.set(i,1);
  rep(i,1,n+1)fw.add(i,1);
  ll res = 0;
  for(auto v:mp){
 //  vector<ll>v = p.second;
    ll vsiz = v.size();
    rep(i,0,vsiz){
        ll pos = v[i];
      //  ll ltot = seg.prod(0,pos);
      //  ll rtot = seg.prod(pos,n+5);
        ll ltot = fw.sum(0,pos);
        ll rtot = fw.sum(pos,n+5);
        rtot -= vsiz - i;
       // seg.set(pos,0);
       fw.add(pos,-1);
        res += ltot * rtot;
     if(vsiz == 3)cout << ltot << " " << rtot << endl;
    }
  }
  return res;
}

ll sub(ll n, vector<vector<ll>>&mp){
 
    ll res = 0;
    
  for(auto v:mp){
  //  vector<ll>v = p.second;
    ll vsiz = v.size();
    if(vsiz == 1)continue;
    ll tot = 0;
    ll temp = res;
    rep(i,0,vsiz-1){
        tot += v[i+1] - v[i] - 1;
    }
    rep(i,0,vsiz-1){
        res += tot;
        tot -= v[i+1] - v[i] - 1;
    }  
  }
  
  return res;

}

//ll solve(){
ll solve(vector<ll>a){
    auto t1 = std::chrono::high_resolution_clock::now();
//  ll n;
//    cin >> n;
//  vector<ll>a(n);
//  rep(i,0,n)cin >> a[i];
  ll n = a.size();
  map<ll,ll>mp2;
  set<ll>st;
  rep(i,0,n)st.insert(a[i]);
  ll cnt = 0;
  for(auto e:st){
    mp2[e] = cnt;
    cnt++;
  }
  vector<vector<ll>>mp(cnt);
  rep(i,0,n)mp[mp2[a[i]]].push_back(i+1);

  ll ans = 0;
  ans += add(n,mp);
 // cout << ans << endl;
  ans -= sub(n,mp);
 // cout << ans << endl;
  reverse(all(mp));
  ans += add(n,mp);
 // cout << ans << endl;
  //cout << ans << endl;
  
    auto t2 = std::chrono::high_resolution_clock::now();
 ll time = std::chrono::duration_cast<std::chrono::milliseconds>(t2 - t1).count();
 // cerr << time << endl;
  return ans;
}

ll greedy_solve(vector<ll>a){
    ll res = 0;
    ll n = a.size();
    rep(i,0,n-2)rep(j,i+1,n-1)rep(k,j+1,n){
    set<ll>st;
    vector<ll>v;
    v.push_back(a[i]);
    v.push_back(a[j]);
    v.push_back(a[k]);
    rep(m,0,v.size())st.insert(v[m]);
    if(st.size() != 3)continue;
    if(v[1] == *st.begin() || v[1] == *st.rbegin()){
    res++;
    }   
    }
    return res;
}

vector<ll> make_rand_case(ll n, ll maxe){
    std::uniform_int_distribution<> distnum(0, maxe);
    vector<ll>res;
    rep(i,0,n){
    int e = distnum(engine);
    res.push_back(e);
    }
    return res;
}
void _main() {
    /*
   vector<ll>a;
   ll maxn = 1000000;
   ll subn = 1;
   rep(i,0,8){
   rep(j,0,maxn)a.push_back(j % subn);
   cout << solve(a) << endl;
   subn *= 10;
   }
   */
  ll n;
  cin >> n;
  vector<ll>a(n);
  rep(i,0,n)cin >> a[i];
  cout << solve(a) << endl;
  /*
  while(1){
    ll n = 5;
    ll maxe = 5;
  vector<ll>a = make_rand_case(n,maxe);
  ll gans = greedy_solve(a);
  ll ans = solve(a);
  if(gans != ans){
  cout << gans << " " << ans << endl;
  cout << n << endl;
  rep(i,0,n)cout << a[i] << " ";
  cout << endl;
  return;
  }
  }
*/

}
0