結果
問題 | No.404 部分門松列 |
ユーザー | kei |
提出日時 | 2018-12-02 18:13:31 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,061 ms / 2,000 ms |
コード長 | 3,671 bytes |
コンパイル時間 | 4,651 ms |
コンパイル使用メモリ | 186,620 KB |
実行使用メモリ | 45,944 KB |
最終ジャッジ日時 | 2023-09-13 20:55:47 |
合計ジャッジ時間 | 20,954 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 3 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 431 ms
21,432 KB |
testcase_14 | AC | 448 ms
19,356 KB |
testcase_15 | AC | 349 ms
13,992 KB |
testcase_16 | AC | 487 ms
23,720 KB |
testcase_17 | AC | 696 ms
32,740 KB |
testcase_18 | AC | 312 ms
14,744 KB |
testcase_19 | AC | 218 ms
14,408 KB |
testcase_20 | AC | 445 ms
21,748 KB |
testcase_21 | AC | 623 ms
27,544 KB |
testcase_22 | AC | 394 ms
16,712 KB |
testcase_23 | AC | 491 ms
23,420 KB |
testcase_24 | AC | 637 ms
24,148 KB |
testcase_25 | AC | 1,061 ms
45,944 KB |
testcase_26 | AC | 937 ms
37,364 KB |
testcase_27 | AC | 269 ms
11,764 KB |
testcase_28 | AC | 525 ms
24,420 KB |
testcase_29 | AC | 692 ms
30,520 KB |
testcase_30 | AC | 457 ms
17,240 KB |
testcase_31 | AC | 152 ms
7,876 KB |
testcase_32 | AC | 645 ms
31,904 KB |
testcase_33 | AC | 633 ms
29,696 KB |
testcase_34 | AC | 550 ms
20,144 KB |
ソースコード
#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; }