結果
| 問題 | No.404 部分門松列 |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2016-07-23 01:30:48 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 848 ms / 2,000 ms |
| コード長 | 9,413 bytes |
| コンパイル時間 | 1,493 ms |
| コンパイル使用メモリ | 117,272 KB |
| 実行使用メモリ | 29,308 KB |
| 最終ジャッジ日時 | 2024-06-28 17:00:56 |
| 合計ジャッジ時間 | 16,981 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 31 |
ソースコード
/*### ############## ################################################################################################################################################ ##################################### ####### ############################ ################# ################### # ########################## ######### ################################### # ########################### ############## ################################ ######### ################################### ####### ###################################### # ####### ################################################ ################################################ ################################################ ############################################## ########################################## ################################# ######################### ################ ######## ### ## # ## # # # # # #### #### #### #### ##### # # # # ## # # # # # # #____# ### #/ # # ## # # # # # # # #^^^^ ### ###/# # # # #### #### ###/# #### ####*/#include <iostream>#include <vector>#include <cstdio>#include <sstream>#include <map>#include <string>#include <algorithm>#include <queue>#include <cmath>#include <functional>#include <set>#include <ctime>#include <random>#include <chrono>#include <cassert>using namespace std;namespace {using Integer = long long; //__int128;template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}template<class T> istream& operator , (istream& is, T& val){ return is >> val;}template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}template<class H> void print(const H& head){ cout << head; }template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }template<class H> void eprint(const H& head){ cerr << head; }template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }class range{long long start_, end_, step_;public:struct range_iterator{long long val, step_;range_iterator(long long v, long long step) : val(v), step_(step) {}long long operator * (){return val;}void operator ++ (){val += step_;}bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}};range(long long len) : start_(0), end_(len), step_(1) {}range(long long start, long long end) : start_(start), end_(end), step_(1) {}range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}range_iterator begin(){ return range_iterator(start_, step_); }range_iterator end(){ return range_iterator( end_, step_); }};string operator "" _s (const char* str, size_t size){ return move(string(str)); }constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexedmt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());template<class T> string join(const vector<T>& v, const string& sep){stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();}string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }}constexpr long long mod = 9_ten + 7;template<class T = int>class BinaryIndexedTree_1_indexed{void init(const vector<T> &A){for(int i=0; i<N; i++){add(i+1, A[i]);}}public:vector<T> tree;int N;BinaryIndexedTree_1_indexed(const int n) : tree(n+1,0), N(n){}BinaryIndexedTree_1_indexed(const vector<T> &A) : tree(A.size()+1,0), N(A.size()){init(A);}//caution : position "i" must be 1-indexedvoid add(int i, const T x){while(i <= N){tree[i] += x;i += i & -i;}}//update node i to zerovoid to_zero(const int i){T val = get_at(i);add(i, -val);}//get sums [0,i]T get_sum(int i){T ret=0;while(i>0){ret += tree[i];i -= i & -i;}return ret;}//get sums [from,to]T get_sums_range(const int from, const int to){return get_sum(to) - get_sum(from-1);}//get at [i]T get_at(const int i){return get_sum(i) - get_sum(i-1);}int lower_bound(T val){if(val<=0) return 0;int x = 0;int k = 1;while((k<<1) <= N) k<<=1;for( ; k>0; k>>=1){if( x+k <= N && tree[x+k] < val ){val -= tree[x+k];x += k;}}return x+1;}void print(){for(int i=0; i<=N; i++){cerr << tree[i] << " ";}cerr << endl;}};int main(){int n;cin >> n;vector<int> a(n);cin >> a;int q;cin >> q;vector<int> d;d.push_back( 0);d.push_back(-1);vector<int> l(q), h(q);for(int i : range(q)){cin >> l[i], h[i];d.push_back(l[i]);d.push_back(h[i]);}for(int i : range(n)){d.push_back(a[i]);}sort(d.begin(), d.end());d.erase( unique(d.begin(), d.end()), d.end());for(int i :range(n)){a[i] = lower_bound(d.begin(), d.end(), a[i]) - d.begin();}for(int i : range(q)){l[i] = lower_bound(d.begin(), d.end(), l[i]) - d.begin();h[i] = lower_bound(d.begin(), d.end(), h[i]) - d.begin();}vector<long long> dp_low(d.size()+1, 0);vector<long long> dp_high(d.size()+1, 0);BinaryIndexedTree_1_indexed<long long> t_l(d.size()+1);BinaryIndexedTree_1_indexed<long long> t_r(d.size()+1);BinaryIndexedTree_1_indexed<long long> c(d.size()+1);for(int i : range(n-1, 0, -1)){t_r.add( a[i], 1 );}for(int i : range(1,n-1)){c.add( a[i-1], - t_l.get_at(a[i-1]) * t_r.get_at(a[i-1]) );if(a[i] != a[i-1]) c.add( a[i] , - t_l.get_at(a[i]) * t_r.get_at(a[i]) );t_l.add(a[i-1], 1);t_r.add(a[i] , -1);c.add( a[i-1], + t_l.get_at(a[i-1]) * t_r.get_at(a[i-1]) );if(a[i] != a[i-1]) c.add( a[i] , + t_l.get_at(a[i]) * t_r.get_at(a[i]) );dp_low [ a[i] ] += t_l.get_sums_range(1, a[i]-1) * t_r.get_sums_range(1, a[i]-1);dp_high[ a[i] ] += t_l.get_sums_range(a[i]+1, d.size()) * t_r.get_sums_range(a[i]+1, d.size());dp_low [ a[i] ] -= c.get_sums_range(1, a[i]-1);dp_high[ a[i] ] -= c.get_sums_range(a[i]+1, d.size());}for(int i : range(1, d.size()+1) ){dp_low[ i ] += dp_low[i-1];}for(int i : range(d.size()-2, -1, -1) ){dp_high[ i ] += dp_high[i+1];}for(int i : range(q)){println( dp_high[ l[i] ] - dp_high[ h[i]+1 ] + dp_low[ h[i] ] - dp_low[l[i] - 1] );}return 0;}