#586635 (C++17) No.1300 Sum of Inversions

提出ソース

結果

問題	No.1300 Sum of Inversions
ユーザー	ganariya
提出日時	2020-11-28 20:24:18
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	11,385 bytes
コンパイル時間	3,378 ms
コンパイル使用メモリ	187,604 KB
実行使用メモリ	31,384 KB
最終ジャッジ日時	2023-10-11 01:52:49
合計ジャッジ時間	18,569 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	27 ms 27,908 KB
testcase_01	AC	28 ms 27,984 KB
testcase_02	AC	28 ms 27,912 KB
testcase_03	AC	415 ms 30,328 KB
testcase_04	AC	402 ms 30,448 KB
testcase_05	AC	334 ms 29,764 KB
testcase_06	AC	460 ms 30,556 KB
testcase_07	AC	441 ms 30,448 KB
testcase_08	AC	484 ms 30,604 KB
testcase_09	AC	479 ms 30,632 KB
testcase_10	AC	270 ms 29,532 KB
testcase_11	AC	279 ms 29,552 KB
testcase_12	AC	399 ms 30,212 KB
testcase_13	AC	387 ms 30,272 KB
testcase_14	WA	-
testcase_15	AC	479 ms 30,780 KB
testcase_16	AC	420 ms 30,408 KB
testcase_17	AC	267 ms 29,476 KB
testcase_18	AC	300 ms 29,572 KB
testcase_19	AC	352 ms 29,908 KB
testcase_20	AC	363 ms 30,056 KB
testcase_21	AC	358 ms 29,884 KB
testcase_22	AC	329 ms 30,060 KB
testcase_23	AC	458 ms 30,528 KB
testcase_24	AC	337 ms 29,912 KB
testcase_25	AC	289 ms 29,548 KB
testcase_26	AC	285 ms 29,640 KB
testcase_27	AC	313 ms 29,800 KB
testcase_28	WA	-
testcase_29	AC	354 ms 29,868 KB
testcase_30	AC	470 ms 30,608 KB
testcase_31	AC	326 ms 29,876 KB
testcase_32	AC	339 ms 30,136 KB
testcase_33	AC	261 ms 31,212 KB
testcase_34	AC	327 ms 30,964 KB
testcase_35	WA	-
testcase_36	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

//include
//------------------------------------------
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <chrono>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <cassert>
#include <type_traits>

using namespace std;

// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;

// container util
//------------------------------------------

typedef int pInt[4];
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr) for(typeof((arr).begin()) i=(arr).begin(); i!=(arr).end(); ++i)
#define EXIST(str, e) ((str).find(e)!=(str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin()+(c), (arr).end())
#define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second


// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() std::ios::sync_with_stdio(false);std::cin.tie(0)
#define OUT(d) std::cout<<(d)
#define OUT_L(d) std::cout<<(d)<<endl
#define FOUT(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)
#define FOUT_L(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)<<"\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v) {std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yay() printf("Yay!\n")
#define Nnn() printf(":(\n")
#define CE(x, y) ((x + y - 1) / (y))


template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}

template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "\n";
    return out;
}

template<class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


//repetition
//------------------------------------------
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n)  FOR(i,0,n)
#define RREP(i, n) for(int i = n-1;i >= 0;i--)
#define FORLL(i, a, b) for(LL i=LL(a);i<LL(b);++i)
#define RFORLL(i, a, b) for(LL i=LL(b)-1;i>=LL(a);--i)
#define REPLL(i, n) for(LL i=0;i<LL(n);++i)
#define RREPLL(i, n) for(LL i=LL(n)-1;i>=0;--i)
#define FOREACH(x, arr) for(auto &(x) : (arr))

// Option + Control + K  Terminal
// Command + Control + K    Run
// Command + b   EOF
// #include "atcoder/all"

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

template<typename T>
struct SegmentTree {
private:
    using Func = function<T(T, T)>;

    int n;
    vector<T> node;

    T init_v;
    Func func;

public:

    SegmentTree(vector<T> a, Func _func, T _init_v) {
        int sz = a.size();
        n = 1;
        init_v = _init_v;
        func = _func;

        while (n < sz) n *= 2;
        node.resize(2 * n, init_v);
        for (int i = 0; i < sz; i++) node[i + n - 1] = a[i];
        for (int i = n - 2; i >= 0; i--) node[i] = func(node[i * 2 + 1], node[i * 2 + 2]);
    }

    void update(int pos, T v) {
        int k = pos + n - 1;
        node[k] += v;
        while (k > 0) {
            k = (k - 1) / 2;
            node[k] = func(node[k * 2 + 1], node[k * 2 + 2]);
        }
    }

    T get(int pos) {
        int k = pos + n - 1;
        return node[k];
    }

    T query(int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0) r = n;
        if (r <= a || b <= l) return init_v;
        if (a <= l && r <= b)return node[k];
        T lv = query(a, b, k * 2 + 1, l, (l + r) / 2);
        T rv = query(a, b, k * 2 + 2, (l + r) / 2, r);
        return func(lv, rv);
    }

};

template<int_fast64_t Modulas = 1000000007ul>
class ModInt {
    using u64 = int_fast64_t;
public:
    u64 x;

