結果

問題 No.1371 交換門松列・松
ユーザー yuto1115
提出日時 2021-01-29 22:34:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 54 ms / 4,000 ms
コード長 4,790 bytes
コンパイル時間 2,260 ms
コンパイル使用メモリ 204,256 KB
最終ジャッジ日時 2025-01-18 09:32:29
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

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

//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popcount(x) __builtin_popcount(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using LP = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<P>;
using vvp = vector<vector<P>>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; 
    }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
template<class... T> void fin(const T&... a) { print(a...); exit(0); }
const string yes[] = {"no","yes"};
const string Yes[] = {"No","Yes"};
const string YES[] = {"NO","YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on
template<typename T>
class BIT {
    int n;
    vector<T> val;
public:
    BIT(int n) : n(n), val(n + 1, 0) {}
    
    void add(int i, T x = 1) {
        i++;
        while (i <= n) {
            val[i] += x;
            i += i & -i;
        }
    }
    
    T sum(int i) {
        T ret = 0;
        i++;
        while (i > 0) {
            ret += val[i];
            i -= i & -i;
        }
        return ret;
    }
    
    // [l,r)
    T sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    INT(n);
    vi a(n);
    cin >> a;
    rep(i, n) a[i]--;
    if (a[0] > a[1]) {
        rep(i, n) a[i] = n - 1 - a[i];
    }
    ll ans = 0;
    {
        vi sum(n + 1);
        rep(i, 0, n, 2) sum[a[i] + 1]++;
        rep(i, n) sum[i + 1] += sum[i];
        rep(i, 0, n, 2) {
            int mn = inf;
            if (i > 0) chmin(mn, a[i - 1]);
            if (i < n - 1) chmin(mn, a[i + 1]);
            ans += sum[mn] - sum[a[i] + 1];
        }
    }
    {
        vi sum(n + 1);
        rep(i, 1, n, 2) sum[a[i] + 1]++;
        rep(i, n) sum[i + 1] += sum[i];
        rep(i, 1, n, 2) {
            int mx = -1;
            if (i > 0) chmax(mx, a[i - 1]);
            if (i < n - 1) chmax(mx, a[i + 1]);
            ans += sum[a[i]] - sum[mx + 1];
        }
    }
    {
        BIT<int> bt(n);
        vp ls;
        rep(i, 0, n, 2) {
            int mn = inf;
            if (i > 0) chmin(mn, a[i - 1]);
            if (i < n - 1) chmin(mn, a[i + 1]);
            ls.eb(mn, a[i]);
        }
        sort(all(ls));
        auto it = ls.begin();
        vp add;
        rep(i, 1, n, 2) {
            int mx = -1;
            if (i > 0) chmax(mx, a[i - 1]);
            if (i < n - 1) chmax(mx, a[i + 1]);
            add.eb(a[i], mx);
        }
        sort(all(add));
        for (auto[f, s] : add) {
            while (it != ls.end() and it->first <= f) {
                ans += bt.sum(it->second - 1);
                it++;
            }
            bt.add(s);
        }
    }
    print(ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0