제출 #1172759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172759		Minbaev	Construction of Highway (JOI18_construction)	C++20	16 / 100	2094 ms	2400 KiB

construction

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;
using namespace __gnu_pbds;

#define pb 		push_back
#define all(x)	x.begin(),x.end()
#define int 	long long
#define ar 		array

template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}

template<class T> using ste = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;

namespace FAST {
    template<typename T, typename F>
    istream &operator>>(istream &cin, pair<T, F> &p) {
        cin >> p.first >> p.second;
        return cin;
    }

    template<typename T, typename F>
    ostream &operator<<(ostream &cout, pair<T, F> &p) {
        cout << p.first << ' ' << p.second;
        return cout;
    }

    template<typename T>
    istream &operator>>(istream &cin, vector<T> &a) {
    for (T &i: a) cin >> i;
        return cin;
    }

    template<typename T>
    ostream &operator<<(ostream &cout, vector<T> &a) {
        for (T i: a) cout << i << ' ';
        return cout;
    }

    template<typename T>
    istream &operator>>(istream &cin, deque<T> &a) {
        for (T &i: a) cin >> i;
        return cin;
    }

    template<typename T>
    ostream &operator<<(ostream &cout, deque<T> &a) {
        for (T i: a) cout << i << ' ';
        return cout;
    }
}
using namespace FAST;

const int inf = 3e18 + 7;
const int mod = 1e9 + 7;
const int N = 5e5 + 5;
const int md = 998244353;

int binpow(int a, int b, int m){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2,m);
		return (c*c)%m;
	}
	return (binpow(a,b-1,m)*a)%m;
}

int divi(int a, int b, int m){
	return (a*(binpow(b,m-2, m)))%m;
}

int n,m,k,q;

void solve(){
	
	cin >> n;
	vector<int>v(n+1), pr(n+1);
	for(int i = 1;i<=n;i++)cin >> v[i];
	
	for(int i = 2;i<=n;i++){
		int a,b;
		cin >> a >> b;
		int u = a;
		vector<int>vs;
		while(a != 1){
			vs.pb(a);
			a = pr[a];
		}
		vs.pb(1);
		
		ste<int>st;
		reverse(all(vs));
		int res = 0;
		for(auto to:vs){
//			cout << to << " ";
			res += st.size() - st.order_of_key(v[to]+1);
			st.insert(v[to]);
		}
//		cout << "\n";
		for(auto to:vs){
			v[to] = v[b];
		}
		pr[b] = u;
		cout << res << "\n";
	}
	
	
	
	
	
	
	
	
	
	
	
	
}
/*

*/
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

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