oj.uz

Submission #387092

# Submission time Handle Problem Language Result Execution time Memory
387092 2021-04-07T22:46:04 Z ogibogi2004 Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 723 ms 99552 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN=2e5+6;
int n;
vector<int>g[MAXN];
vector<int>g1[MAXN];
vector<int>g3[MAXN];
bool avoid[MAXN];
ll c[MAXN];
bool inroots[MAXN];
int a[MAXN],h[MAXN],subtree[MAXN];
void dfs11(int u,int p)
{
	subtree[u]=1;
	for(auto xd:g[u])
	{
		if(xd==p)continue;
		dfs11(xd,u);
		subtree[u]+=subtree[xd];
	}
}
void dfs(int u,int p,map<int,ll> &mp)
{
	int bc=-1,maxst=-1;
	for(auto xd:g[u])
	{
		if(xd==p)continue;
		if(subtree[xd]>maxst)
		{
			maxst=subtree[xd];
			bc=xd;
		}
	}
	if(bc==-1)
	{
		mp[h[u]+1]=c[u];
		return;
	}
	dfs(bc,u,mp);
	for(auto xd:g[u])
	{
		if(xd==p||xd==bc)continue;
		map<int,ll> tmp;
		dfs(xd,u,tmp);
		for(auto it:tmp)
		{
			if(it.second!=0)mp[it.first]+=it.second;
		}
	}
	mp[h[u]+1]+=c[u];
	mp[0]+=c[u];
	mp[h[u]]-=c[u];
	auto it=mp.lower_bound(h[u]);
	int d=mp[h[u]];
	auto it1=it;
	it--;
	while(d<0)
	{
		int t=(*it).first;
		if((*it).second+d>=0)
		{
			mp[t]+=d;
			d=0;
		}
		else
		{
			d+=(*it).second;
			it1=it;
			it--;mp.erase(it1);
		}
	}
	mp[h[u]]=d;
}
bool used[MAXN];
vector<int>order;
int comp[MAXN];
void dfs1(int u)
{
	used[u]=1;
	for(auto xd:g[u])
	{
		if(used[xd]==0)dfs1(xd);
	}
	order.push_back(u);
}
void dfs2(int u,int c)
{
	comp[u]=c;used[u]=1;
	for(auto xd:g[u])
	{
		if(used[xd]==0)dfs2(xd,c);
	}
}
vector<int>v;
void dfs3(int u)
{
	used[u]=1;
	v.push_back(u);
	for(auto xd:g[u])if(!used[xd])dfs3(xd);
	for(auto xd:g1[u])if(!used[xd])dfs3(xd);
}
int cnt[MAXN];
int main()
{
	//ios_base::sync_with_stdio(false);
	//cin.tie(NULL);
	//cout.tie(NULL);
	cin>>n;
	for(int i=1;i<=n;++i)
	{
		cin>>a[i]>>h[i]>>c[i];
		g[a[i]].push_back(i);
		g1[i].push_back(a[i]);
	}
	for(int i=1;i<=n;i++)
	{
		dfs1(i);
	}
	reverse(order.begin(),order.end());
	memset(used,0,sizeof(used));
	for(int i=0;i<order.size();i++)
	{
		if(used[order[i]]==0)dfs2(order[i],i);
	}
	memset(used,0,sizeof(used));
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		if(used[i]==0)
		{
			v.clear();
			dfs3(i);
			int y=-1;
			for(int j=0;j<v.size();j++)
			{
				cnt[comp[v[j]]]++;
				if(cnt[comp[v[j]]]>1)y=comp[v[j]];
				if(a[v[j]]==v[j])y=comp[v[j]];
			}
			for(int j=0;j<v.size();j++)
			{
				--cnt[comp[v[j]]];
			}
			vector<pair<int,int> >roots;
			for(int j=0;j<v.size();++j)
			{
				if(comp[v[j]]==y)
				{
					roots.push_back({h[v[j]],v[j]});
					inroots[v[j]]=1;
				}
			}
			sort(roots.rbegin(),roots.rend());
			vector<int>g1;
			for(auto xd:g[roots[roots.size()-1].second])
			{
				if(inroots[xd])continue;
				else g1.push_back(xd);
			}
			g[roots.back().second]=g1;
			for(int j=0;j<roots.size()-1;++j)
			{
				for(auto xd:g[roots[j].second])if(!inroots[xd])g[roots[roots.size()-1].second].push_back(xd);
				g[roots[j].second]={roots[j+1].second};
			}
			dfs11(roots[0].second,0);
			map<int,ll>mp;
			dfs(roots[0].second,0,mp);
			if(mp.count(0))ans+=mp[0];
		}
	}
	cout<<ans<<endl;
