oj.uz

Submission #759217

# Submission time Handle Problem Language Result Execution time Memory
759217 2023-06-15T21:19:18 Z shadow_sami Construction of Highway (JOI18_construction) C++17
100 / 100
 164 ms 32696 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll hld[mx];
ll dep[mx];
ll a[mx];
vi adj[mx];
ll sz[mx];
ll to[mx];
ll parent[mx];
ll sr,de;
vector<pi> lis[mx];

typedef struct Binary_indexed_tree{
	ll arr[2*mx];
	ll range = 2*mx;
	ll sm = 0;
	// void init(ll k){
	// 	range = log2(k);
	// 	range = 1<<(k+1);;
	// 	fip(0,range)
	// 		arr[i] = 0;
	// 	return;
	// }
	ll get(ll l){
		sm = 0;
		for(ll i = l ; i > 0; i -= (i & -i))
			sm += arr[i];
		return sm;
	}
	void update(ll l,ll val,ll k){
		for(ll i = l ; i < k; i += (i & -i))
			arr[i] += val;
		return ;
	}
}BIT;

BIT bit;

void hld_dfs(ll u,ll par,ll hd){
	hld[u] = hd;
	if(to[u] != -1)
			hld_dfs(to[u],u,hd);
	fx(adj[u]){
		if(x==par || x ==to[u])
			continue;
		hld_dfs(x,u,x);
	}
	return;
}

void dfs(ll u,ll par){
	parent[u] = par;
	sz[u] = 1;
	ll tc=-1,tx=-1;
	fx(adj[u])
		if(x!=par){
			dep[x] = dep[u] + 1;
			dfs(x,u);
			sz[u] += sz[x];
			if(sz[x] > tc){
				tc = sz[x];
				tx = x;
			}
		}
	to[u] = tx;
	return;
}

void init(ll k){
	fip(0,n+2){
		dep[i] = 0;
		to[i] = -1;
		hld[i] = -1;
		sz[i] = 0;
	}
	return ;
}

ll aa,bb,range,let;
vector<pi> na;
vi vv;
vector<pi> v2;

ll calc(ll u,ll v){
	na.clear();
	v2.clear();
	u = v;
	while(u != -1){
		aa = u;
		let = 0;
		bb = hld[aa];
		range = dep[aa] - dep[bb] + 1;
		vector<pi> &ss = lis[bb];
		v2.clear();
		while(ss.size() && ss.back().ss <= range){
			v2.push_back({ss.back().ff,ss.back().ss-let});
			let = ss.back().ss;
			ss.pop_back();
		}
		if(ss.size())
			v2.push_back({ss.back().ff,range - let});
		ss.push_back({a[v],range});
		u = parent[bb];
		fin((int)v2.size()-1,0)
			na.push_back(v2[i]);
	}
	res = 0;
	m = na.size();
	vv.clear();
	fx(na)
		vv.push_back(x.ff);
	srt(vv);
	// debug(na);
	fip(0,m)
		na[i].ff = (lower_bound(vv.begin(),vv.end(),na[i].ff) - vv.begin()) + 1; 
	fip(0,2*m)
		bit.arr[i] = 0;
	fx(na){
		res += (x.ss*bit.get(x.ff-1));
		bit.update(x.ff,x.ss,2*m);
	}
	return res;
}

vector<pi> ve;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n;
        init(n);
        fip(1,n+1)	
        	cin>>a[i];
        fip(1,n){
        	cin>>sr>>de;
        	ve.push_back({sr,de});
        	adj[sr].push_back(de);
        	adj[de].push_back(sr);
        }
        dfs(1,-1);
        hld_dfs(1,1,1);
        lis[1].push_back({a[1],1});
        fx(ve){
        	// fip(1,n+1){
        	// 	debug(lis[i]);
        	// }
        	cout<<calc(x.ff,x.ss)<<nli;
        }
        
    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9732 KB Output is correct
