Submission #319741

#	Time	Username	Problem	Language	Result	Execution time	Memory
319741		soroush	Pilot (NOI19_pilot)	C++14	100 / 100	936 ms	87516 KiB

pilot

/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma,tune=native")
//*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int  ,int > pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn  = 1e6+100;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , t;
int a[maxn];
vector < int > pos[maxn];
ll ans[maxn];
ll sum;
ll sz[maxn];
int par[maxn];

ll C(ll x){
	return(x * (x - 1) / 2);
}

int getpar(int v){
	return((v == par[v])?v : par[v] = getpar(par[v]));
}

void merge(int u , int v){
	u = getpar(u) , v = getpar(v);
	if(u == v)return;
	if(sz[u] > sz[v])
		swap(u , v);
	sum -= C(sz[u] + 1);
	sum -= C(sz[v] + 1);
	sz[v] += sz[u];
	par[u] = v;
	sum +=C(sz[v] + 1);
}

void add(int x){
	for(auto i : pos[x]	)
		par[i] = i , sz[i] = 1 , sum += C(sz[i] + 1);
	for(auto i : pos[x]){
		if(i > 1 and a[i - 1] <= x){
			merge(i , i - 1);
		}
		if(i < n and a[i + 1] <= x){
			merge(i , i + 1);
		}
	}
}

int32_t main(){
    migmig;
    cin >> n >> t;
	for(int i = 1 ; i <= n ; i ++)
		cin >> a[i] , pos[a[i]].pb(i);
	for(int i = 0 ; i < maxn ; i ++)
		add(i), ans[i] = sum;
	while(t -- ){
		int x;
		cin >> x;
		cout << ans[x] << endl;
	}
    return(0);
}

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11