結果

問題 No.404 部分門松列
ユーザー kei
提出日時 2018-12-02 18:13:31
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,056 ms / 2,000 ms
コード長 3,671 bytes
コンパイル時間 2,152 ms
コンパイル使用メモリ 191,176 KB
実行使用メモリ 45,224 KB
最終ジャッジ日時 2024-07-01 05:25:37
合計ジャッジ時間 19,436 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

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

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
<url:https://yukicoder.me/problems/no/404>
============================================================
=================================================================
=============================================================
================================================================
*/
struct BIT {
ll N;
vector<ll> bit;
BIT(ll N):N(N) {
/* BIT[1..N] */
bit.resize(N + 1, 0);
}
void add(int x, ll val){
while (x <= N) {
bit[x] += val;
x += x & -x;
}
}
ll sum(int x){
ll ret = 0;
while (x) {
ret += bit[x];
x &= (x - 1);
}
return (ret);
}
};
bool isKadomatsu(int a,int b,int c){
if(a == b || b == c || c == a) return false;
if(b > a && b > c) return true;
if(b < a && b < c) return true;
return false;
}
void solve(){
int N; cin >> N;
vector<int> compv;
vector<int> a(N);
for(auto& in:a){
cin >> in;
compv.push_back(in);
}
int Q; cin >> Q;
vector<int> L(Q),H(Q);
for(int i = 0; i < Q;i++){
cin >> L[i] >> H[i];
compv.push_back(L[i]);
compv.push_back(H[i]);
}
compv.push_back(0); compv.push_back(INF);
sort(compv.begin(),compv.end());
compv.erase(unique(compv.begin(),compv.end()),compv.end());
for(auto &v:a) v = (int)(lower_bound(compv.begin(), compv.end(), v) - compv.begin());
for(auto &v:L) v = (int)(lower_bound(compv.begin(), compv.end(), v) - compv.begin());
for(auto &v:H) v = (int)(lower_bound(compv.begin(), compv.end(), v) - compv.begin());
BIT bitL(compv.size()), bitR(compv.size()),F(compv.size());
vector<ll> LU(N),LD(N),RU(N),RD(N);
for(int i = 0; i < N;i++){
LU[i] = bitL.sum((int)compv.size()) - bitL.sum(a[i]);
LD[i] = bitL.sum(a[i]-1);
bitL.add(a[i],1);
}
for(int i = N-1; i >= 0; i--){
RU[i] = bitR.sum((int)compv.size()) - bitR.sum(a[i]);
RD[i] = bitR.sum(a[i]-1);
bitR.add(a[i],1);
}
for(int i = 0; i < N;i++) F.add(a[i],LU[i]*RU[i]+LD[i]*RD[i]);
map<ll,ll> sL,sR;
for(int i = 0; i < N;i++) sR[a[i]]++;
ll same = 0;
for(int i = 0; i < N;i++){
same -= sL[a[i]]*sR[a[i]];
F.add(a[i],-same);
sR[a[i]]--;
sL[a[i]]++;
same += sL[a[i]]*sR[a[i]];
}
for(int i = 0; i < Q;i++){
cout << F.sum(H[i]) - F.sum(L[i]-1) << endl;
}
}
int main(void) {
cin.tie(0); ios_base::sync_with_stdio(false);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0