3 Correct 5 ms 9740 KB Output is correct
4 Correct 5 ms 9740 KB Output is correct
5 Correct 5 ms 9812 KB Output is correct
6 Correct 4 ms 9812 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 5 ms 9744 KB Output is correct
9 Correct 4 ms 9812 KB Output is correct
10 Correct 4 ms 9772 KB Output is correct
11 Correct 7 ms 9940 KB Output is correct
12 Correct 5 ms 9872 KB Output is correct
13 Correct 5 ms 9812 KB Output is correct
14 Correct 5 ms 9812 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 5 ms 9772 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct
18 Correct 5 ms 9788 KB Output is correct
19 Correct 5 ms 9812 KB Output is correct
20 Correct 5 ms 9812 KB Output is correct
21 Correct 5 ms 9812 KB Output is correct
22 Correct 5 ms 9740 KB Output is correct
23 Correct 5 ms 9812 KB Output is correct
24 Correct 5 ms 9812 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 5 ms 9744 KB Output is correct
27 Correct 4 ms 9812 KB Output is correct
28 Correct 5 ms 9784 KB Output is correct
29 Correct 4 ms 9732 KB Output is correct
30 Correct 5 ms 9812 KB Output is correct
31 Correct 5 ms 9812 KB Output is correct
32 Correct 5 ms 9792 KB Output is correct
33 Correct 5 ms 9812 KB Output is correct
34 Correct 4 ms 9812 KB Output is correct
35 Correct 5 ms 9736 KB Output is correct
36 Correct 5 ms 9736 KB Output is correct
37 Correct 5 ms 9812 KB Output is correct
38 Correct 5 ms 9812 KB Output is correct
39 Correct 5 ms 9812 KB Output is correct
40 Correct 4 ms 9820 KB Output is correct
41 Correct 5 ms 9812 KB Output is correct
42 Correct 5 ms 9812 KB Output is correct
43 Correct 6 ms 9812 KB Output is correct
44 Correct 5 ms 9812 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9732 KB Output is correct
3 Correct 5 ms 9740 KB Output is correct
4 Correct 5 ms 9740 KB Output is correct
5 Correct 5 ms 9812 KB Output is correct
6 Correct 4 ms 9812 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 5 ms 9744 KB Output is correct
9 Correct 4 ms 9812 KB Output is correct
10 Correct 4 ms 9772 KB Output is correct
11 Correct 7 ms 9940 KB Output is correct
12 Correct 5 ms 9872 KB Output is correct
13 Correct 5 ms 9812 KB Output is correct
14 Correct 5 ms 9812 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 5 ms 9772 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct
18 Correct 5 ms 9788 KB Output is correct
19 Correct 5 ms 9812 KB Output is correct
20 Correct 5 ms 9812 KB Output is correct
21 Correct 5 ms 9812 KB Output is correct
22 Correct 5 ms 9740 KB Output is correct
23 Correct 5 ms 9812 KB Output is correct
24 Correct 5 ms 9812 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 5 ms 9744 KB Output is correct
27 Correct 4 ms 9812 KB Output is correct
28 Correct 5 ms 9784 KB Output is correct
29 Correct 4 ms 9732 KB Output is correct
30 Correct 5 ms 9812 KB Output is correct
31 Correct 5 ms 9812 KB Output is correct
32 Correct 5 ms 9792 KB Output is correct
33 Correct 5 ms 9812 KB Output is correct
34 Correct 4 ms 9812 KB Output is correct
35 Correct 5 ms 9736 KB Output is correct
36 Correct 5 ms 9736 KB Output is correct
37 Correct 5 ms 9812 KB Output is correct
38 Correct 5 ms 9812 KB Output is correct
39 Correct 5 ms 9812 KB Output is correct
40 Correct 4 ms 9820 KB Output is correct
41 Correct 5 ms 9812 KB Output is correct
42 Correct 5 ms 9812 KB Output is correct
43 Correct 6 ms 9812 KB Output is correct
44 Correct 5 ms 9812 KB Output is correct
45 Correct 5 ms 9872 KB Output is correct
46 Correct 10 ms 10324 KB Output is correct
47 Correct 8 ms 10264 KB Output is correct
48 Correct 8 ms 10260 KB Output is correct
49 Correct 6 ms 10520 KB Output is correct
50 Correct 6 ms 10596 KB Output is correct
51 Correct 6 ms 10580 KB Output is correct
52 Correct 7 ms 10580 KB Output is correct
53 Correct 7 ms 10576 KB Output is correct
54 Correct 7 ms 10580 KB Output is correct
55 Correct 7 ms 10644 KB Output is correct
56 Correct 7 ms 10452 KB Output is correct
57 Correct 8 ms 10264 KB Output is correct
58 Correct 11 ms 10252 KB Output is correct
59 Correct 9 ms 10232 KB Output is correct
60 Correct 9 ms 10324 KB Output is correct
61 Correct 7 ms 10452 KB Output is correct
62 Correct 7 ms 10508 KB Output is correct
63 Correct 6 ms 10452 KB Output is correct
64 Correct 7 ms 10220 KB Output is correct
65 Correct 8 ms 10288 KB Output is correct
66 Correct 7 ms 10196 KB Output is correct
67 Correct 8 ms 10260 KB Output is correct
68 Correct 7 ms 10452 KB Output is correct
69 Correct 7 ms 10580 KB Output is correct
70 Correct 7 ms 10644 KB Output is correct
71 Correct 8 ms 10452 KB Output is correct
72 Correct 8 ms 10260 KB Output is correct
73 Correct 9 ms 10256 KB Output is correct
74 Correct 7 ms 10452 KB Output is correct
75 Correct 6 ms 10384 KB Output is correct
76 Correct 6 ms 10344 KB Output is correct
77 Correct 8 ms 10316 KB Output is correct
78 Correct 7 ms 10388 KB Output is correct
79 Correct 6 ms 10260 KB Output is correct
80 Correct 7 ms 10240 KB Output is correct
81 Correct 7 ms 10324 KB Output is correct
82 Correct 7 ms 10256 KB Output is correct
83 Correct 9 ms 10308 KB Output is correct
84 Correct 6 ms 10324 KB Output is correct
85 Correct 6 ms 10324 KB Output is correct
86 Correct 7 ms 10260 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9732 KB Output is correct
3 Correct 5 ms 9740 KB Output is correct
4 Correct 5 ms 9740 KB Output is correct
5 Correct 5 ms 9812 KB Output is correct
6 Correct 4 ms 9812 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 5 ms 9744 KB Output is correct
9 Correct 4 ms 9812 KB Output is correct
10 Correct 4 ms 9772 KB Output is correct
11 Correct 7 ms 9940 KB Output is correct
12 Correct 5 ms 9872 KB Output is correct
13 Correct 5 ms 9812 KB Output is correct
14 Correct 5 ms 9812 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 5 ms 9772 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct
18 Correct 5 ms 9788 KB Output is correct
19 Correct 5 ms 9812 KB Output is correct
20 Correct 5 ms 9812 KB Output is correct
21 Correct 5 ms 9812 KB Output is correct
22 Correct 5 ms 9740 KB Output is correct
23 Correct 5 ms 9812 KB Output is correct
24 Correct 5 ms 9812 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 5 ms 9744 KB Output is correct
27 Correct 4 ms 9812 KB Output is correct
28 Correct 5 ms 9784 KB Output is correct
29 Correct 4 ms 9732 KB Output is correct
30 Correct 5 ms 9812 KB Output is correct
31 Correct 5 ms 9812 KB Output is correct
32 Correct 5 ms 9792 KB Output is correct
33 Correct 5 ms 9812 KB Output is correct
34 Correct 4 ms 9812 KB Output is correct
35 Correct 5 ms 9736 KB Output is correct
36 Correct 5 ms 9736 KB Output is correct
37 Correct 5 ms 9812 KB Output is correct
38 Correct 5 ms 9812 KB Output is correct
39 Correct 5 ms 9812 KB Output is correct
40 Correct 4 ms 9820 KB Output is correct
41 Correct 5 ms 9812 KB Output is correct
42 Correct 5 ms 9812 KB Output is correct
43 Correct 6 ms 9812 KB Output is correct
44 Correct 5 ms 9812 KB Output is correct
45 Correct 5 ms 9872 KB Output is correct
46 Correct 10 ms 10324 KB Output is correct
47 Correct 8 ms 10264 KB Output is correct
48 Correct 8 ms 10260 KB Output is correct
49 Correct 6 ms 10520 KB Output is correct
50 Correct 6 ms 10596 KB Output is correct
51 Correct 6 ms 10580 KB Output is correct
52 Correct 7 ms 10580 KB Output is correct
53 Correct 7 ms 10576 KB Output is correct
54 Correct 7 ms 10580 KB Output is correct
55 Correct 7 ms 10644 KB Output is correct
56 Correct 7 ms 10452 KB Output is correct
57 Correct 8 ms 10264 KB Output is correct
58 Correct 11 ms 10252 KB Output is correct
59 Correct 9 ms 10232 KB Output is correct
60 Correct 9 ms 10324 KB Output is correct
61 Correct 7 ms 10452 KB Output is correct
62 Correct 7 ms 10508 KB Output is correct
63 Correct 6 ms 10452 KB Output is correct
64 Correct 7 ms 10220 KB Output is correct
65 Correct 8 ms 10288 KB Output is correct
66 Correct 7 ms 10196 KB Output is correct
67 Correct 8 ms 10260 KB Output is correct
68 Correct 7 ms 10452 KB Output is correct
69 Correct 7 ms 10580 KB Output is correct
70 Correct 7 ms 10644 KB Output is correct
71 Correct 8 ms 10452 KB Output is correct
72 Correct 8 ms 10260 KB Output is correct
73 Correct 9 ms 10256 KB Output is correct
74 Correct 7 ms 10452 KB Output is correct
75 Correct 6 ms 10384 KB Output is correct
76 Correct 6 ms 10344 KB Output is correct
77 Correct 8 ms 10316 KB Output is correct
78 Correct 7 ms 10388 KB Output is correct
79 Correct 6 ms 10260 KB Output is correct
80 Correct 7 ms 10240 KB Output is correct
81 Correct 7 ms 10324 KB Output is correct
82 Correct 7 ms 10256 KB Output is correct
83 Correct 9 ms 10308 KB Output is correct
84 Correct 6 ms 10324 KB Output is correct
85 Correct 6 ms 10324 KB Output is correct
86 Correct 7 ms 10260 KB Output is correct
87 Correct 13 ms 11148 KB Output is correct
88 Correct 32 ms 14028 KB Output is correct
89 Correct 112 ms 24068 KB Output is correct
90 Correct 118 ms 24012 KB Output is correct
91 Correct 118 ms 24184 KB Output is correct
92 Correct 60 ms 30740 KB Output is correct
93 Correct 72 ms 30824 KB Output is correct
94 Correct 63 ms 30776 KB Output is correct
95 Correct 70 ms 32184 KB Output is correct
96 Correct 97 ms 32624 KB Output is correct
97 Correct 82 ms 32696 KB Output is correct
98 Correct 78 ms 32580 KB Output is correct
99 Correct 67 ms 28572 KB Output is correct
100 Correct 102 ms 23496 KB Output is correct
101 Correct 164 ms 23720 KB Output is correct
102 Correct 148 ms 23780 KB Output is correct
103 Correct 146 ms 23760 KB Output is correct
104 Correct 73 ms 28564 KB Output is correct
105 Correct 75 ms 28548 KB Output is correct
106 Correct 69 ms 28604 KB Output is correct
107 Correct 99 ms 23168 KB Output is correct
108 Correct 108 ms 23304 KB Output is correct
109 Correct 119 ms 23608 KB Output is correct
110 Correct 55 ms 30160 KB Output is correct
111 Correct 73 ms 32244 KB Output is correct
112 Correct 72 ms 32056 KB Output is correct
113 Correct 61 ms 28024 KB Output is correct
114 Correct 115 ms 23480 KB Output is correct
115 Correct 147 ms 23156 KB Output is correct
116 Correct 65 ms 27932 KB Output is correct
117 Correct 64 ms 25912 KB Output is correct
118 Correct 69 ms 25076 KB Output is correct
119 Correct 63 ms 24724 KB Output is correct
120 Correct 64 ms 25496 KB Output is correct
121 Correct 70 ms 24768 KB Output is correct
122 Correct 70 ms 24504 KB Output is correct
123 Correct 77 ms 26020 KB Output is correct
124 Correct 71 ms 25208 KB Output is correct
125 Correct 87 ms 24824 KB Output is correct
126 Correct 67 ms 25644 KB Output is correct
127 Correct 67 ms 24824 KB Output is correct
128 Correct 69 ms 24476 KB Output is correct