return 0;
}
/*
3 
2 3 4
3 2 5
1 3 2
*/
/*
4
2 3 5
3 4 6
1 2 7
2 5 4
*/

Compilation message

worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:122:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |  for(int i=0;i<order.size();i++)
      |              ~^~~~~~~~~~~~~
worst_reporter2.cpp:135:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |    for(int j=0;j<v.size();j++)
      |                ~^~~~~~~~~
worst_reporter2.cpp:141:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |    for(int j=0;j<v.size();j++)
      |                ~^~~~~~~~~
worst_reporter2.cpp:146:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |    for(int j=0;j<v.size();++j)
      |                ~^~~~~~~~~
worst_reporter2.cpp:162:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |    for(int j=0;j<roots.size()-1;++j)
      |                ~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14700 KB Output is correct
2 Correct 11 ms 14700 KB Output is correct
3 Correct 11 ms 14700 KB Output is correct
4 Correct 11 ms 14828 KB Output is correct
5 Correct 21 ms 15468 KB Output is correct
6 Correct 20 ms 15212 KB Output is correct
7 Correct 19 ms 15232 KB Output is correct
8 Correct 21 ms 15468 KB Output is correct
9 Correct 20 ms 15212 KB Output is correct
10 Correct 23 ms 15340 KB Output is correct
11 Correct 21 ms 15212 KB Output is correct
12 Correct 21 ms 16236 KB Output is correct
13 Correct 19 ms 16236 KB Output is correct
14 Correct 20 ms 15724 KB Output is correct
15 Correct 21 ms 15852 KB Output is correct
16 Correct 21 ms 15468 KB Output is correct
17 Correct 21 ms 15212 KB Output is correct
18 Correct 21 ms 15212 KB Output is correct
19 Correct 21 ms 15980 KB Output is correct
20 Correct 18 ms 15724 KB Output is correct
21 Correct 18 ms 15724 KB Output is correct
22 Correct 18 ms 15468 KB Output is correct
23 Correct 17 ms 15212 KB Output is correct
24 Correct 20 ms 15980 KB Output is correct
25 Correct 18 ms 15724 KB Output is correct
26 Correct 22 ms 16876 KB Output is correct
27 Correct 20 ms 15980 KB Output is correct
28 Correct 20 ms 16236 KB Output is correct
29 Correct 20 ms 16492 KB Output is correct
30 Correct 21 ms 16620 KB Output is correct
31 Correct 22 ms 16492 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 15468 KB Output is correct
2 Correct 659 ms 46176 KB Output is correct
3 Correct 558 ms 35056 KB Output is correct
4 Correct 723 ms 44260 KB Output is correct
5 Correct 569 ms 35044 KB Output is correct
6 Correct 479 ms 34924 KB Output is correct
7 Correct 457 ms 35044 KB Output is correct
8 Correct 466 ms 75500 KB Output is correct
9 Correct 431 ms 75488 KB Output is correct
10 Correct 343 ms 75508 KB Output is correct
11 Correct 453 ms 56672 KB Output is correct
12 Correct 439 ms 56672 KB Output is correct
13 Correct 597 ms 46044 KB Output is correct
14 Correct 442 ms 34852 KB Output is correct
15 Correct 318 ms 34780 KB Output is correct
16 Correct 599 ms 63012 KB Output is correct
17 Correct 367 ms 53576 KB Output is correct
18 Correct 330 ms 53668 KB Output is correct
19 Correct 431 ms 44508 KB Output is correct
20 Correct 289 ms 33328 KB Output is correct
21 Correct 603 ms 64400 KB Output is correct
22 Correct 350 ms 54108 KB Output is correct
23 Correct 621 ms 99552 KB Output is correct
24 Correct 512 ms 67628 KB Output is correct
25 Correct 521 ms 82400 KB Output is correct
26 Correct 456 ms 88708 KB Output is correct
27 Correct 506 ms 86772 KB Output is correct
28 Correct 553 ms 86880 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14700 KB Output is correct
2 Correct 11 ms 14700 KB Output is correct
3 Correct 11 ms 14700 KB Output is correct
4 Correct 11 ms 14828 KB Output is correct
5 Correct 21 ms 15468 KB Output is correct
6 Correct 20 ms 15212 KB Output is correct
7 Correct 19 ms 15232 KB Output is correct
8 Correct 21 ms 15468 KB Output is correct
9 Correct 20 ms 15212 KB Output is correct
10 Correct 23 ms 15340 KB Output is correct
11 Correct 21 ms 15212 KB Output is correct
12 Correct 21 ms 16236 KB Output is correct
13 Correct 19 ms 16236 KB Output is correct
14 Correct 20 ms 15724 KB Output is correct
15 Correct 21 ms 15852 KB Output is correct
16 Correct 21 ms 15468 KB Output is correct
17 Correct 21 ms 15212 KB Output is correct
18 Correct 21 ms 15212 KB Output is correct
19 Correct 21 ms 15980 KB Output is correct
20 Correct 18 ms 15724 KB Output is correct
21 Correct 18 ms 15724 KB Output is correct
22 Correct 18 ms 15468 KB Output is correct
23 Correct 17 ms 15212 KB Output is correct
24 Correct 20 ms 15980 KB Output is correct
25 Correct 18 ms 15724 KB Output is correct
26 Correct 22 ms 16876 KB Output is correct
27 Correct 20 ms 15980 KB Output is correct
28 Correct 20 ms 16236 KB Output is correct
29 Correct 20 ms 16492 KB Output is correct
30 Correct 21 ms 16620 KB Output is correct
31 Correct 22 ms 16492 KB Output is correct
32 Correct 22 ms 15468 KB Output is correct
33 Correct 659 ms 46176 KB Output is correct
34 Correct 558 ms 35056 KB Output is correct
35 Correct 723 ms 44260 KB Output is correct
36 Correct 569 ms 35044 KB Output is correct
37 Correct 479 ms 34924 KB Output is correct
38 Correct 457 ms 35044 KB Output is correct
39 Correct 466 ms 75500 KB Output is correct
40 Correct 431 ms 75488 KB Output is correct
41 Correct 343 ms 75508 KB Output is correct
42 Correct 453 ms 56672 KB Output is correct
43 Correct 439 ms 56672 KB Output is correct
44 Correct 597 ms 46044 KB Output is correct
45 Correct 442 ms 34852 KB Output is correct
46 Correct 318 ms 34780 KB Output is correct
47 Correct 599 ms 63012 KB Output is correct
48 Correct 367 ms 53576 KB Output is correct
49 Correct 330 ms 53668 KB Output is correct
50 Correct 431 ms 44508 KB Output is correct
51 Correct 289 ms 33328 KB Output is correct
52 Correct 603 ms 64400 KB Output is correct
53 Correct 350 ms 54108 KB Output is correct
54 Correct 621 ms 99552 KB Output is correct
55 Correct 512 ms 67628 KB Output is correct
56 Correct 521 ms 82400 KB Output is correct
57 Correct 456 ms 88708 KB Output is correct
58 Correct 506 ms 86772 KB Output is correct
59 Correct 553 ms 86880 KB Output is correct
60 Correct 13 ms 14700 KB Output is correct
61 Incorrect 13 ms 14700 KB Output isn't correct
62 Halted 0 ms 0 KB -