結果

問題 No.1371 交換門松列・松
ユーザー t9unkubjt9unkubj
提出日時 2024-10-03 05:22:42
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 617 ms / 4,000 ms
コード長 7,840 bytes
コンパイル時間 3,907 ms
コンパイル使用メモリ 279,340 KB
実行使用メモリ 59,864 KB
最終ジャッジ日時 2024-10-03 05:22:56
合計ジャッジ時間 12,100 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef t9unkubj
#include"template.h"
//#include"template_no_debug.h"
#else
#undef _GLIBCXX_DEBUG
#pragma GCC optimize("O3")
#define dbg(...) 199958
using namespace std;
#include<bits/stdc++.h>
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
using vi=vc<int>;
using vvi=vc<vi>;
using vvvi=vc<vvi>;
using vl=vc<ll>;
using vvl=vc<vl>;
using vvvl=vc<vvl>;
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)
#define drep(i,n) for(ll i=((n)-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a;}
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);
void print(int a) { cout << a; }
void print(ll a) { cout << a; }
void print(string a) { cout << a; }
void print(char a) { cout << a; }
void print(uint a) { cout << a; }
void print(bool a) { cout << a; }
void print(ull a) { cout << a; }
void print(double a) { cout << a; }
void print(ld a){ cout<< a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
void YesNo(bool b){
    cout<<(b?"Yes":"No")<<endl;
}
void Yes(){
    cout<<"Yes"<<endl;
}
void No(){
    cout<<"No"<<endl;
}
template<class T>
int popcount(T n){
    return __builtin_popcountll(n);
}
template<class T>
T sum(vc<T>&a){
    return accumulate(all(a),T(0));
}
template<class T>
T max(vc<T>&a){
    return *max_element(all(a));
}
template<class T>
T min(vc<T>&a){
    return *min_element(all(a));
}
template<class T>
void unique(vc<T>&a){
    a.erase(unique(all(a)),a.end());
}
vvi readgraph(int n,int m,int off = -1){
    vvi g(n);
    rep(i, m){
        int u,v;
        cin>>u>>v;
        u+=off,v+=off;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    return g;
}
vvi readtree(int n,int off=-1){
    return readgraph(n,n-1,off);
}
template<class T>
vc<T> presum(vc<T> &a){
    vc<T> ret(a.size()+1);
    rep(i,a.size())ret[i+1]=ret[i]+a[i];
    return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
    for (auto&v:a)v += b;
    return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
    for (auto&v:a)v-=b;
    return a;
}
template<class T, class F>
vc<T> &operator*=(vc<T>&a,F b){
    for (auto&v:a)v*=b;
    return a;
}
#endif
double pass_time=0;
/*
交換門松列　松
山部分を考える
条件は左右のminより大きいこと
領域機を使えば良い
*/
//抽象化しすぎるとつらいからまあこれくらいがちょうどいいかな
//特になんも深く考えてない
template<class T,class F>
struct range_tree{
	int n;
    struct S{
        vc<T>seq;
        void build(const vc<T>&c){
            seq=c;
        }
        int size(){
            return seq.size();
        }
    };
	vector<S>node;
	range_tree(int N){
		int log=0;
		while((1<<log)<=N)log++;
		n=1<<log;
		node=vector<S>(n*2);
	}
	S merge(S&a,S&b){
        S c;
		int l=0,r=0;
		while(l<(int)a.size()||r<(int)b.size()){
			if(l==(int)a.size())c.seq.push_back(b.seq[r++]);
			else if(r==(int)b.size())c.seq.push_back(a.seq[l++]);
			else if(a.seq[l]<=b.seq[r])c.seq.push_back(a.seq[l++]);
			else c.seq.push_back(b.seq[r++]);
		}
        c.build(c.seq);
		return c;
	}
	void set(int i,int t){
        S c;
        c.build(vc<T>{t});
		node[i+n]=c;
	}
	void build(){
		for(int i=node.size();i;i--){
			int a=i*2,b=i*2+1;
			if(b<(int)node.size()){
				node[i]=merge(node[a],node[b]);
			}
		}	
	}
	F op(ll l,S&c){
        return c.seq.ed-upper_bound(all(c.seq),l);
	}
	F prod(int l,int r,ll x){
		l+=n,r+=n;

		F res=0;

		while(l<r){
			if(l&1)res+=op(x,node[l++]);
			if(r&1)res+=op(x,node[--r]);
			l>>=1,r>>=1;
		}
		return res;
	}	
};
template<class T,class F>
struct range_tree2{
	int n;
    struct S{
        vc<T>seq;
        void build(const vc<T>&c){
            seq=c;
        }
        int size(){
            return seq.size();
        }
    };
	vector<S>node;
	range_tree2(int N){
		int log=0;
		while((1<<log)<=N)log++;
		n=1<<log;
		node=vector<S>(n*2);
	}
	S merge(S&a,S&b){
        S c;
		int l=0,r=0;
		while(l<(int)a.size()||r<(int)b.size()){
			if(l==(int)a.size())c.seq.push_back(b.seq[r++]);
			else if(r==(int)b.size())c.seq.push_back(a.seq[l++]);
			else if(a.seq[l]<=b.seq[r])c.seq.push_back(a.seq[l++]);
			else c.seq.push_back(b.seq[r++]);
		}
        c.build(c.seq);
		return c;
	}
	void set(int i,int t){
        S c;
        c.build(vc<T>{t});
		node[i+n]=c;
	}
	void build(){
		for(int i=node.size();i;i--){
			int a=i*2,b=i*2+1;
			if(b<(int)node.size()){
				node[i]=merge(node[a],node[b]);
			}
		}	
	}
	F op(ll l,S&c){
        return lower_bound(all(c.seq),l)-c.seq.bg;
	}
	F prod(int l,int r,ll x){
		l+=n,r+=n;

		F res=0;

		while(l<r){
			if(l&1)res+=op(x,node[l++]);
			if(r&1)res+=op(x,node[--r]);
			l>>=1,r>>=1;
		}
		return res;
	}	
};
void solve(){
    INT(n);
    VC(int,a,n);
    a-=1;
    //minがk以上なのは何個?
    range_tree<int,int> g1(n);
    range_tree2<int,int>g2(n);
    auto mi=[&](int i){
        int res=1e9;
        if(i)chmin(res,a[i-1]);
        if(i<n-1)chmin(res,a[i+1]);
        return res;
    };
    auto ma=[&](int i){
        int res=-1;
        if(i)chmax(res,a[i-1]);
        if(i<n-1)chmax(res,a[i+1]);
        return res;
    };
    vi t(n);
    rep(i,n){
        if(i)t[i]=a[i]>a[i-1];
        else t[i]=a[i]>a[i+1];
        if(t[i])g2.set(a[i],ma(i));
        else g1.set(a[i],mi(i));
    }   
    g1.build();
    g2.build();

    //Tなら山
    ll ans=0;
    rep(i,n){
        if(t[i]){
            //
            ans+=g1.prod(ma(i),n,a[i]);
            ans+=g2.prod(ma(i),n,a[i]);
        }else{
        dbg(ans);
            ans+=g1.prod(0,mi(i),a[i]);
            ans+=g2.prod(0,mi(i),a[i]);
        }
    }
    PRT((ans-n)/2);
}   
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    pass_time=clock();
    int t=1;
    //cin>>t;
    while(t--)solve();
    pass_time=clock()-pass_time;
    dbg(pass_time/CLOCKS_PER_SEC);
}
0