結果
問題 | No.742 にゃんにゃんにゃん 猫の挨拶 |
ユーザー |
![]() |
提出日時 | 2018-10-05 21:50:11 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 15 ms / 2,500 ms |
コード長 | 3,483 bytes |
コンパイル時間 | 1,504 ms |
コンパイル使用メモリ | 172,612 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-12 13:56:12 |
合計ジャッジ時間 | 2,151 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 16 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long signed int LL;typedef long long unsigned int LU;#define incID(i, l, r) for(int i = (l) ; i < (r); i++)#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)#define decII(i, l, r) for(int i = (r) ; i >= (l); i--)#define inc(i, n) incID(i, 0, n)#define inc1(i, n) incII(i, 1, n)#define dec(i, n) decID(i, 0, n)#define dec1(i, n) decII(i, 1, n)#define inII(v, l, r) ((l) <= (v) && (v) <= (r))#define inID(v, l, r) ((l) <= (v) && (v) < (r))#define PB push_back#define EB emplace_back#define MP make_pair#define FI first#define SE second#define PQ priority_queue#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()#define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it)#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)template<typename T> bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } }template<typename T> bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } }template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }// ---- ----template<typename T> class SegmentTree {private:T * a = NULL;int N = -1, S;function<T(T, T)> F;T I;bool is_available = false;public:SegmentTree() { }SegmentTree(int n, function<T(T, T)> func, T id) { init(n, func, id); }void init(int size, function<T(T, T)> func, T id) {assert(size > 0);N = size;F = func;I = id;S = 1;while(S < size) { S *= 2; }delete[] a;a = new T[S * 2];inc(i, S * 2) { a[i] = I; }is_available = true;}T operator[](int p) {assert(inID(p, 0, N));p += S;return a[p];}T & ref(int p) {is_available = false;assert(inID(p, 0, N));p += S;return a[p];}void calc() {decID(i, 1, S) { a[i] = F(a[i * 2], a[i * 2 + 1]); }is_available = true;}void apply(int p, function<void(T &)> op) {assert(inID(p, 0, N));p += S;op(a[p]);while(p != 1) {p /= 2;a[p] = F(a[p * 2], a[p * 2 + 1]);}}T fold_ID(int l, int r, bool loop = false) {assert(is_available);assert(inII(l, 0, N));assert(inII(r, 0, N));if(loop && l >= r) { return F(fold_ID(l, N), fold_ID(0, r)); }assert(l <= r);l += S;r += S;T v = I, w = I;while(l < r) {if(l + 1 == r) { v = F(v, a[l]); break; }if(l % 2 == 1) { v = F(v, a[l]); }if(r % 2 == 1) { w = F(a[r - 1], w); }l = (l + 1) / 2;r = r / 2;}return F(v, w);}T fold_II(int l, int r, bool loop = false) { return fold_ID(l , r + 1, loop); }T fold_CD(int l, int r, bool loop = false) { return fold_ID(l + 1, r , loop); }T fold_CI(int l, int r, bool loop = false) { return fold_ID(l + 1, r + 1, loop); }};#define OP(op) [&](auto A, auto B) { return op; }#define AP(op) [&](auto & A) { op; }// ---- ----int n, m[30000];int main() {cin >> n;inc(i, n) { cin >> m[i]; m[i]--; }SegmentTree<int> st(n, OP(A + B), 0);int ans = 0;dec(i, n) {ans += st.fold_II(0, m[i]);st.apply(m[i], AP(A++));}cout << ans << endl;return 0;}