    constexpr ModInt() : x(0) {}
    constexpr ModInt(int_fast64_t v) : x((v % Modulas + Modulas) % Modulas) {}
    constexpr ModInt operator+(const ModInt rhs) const noexcept {
        return ModInt(*this) += rhs;
    }
    constexpr ModInt operator-(const ModInt rhs) const noexcept {
        return ModInt(*this) -= rhs;
    }
    constexpr ModInt operator*(const ModInt rhs) const noexcept {
        return ModInt(*this) *= rhs;
    }
    constexpr ModInt operator/(const ModInt rhs) const noexcept {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt operator/(const long long rhs) const noexcept {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt operator+=(const ModInt rhs) noexcept {
        x += rhs.x;
        if (x >= Modulas) x -= Modulas;
        return *this;
    }
    constexpr ModInt operator+=(const long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) += hs;
        return *this;
    }
    constexpr ModInt operator-=(const ModInt rhs) noexcept {
        if (x < rhs.x) x += Modulas;
        x -= rhs.x;
        return *this;
    }
    constexpr ModInt operator-=(const long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) -= hs;
        return *this;
    }
    constexpr ModInt operator*=(const ModInt rhs) noexcept {
        x = x * rhs.x % Modulas;
        return *this;
    }
    constexpr ModInt operator*=(const long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) *= hs;
        return *this;
    }
    constexpr ModInt &operator/=(ModInt rhs) noexcept {
        u64 exp = Modulas - 2;
        while (exp > 0) {
            if (exp & 1ul) *this *= rhs;
            rhs *= rhs;
            exp >>= 1ul;
        }
        return *this;
    }
    constexpr ModInt &operator/=(long long rhs) noexcept {
        auto hs = ModInt<Modulas>(rhs);
        (*this) /= hs;
        return *this;
    }

    constexpr ModInt &operator++() noexcept {
        x++;
        if (x >= Modulas) x -= Modulas;
        return *this;
    }
    constexpr ModInt &operator--() noexcept {
        if (x == 0) x += Modulas;
        x--;
        return *this;
    }
    constexpr bool operator<(const ModInt rhs) const noexcept {
        return x < rhs.x;
    }
    constexpr bool operator==(const ModInt rhs) const noexcept {
        return this->x == rhs.x;
    }
    constexpr bool operator!=(const ModInt rhs) const noexcept {
        return !(*this == rhs);
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        in >> m.x;
        if (m.x < 0) m.x += Modulas;
        m.x %= Modulas;
        return in;
    }
    friend ostream &operator<<(ostream &out, const ModInt &p) {
        out << p.x;
        return out;
    }
    constexpr ModInt pow(u64 p) const {
        ModInt ret(1);
        ModInt mul(x);
        while (p > 0) {
            if (p & 1ul) ret *= mul;
            mul *= mul;
            p >>= 1ul;
        }
        return ret;
    }
    constexpr ModInt operator~() const noexcept {
        u64 exp = Modulas - 2;
        return pow(exp);
    }

    constexpr static ModInt arith_sum(ModInt<Modulas> a, ModInt<Modulas> d, ModInt<Modulas> n) noexcept {
        return (a * ModInt<Modulas>(2) + (n - 1) * d) * n / ModInt<Modulas>(2);
    }
};

constexpr LL m = 998244353;
typedef ModInt<m> mod;

template<class T>
std::vector<T> press(std::vector<T> &x) {
    auto res = x;
    std::sort(res.begin(), res.end());
    res.erase(std::unique(res.begin(), res.end()), res.end());
    for (int i = 0; i < (int) x.size(); i++)
        x[i] = std::lower_bound(res.begin(), res.end(), x[i]) - res.begin();
    return res;
}

int main() {

    constexpr LL MAX = 400040;

    LL N;
    cin >> N;

    vector<LL> A(N);
    cin >> A;

    auto rec = press(A);

    vector<mod> r(MAX), l(MAX);
    vector<int> cr(MAX), cl(MAX);
    {
        SegmentTree<mod> s(vector<mod>(MAX), [](const auto a, const auto b) {
            return a + b;
        }, 0);
        SegmentTree<int> cnt(vector<int>(MAX), [](const auto a, const auto b) {
            return a + b;
        }, 0);
        for (int i = N - 1; i >= 0; i--) {
            s.update(A[i], rec[A[i]]);
            cnt.update(A[i], 1);
            r[i] = s.query(0, A[i]);
            cr[i] = cnt.query(0, A[i]);
        }
    }

    {
        SegmentTree<mod> s(vector<mod>(MAX), [](const auto a, const auto b) {
            return a + b;
        }, 0);
        SegmentTree<int> cnt(vector<int>(MAX), [](const auto a, const auto b) {
            return a + b;
        }, 0);
        for (int i = 0; i < N; i++) {
            s.update(A[i], rec[A[i]]);
            cnt.update(A[i], 1);
            l[i] = s.query(A[i] + 1, MAX);
            cl[i] = cnt.query(A[i] + 1, MAX);
        }
    }

    mod ans = 0;
    for (int i = 0; i < N; i++) {
        if (!cl[i] * cr[i]) continue;
        ans += (cl[i] * cr[i]) * rec[A[i]];
        ans += l[i] * cr[i];
        ans += r[i] * cl[i];
    }

    cout << ans << endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード