結果

問題 No.1300 Sum of Inversions
ユーザー sapphire__15
提出日時 2020-11-28 00:27:11
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 449 ms / 2,000 ms
コード長 6,262 bytes
コンパイル時間 1,533 ms
コンパイル使用メモリ 123,420 KB
最終ジャッジ日時 2025-01-16 08:52:55
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;
#define rip(i, n, ss) for (int i = (ss);i < (int)( n ); i++)
#define all(l) l.begin(), l.end()
#define MM << " " <<
template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
inline bool chmax(T &l, const T b) {
if (l < b) {
l = b;
return true;
}
return false;
}
template<typename T>
inline bool chmin(T &l, const T b) {
if (l > b) {
l = b;
return true;
}
return false;
}
# ifdef LOCAL_DEBUG
template<typename T>
void vdeb(const std::vector<T> &bb) {
for (unsigned int i = 0;i < bb.size();i++) {
if (i == bb.size() - 1) std::cout << bb[i];
else std::cout << bb[i] << ' ';
}
std::cout << '\n';
}
template<typename T>
void vdeb(const std::vector<std::vector<T>> &bb) {
for (unsigned int i = 0;i < bb.size();i++) {
std::cout << i << ' ';
vdeb(bb[i]);
}
std::cout << '\n';
}
# endif
long long pow(long long n, long long p, long long k) {//n^k(mod p)
if (!k) return 1;
long long a = pow(n,p, k>>1);
a = a * a%p;
if (k & 1) a = a * n%p;
return a;
}
void euclid(long long &a, long long &b, long long p) { // a>=b A*b+B*(a-a/b*b)=1
if (a == 1) {
a = 1;
}
else {
long long A = b, B = a % b;
euclid(A, B, p);
b = (A - (p + a / b) % p * B % p + p) % p;
a = B;
}
}
long long rev(long long n, long long p) {// n*x-p*y=1
//long long q = p;
//euclid(p, n, p);
//return n % q;
return pow(n,p,p-2);
}
long long bino(long long n, long long m, long long p) {//nCm(mod p)
long long ans = 1, div = 1;
for(int i = 0;i < m; i++){
ans = (n - i) * ans % p;
div = div * (i +1) % p;
}
return ans * rev(div, p) % p;
}
struct modint {
long long num;
long long p;
modint() {
num = 0;
p = 998244353;
}
modint(long long x) {
p = 998244353;
num = x % p;
}
modint inv()const{return rev(num, p);}
modint operator-() const{return modint(p-num);}
modint& operator+=(const modint &other){
num = (num + other.num) % p;
return *this;
}
modint& operator-=(const modint &other){
num = (num - other.num + p) % p;
return *this;
}
modint& operator*=(const modint &other){
num = (num * other.num) % p;
return *this;
}
modint& operator/=(const modint &other){
(*this) *= other.inv();
return *this;
}
modint& operator+=(const long long &other){
num = (num + other) % p;
return *this;
}
modint& operator-=(const long long &other){
num = (num - other + p) % p;
return *this;
}
modint& operator*=(const long long &other){
num = (num * other) % p;
return *this;
}
modint& operator/=(const long long &other){
(*this) *= rev(other, p);
return *this;
}
modint& operator++(){return *this += 1;}
modint& operator--(){return *this -= 1;}
modint& operator=(const long long &other){return (*this) = modint(other);}
modint operator+(const modint &other) const{return modint(*this) += other;}
modint operator-(const modint &other) const{return modint(*this) -= other;}
modint operator*(const modint &other) const{return modint(*this) *= other;}
modint operator/(const modint &other) const{return modint(*this) /= other;}
modint operator+(const long long &other) const{return modint(*this) += other;}
modint operator-(const long long &other) const{return modint(*this) -= other;}
modint operator*(const long long &other) const{return modint(*this) *= other;}
modint operator/(const long long &other) const{return modint(*this) /= other;}
bool operator==(const modint &other) const{return num == other.num;}
};
std::istream& operator>>(std::istream &is, const modint x) {
std::cin >> x.num;
return is;
}
std::ostream& operator<<(std::ostream &os, const modint &x){
std::cout << x.num;
return os;
}
template<typename T>
struct BIT{
std::vector<T> li;
int size;
BIT (int n){
li=std::vector<T>(n+1);
size=n;
}
T sum (int i){ // sum of [0, n)
assert(0 <= i && i <= size);
if(i == 0) return 0;
T s=0;
while(i>0){
s+=li[i];
i-=i & -i;
}
return s;
}
T sum(int i, int j) { // sum of [i, j)
assert(i < j);
return sum(j) - sum(i);
}
void add(int i,T x){ // li[i] += x
assert(0 <= i && i < size);
++i;
while(i<=size){
li[i]+=x;
i+=i & -i;
}
}
};
using namespace std;
int main() {
int n; cin >> n;
vector<Pii> da(n);
vector<int> st(n);
rip(i,n,0) {
cin >> da[i].first;
da[i].second = i;
}
sort(all(da));
reverse(all(da));
rip(i,n,0) {
st[da[i].second] = i;
swap(da[i].first, da[i].second);
}
sort(all(da));
BIT<modint> one(n), two(n), onep(n), twop(n);
modint ans;
rip(i,n,0) {
int now = st[i];
if(onep.sum(now) == 0) {
one.add(now, modint(da[i].second));
onep.add(now, modint(1));
}
else if(onep.sum(now) == 1) {
two.add(now, one.sum(now) + onep.sum(now)*da[i].second);
twop.add(now, onep.sum(now));
one.add(now, modint(da[i].second));
onep.add(now, modint(1));
}
else {
ans += two.sum(now) + twop.sum(now) * da[i].second;
two.add(now, one.sum(now) +onep.sum(now)* da[i].second);
twop.add(now, onep.sum(now));
one.add(now, modint(da[i].second));
onep.add(now, modint(1));
}
}
cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0