oj.uz

Submission #219751

# Submission time Handle Problem Language Result Execution time Memory
219751 2020-04-06T09:04:40 Z dorijanlendvaj Construction of Highway (JOI18_construction) C++14
100 / 100
 926 ms 37008 KB 
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=100010,M=1<<17;
int n,li[N],par[N],st[N],cha[N],ss[N],cch,ind[N],cuin,u[N],v[N];
bool bio[N];
vi ch[N];
set<pair<pii,int>> s[N];
int seg[M*2+10];

void dfs1(int i)
{
	bio[i]=1;
	ss[i]=1;
	for (auto a: ch[i]) if (!bio[a]) par[a]=i,dfs1(a),ss[i]+=ss[a];
}

void dfs2(int i)
{
	bio[i]=1;
	cha[i]=cch;
	ind[i]=cuin++;
	s[cch].insert({{ind[i],1},li[i]});
	vector<pii> v;
	for (auto a: ch[i]) if (!bio[a]) v.eb(ss[a],a);
	sort(all(v));
	reverse(all(v));
	if (v.size())
	{
		dfs2(v[0].y);
	}
	//cout<<"node "<<i<<' '<<li[i]<<' '<<cha[i]<<en;
	//for (auto a: v) cout<<a.x<<' '<<a.y<<en;
	for (int j=1;j<v.size();++j)
	{
		++cch;
		cuin=0;
		st[cch]=v[j].y;
		dfs2(v[j].y);
	}
}

void upd(int i,int x)
{
	for (i+=M;i;i/=2) seg[i]+=x;
}

int ge(int l,int r,int lo=0,int hi=M,int i=1)
{
	if (lo>=l && hi<=r) return seg[i];
	if (lo>=r || hi<=l) return 0;
	int mid=(lo+hi)/2;
	return ge(l,r,lo,mid,i*2)+ge(l,r,mid,hi,i*2+1);
}

void comp()
{
	set<int> s;
	for (int i=1;i<=n;++i) s.insert(li[i]);
	vi v(all(s));
	for (int i=1;i<=n;++i) li[i]=lower_bound(all(v),li[i])-v.begin();
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n;
	const bool DBG=0;
	for (int i=1;i<=n;++i) cin>>li[i];
	comp();
	for (int i=1;i<n;++i)
	{
		int a,b;
		cin>>a>>b;
		ch[a].pb(b);
		ch[b].pb(a);
		u[i]=a;
		v[i]=b;
	}
	dfs1(1);
	memset(bio,0,sizeof(bio));
	dfs2(1);
	st[0]=1;
	if (DBG) for (int i=0;i<=cch;++i)
	{
		cout<<"chain "<<i<<":\n";
		for (auto a: s[i]) cout<<a.x.x<<' '<<a.x.y<<' '<<a.y<<en;
		cout<<"start: "<<st[i]<<en;
	}
	for (int i=1;i<n;++i)
	{
		int x=u[i],y=v[i];
		auto it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
		--it;
		auto a=*it;
		int sz=ind[x]-a.x.x+1;
		vector<pii> ve;
		ve.eb(a.y,-sz);
		if (DBG) cout<<x<<' '<<a.y<<' '<<sz<<en;
		upd(a.y,sz);
		ll ans=0;
		while (it!=s[cha[x]].begin())
		{
			--it;
			if (DBG) cout<<x<<' '<<(it->x.x)<<' '<<(it->x.y)<<' '<<(it->y)<<en;
			ans+=ge(0,it->y)*it->x.y;
			ve.eb(it->y,-it->x.y);
			upd(it->y,it->x.y);
		}
		while (cha[x])
		{
			x=par[st[cha[x]]];
			it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
			--it;
			a=*it;
			sz=ind[x]-a.x.x+1;
			ve.eb(a.y,-sz);
			if (DBG) cout<<x<<' '<<a.y<<' '<<sz<<en;
			ans+=ge(0,a.y)*sz;
			upd(a.y,sz);
			while (it!=s[cha[x]].begin())
			{
				--it;
				if (DBG) cout<<x<<' '<<(it->x.x)<<' '<<(it->x.y)<<' '<<(it->y)<<en;
				ans+=ge(0,it->y)*it->x.y;
				ve.eb(it->y,-it->x.y);
				upd(it->y,it->x.y);
			}
		}
		for (auto z: ve) upd(z.x,z.y);
		cout<<ans<<en;
		x=u[i],y=v[i];
		it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
		--it;
		a=*it;
		s[cha[x]].erase(a);
		sz=ind[x]-a.x.x+1;
		if (a.x.y>sz) s[cha[x]].insert({{ind[x]+1,a.x.y-sz},a.y});
		it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
		while (it!=s[cha[x]].begin())
		{
			--it;
			sz+=it->x.y;
			s[cha[x]].erase(it);
			it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
		}
		s[cha[x]].insert({{0,sz},li[y]});
		while (cha[x])
		{
			x=par[st[cha[x]]];
			it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
			--it;
			a=*it;
			s[cha[x]].erase(a);
			sz=ind[x]-a.x.x+1;
			if (a.x.y>sz) s[cha[x]].insert({{ind[x]+1,a.x.y-sz},a.y});
			it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
			if (DBG) cout<<"MOD "<<x<<' '<<a.x.x<<' '<<a.x.y<<' '<<a.y<<en;
			while (it!=s[cha[x]].begin())
			{
				--it;
				sz+=it->x.y;
				s[cha[x]].erase(it);
				it=s[cha[x]].upper_bound({{ind[x],MOD},MOD});
			}
			s[cha[x]].insert({{0,sz},li[y]});
		}
		if (DBG)
		{
			cout<<"new s[0]:"<<en;
			for (auto a: s[0]) cout<<a.x.x<<' '<<a.x.y<<' '<<a.y<<en;
			cout<<en;
		}
	}
}

