Submission #1176288

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176288		ByeWorld	Construction of Highway (JOI18_construction)	C++20	16 / 100	2092 ms	4028 KiB

construction

#include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 1e6+10;
const int MAXA = 2e5;
const int INF = 1e9+100;
const int SQRT = 500;
const int LOG = 24;
const int MOD = 1e9+7;
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(int &a, int b){ a = max(a, b); }
int sum(int a, int b){ a %= MOD; b %= MOD; return (a+b)%MOD; }
int sub(int a, int b){ a %= MOD; b %= MOD; return (a+MOD-b)%MOD; }
void chsum(int &a, int b){ a %= MOD; b %= MOD; a = (a+b)%MOD; }
void chsub(int &a, int b){ a %= MOD; b %= MOD; a = (a+MOD-b)%MOD; }
int mul(int a, int b){ a %= MOD; b %= MOD; return a*b%MOD;}
void chmul(int &a, int b){ a = a*b%MOD; }
int expo(int a, int b){
	if(b==0) return 1;
	int te = expo(a, b/2); te = mul(te, te);
	return (b%2 ? mul(te, a) : te);
}
int n, c[MAXN], par[MAXN];
struct seg {
	int st[2*MAXN];
	int que(int x){
		int te = 0;
		for(; x>=1; x-=(x&(-x))) te+=st[x];
		return te;
	}
	void upd(int x, int p){
		for(; x<=2*MAXN-20; x+=(x&(-x)))
			st[x] += p; 
	}
} A;
vector<int> vec;
void dfs(int nw){
	vec.pb(c[nw]);
	if(nw==1) return;
	dfs(par[nw]);
}
void bd(int nw, int val){
	c[nw] = val;
	if(nw==1) return;
	bd(par[nw], val);
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n; vector<int> cc; cc.pb(-1);
	for(int i=1; i<=n; i++){
		cin>>c[i]; cc.pb(c[i]);
	}
	sort(cc.begin(), cc.end()); 
	cc.resize(unique(cc.begin(), cc.end()) - cc.begin());
	for(int i=1; i<=n; i++)
		c[i] = lower_bound(cc.begin(), cc.end(), c[i]) - cc.begin();
	
	for(int i=1; i<=n-1; i++){
		int x,y;cin>>x>>y;
		vec.clear();
		dfs(x); 
		int ans = 0;
		for(auto in : vec){
			ans += A.que(in-1); A.upd(in, 1);
		}
		for(auto in : vec) A.upd(in, -1);
		cout << ans << '\n';
		par[y] = x;
		bd(x, c[y]);
	}
}

• Subtask 1: 7 / 7
• Subtask 2: 9 / 9
• Subtask 3: 0 / 84