Compilation message

construction.cpp: In function 'void dfs2(int)':
construction.cpp:216:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int j=1;j<v.size();++j)
               ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7544 KB Output is correct
2 Correct 8 ms 7552 KB Output is correct
3 Correct 8 ms 7552 KB Output is correct
4 Correct 9 ms 7552 KB Output is correct
5 Correct 9 ms 7680 KB Output is correct
6 Correct 9 ms 7680 KB Output is correct
7 Correct 9 ms 7680 KB Output is correct
8 Correct 9 ms 7680 KB Output is correct
9 Correct 9 ms 7680 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 9 ms 7720 KB Output is correct
12 Correct 9 ms 7680 KB Output is correct
13 Correct 10 ms 7680 KB Output is correct
14 Correct 9 ms 7680 KB Output is correct
15 Correct 10 ms 7680 KB Output is correct
16 Correct 10 ms 7680 KB Output is correct
17 Correct 10 ms 7680 KB Output is correct
18 Correct 11 ms 7680 KB Output is correct
19 Correct 9 ms 7680 KB Output is correct
20 Correct 9 ms 7680 KB Output is correct
21 Correct 10 ms 7680 KB Output is correct
22 Correct 9 ms 7680 KB Output is correct
23 Correct 9 ms 7680 KB Output is correct
24 Correct 9 ms 7680 KB Output is correct
25 Correct 9 ms 7680 KB Output is correct
26 Correct 9 ms 7680 KB Output is correct
27 Correct 9 ms 7680 KB Output is correct
28 Correct 9 ms 7680 KB Output is correct
29 Correct 9 ms 7680 KB Output is correct
30 Correct 10 ms 7808 KB Output is correct
31 Correct 10 ms 7680 KB Output is correct
32 Correct 9 ms 7680 KB Output is correct
33 Correct 9 ms 7680 KB Output is correct
34 Correct 9 ms 7680 KB Output is correct
35 Correct 10 ms 7680 KB Output is correct
36 Correct 9 ms 7680 KB Output is correct
37 Correct 9 ms 7680 KB Output is correct
38 Correct 9 ms 7680 KB Output is correct
39 Correct 9 ms 7680 KB Output is correct
40 Correct 9 ms 7680 KB Output is correct
41 Correct 9 ms 7680 KB Output is correct
42 Correct 9 ms 7680 KB Output is correct
43 Correct 9 ms 7680 KB Output is correct
44 Correct 9 ms 7680 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7544 KB Output is correct
2 Correct 8 ms 7552 KB Output is correct
3 Correct 8 ms 7552 KB Output is correct
4 Correct 9 ms 7552 KB Output is correct
5 Correct 9 ms 7680 KB Output is correct
6 Correct 9 ms 7680 KB Output is correct
7 Correct 9 ms 7680 KB Output is correct
8 Correct 9 ms 7680 KB Output is correct
9 Correct 9 ms 7680 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 9 ms 7720 KB Output is correct
12 Correct 9 ms 7680 KB Output is correct
13 Correct 10 ms 7680 KB Output is correct
14 Correct 9 ms 7680 KB Output is correct
15 Correct 10 ms 7680 KB Output is correct
16 Correct 10 ms 7680 KB Output is correct
17 Correct 10 ms 7680 KB Output is correct
18 Correct 11 ms 7680 KB Output is correct
19 Correct 9 ms 7680 KB Output is correct
20 Correct 9 ms 7680 KB Output is correct
21 Correct 10 ms 7680 KB Output is correct
22 Correct 9 ms 7680 KB Output is correct
23 Correct 9 ms 7680 KB Output is correct
24 Correct 9 ms 7680 KB Output is correct
25 Correct 9 ms 7680 KB Output is correct
26 Correct 9 ms 7680 KB Output is correct
27 Correct 9 ms 7680 KB Output is correct
28 Correct 9 ms 7680 KB Output is correct
29 Correct 9 ms 7680 KB Output is correct
30 Correct 10 ms 7808 KB Output is correct
31 Correct 10 ms 7680 KB Output is correct
32 Correct 9 ms 7680 KB Output is correct
33 Correct 9 ms 7680 KB Output is correct
34 Correct 9 ms 7680 KB Output is correct
35 Correct 10 ms 7680 KB Output is correct
36 Correct 9 ms 7680 KB Output is correct
37 Correct 9 ms 7680 KB Output is correct
38 Correct 9 ms 7680 KB Output is correct
39 Correct 9 ms 7680 KB Output is correct
40 Correct 9 ms 7680 KB Output is correct
41 Correct 9 ms 7680 KB Output is correct
42 Correct 9 ms 7680 KB Output is correct
43 Correct 9 ms 7680 KB Output is correct
44 Correct 9 ms 7680 KB Output is correct
45 Correct 13 ms 7680 KB Output is correct
46 Correct 21 ms 8192 KB Output is correct
47 Correct 21 ms 8192 KB Output is correct
48 Correct 21 ms 8192 KB Output is correct
49 Correct 16 ms 8704 KB Output is correct
50 Correct 15 ms 8704 KB Output is correct
51 Correct 15 ms 8704 KB Output is correct
52 Correct 15 ms 8448 KB Output is correct
53 Correct 15 ms 8448 KB Output is correct
54 Correct 15 ms 8448 KB Output is correct
55 Correct 15 ms 8448 KB Output is correct
56 Correct 15 ms 8448 KB Output is correct
57 Correct 26 ms 8192 KB Output is correct
58 Correct 28 ms 8192 KB Output is correct
59 Correct 28 ms 8192 KB Output is correct
60 Correct 28 ms 8192 KB Output is correct
61 Correct 16 ms 8448 KB Output is correct
62 Correct 16 ms 8448 KB Output is correct
63 Correct 15 ms 8448 KB Output is correct
64 Correct 17 ms 8064 KB Output is correct
65 Correct 18 ms 8064 KB Output is correct
66 Correct 20 ms 8192 KB Output is correct
67 Correct 20 ms 8192 KB Output is correct
68 Correct 14 ms 8704 KB Output is correct
69 Correct 15 ms 8448 KB Output is correct
70 Correct 14 ms 8448 KB Output is correct
71 Correct 14 ms 8448 KB Output is correct
72 Correct 27 ms 8192 KB Output is correct
73 Correct 26 ms 8064 KB Output is correct
74 Correct 14 ms 8448 KB Output is correct
75 Correct 18 ms 8320 KB Output is correct
76 Correct 16 ms 8320 KB Output is correct
77 Correct 16 ms 8192 KB Output is correct
78 Correct 14 ms 8320 KB Output is correct
79 Correct 15 ms 8192 KB Output is correct
80 Correct 15 ms 8192 KB Output is correct
81 Correct 16 ms 8320 KB Output is correct
82 Correct 18 ms 8320 KB Output is correct
83 Correct 16 ms 8192 KB Output is correct
84 Correct 15 ms 8320 KB Output is correct
85 Correct 15 ms 8192 KB Output is correct
86 Correct 15 ms 8192 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7544 KB Output is correct
2 Correct 8 ms 7552 KB Output is correct
3 Correct 8 ms 7552 KB Output is correct
4 Correct 9 ms 7552 KB Output is correct
5 Correct 9 ms 7680 KB Output is correct
6 Correct 9 ms 7680 KB Output is correct
7 Correct 9 ms 7680 KB Output is correct
8 Correct 9 ms 7680 KB Output is correct
9 Correct 9 ms 7680 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 9 ms 7720 KB Output is correct
12 Correct 9 ms 7680 KB Output is correct
13 Correct 10 ms 7680 KB Output is correct
14 Correct 9 ms 7680 KB Output is correct
15 Correct 10 ms 7680 KB Output is correct
16 Correct 10 ms 7680 KB Output is correct
17 Correct 10 ms 7680 KB Output is correct
18 Correct 11 ms 7680 KB Output is correct
19 Correct 9 ms 7680 KB Output is correct
20 Correct 9 ms 7680 KB Output is correct
21 Correct 10 ms 7680 KB Output is correct
22 Correct 9 ms 7680 KB Output is correct
23 Correct 9 ms 7680 KB Output is correct
24 Correct 9 ms 7680 KB Output is correct
25 Correct 9 ms 7680 KB Output is correct
26 Correct 9 ms 7680 KB Output is correct
27 Correct 9 ms 7680 KB Output is correct
28 Correct 9 ms 7680 KB Output is correct
29 Correct 9 ms 7680 KB Output is correct
30 Correct 10 ms 7808 KB Output is correct
31 Correct 10 ms 7680 KB Output is correct
32 Correct 9 ms 7680 KB Output is correct
33 Correct 9 ms 7680 KB Output is correct
34 Correct 9 ms 7680 KB Output is correct
35 Correct 10 ms 7680 KB Output is correct
36 Correct 9 ms 7680 KB Output is correct
37 Correct 9 ms 7680 KB Output is correct
38 Correct 9 ms 7680 KB Output is correct
39 Correct 9 ms 7680 KB Output is correct
40 Correct 9 ms 7680 KB Output is correct
41 Correct 9 ms 7680 KB Output is correct
42 Correct 9 ms 7680 KB Output is correct
43 Correct 9 ms 7680 KB Output is correct
44 Correct 9 ms 7680 KB Output is correct
45 Correct 13 ms 7680 KB Output is correct
46 Correct 21 ms 8192 KB Output is correct
47 Correct 21 ms 8192 KB Output is correct
48 Correct 21 ms 8192 KB Output is correct
49 Correct 16 ms 8704 KB Output is correct
50 Correct 15 ms 8704 KB Output is correct
51 Correct 15 ms 8704 KB Output is correct
52 Correct 15 ms 8448 KB Output is correct
53 Correct 15 ms 8448 KB Output is correct
54 Correct 15 ms 8448 KB Output is correct
55 Correct 15 ms 8448 KB Output is correct
56 Correct 15 ms 8448 KB Output is correct
57 Correct 26 ms 8192 KB Output is correct
58 Correct 28 ms 8192 KB Output is correct
59 Correct 28 ms 8192 KB Output is correct
60 Correct 28 ms 8192 KB Output is correct
61 Correct 16 ms 8448 KB Output is correct
62 Correct 16 ms 8448 KB Output is correct
63 Correct 15 ms 8448 KB Output is correct
64 Correct 17 ms 8064 KB Output is correct
65 Correct 18 ms 8064 KB Output is correct
66 Correct 20 ms 8192 KB Output is correct
67 Correct 20 ms 8192 KB Output is correct
68 Correct 14 ms 8704 KB Output is correct
69 Correct 15 ms 8448 KB Output is correct
70 Correct 14 ms 8448 KB Output is correct
71 Correct 14 ms 8448 KB Output is correct
72 Correct 27 ms 8192 KB Output is correct
73 Correct 26 ms 8064 KB Output is correct
74 Correct 14 ms 8448 KB Output is correct
75 Correct 18 ms 8320 KB Output is correct
76 Correct 16 ms 8320 KB Output is correct
77 Correct 16 ms 8192 KB Output is correct
78 Correct 14 ms 8320 KB Output is correct
79 Correct 15 ms 8192 KB Output is correct
80 Correct 15 ms 8192 KB Output is correct
81 Correct 16 ms 8320 KB Output is correct
82 Correct 18 ms 8320 KB Output is correct
83 Correct 16 ms 8192 KB Output is correct
84 Correct 15 ms 8320 KB Output is correct
85 Correct 15 ms 8192 KB Output is correct
86 Correct 15 ms 8192 KB Output is correct
87 Correct 43 ms 9208 KB Output is correct
88 Correct 125 ms 12280 KB Output is correct
89 Correct 536 ms 23160 KB Output is correct
90 Correct 545 ms 23240 KB Output is correct
91 Correct 525 ms 23136 KB Output is correct
92 Correct 261 ms 37008 KB Output is correct
93 Correct 243 ms 36836 KB Output is correct
94 Correct 251 ms 36840 KB Output is correct
95 Correct 244 ms 30564 KB Output is correct
96 Correct 252 ms 30948 KB Output is correct
97 Correct 259 ms 31076 KB Output is correct
98 Correct 254 ms 30948 KB Output is correct
99 Correct 232 ms 30176 KB Output is correct
100 Correct 804 ms 22884 KB Output is correct
101 Correct 919 ms 23012 KB Output is correct
102 Correct 926 ms 23008 KB Output is correct
103 Correct 913 ms 23144 KB Output is correct
104 Correct 249 ms 30180 KB Output is correct
105 Correct 246 ms 30184 KB Output is correct
106 Correct 248 ms 30180 KB Output is correct
107 Correct 385 ms 21512 KB Output is correct
108 Correct 430 ms 21752 KB Output is correct
109 Correct 487 ms 22264 KB Output is correct
110 Correct 214 ms 35688 KB Output is correct
111 Correct 232 ms 30560 KB Output is correct
112 Correct 203 ms 29304 KB Output is correct
113 Correct 175 ms 28896 KB Output is correct
114 Correct 782 ms 22884 KB Output is correct
115 Correct 771 ms 21880 KB Output is correct
116 Correct 185 ms 28792 KB Output is correct
117 Correct 236 ms 26228 KB Output is correct
118 Correct 255 ms 25336 KB Output is correct
119 Correct 239 ms 24440 KB Output is correct
120 Correct 187 ms 25080 KB Output is correct
121 Correct 215 ms 24072 KB Output is correct
122 Correct 198 ms 23416 KB Output is correct
123 Correct 283 ms 26360 KB Output is correct
124 Correct 304 ms 25084 KB Output is correct
125 Correct 296 ms 24568 KB Output is correct
126 Correct 235 ms 25208 KB Output is correct
127 Correct 229 ms 24184 KB Output is correct
128 Correct 234 ms 23604 KB Output is correct