oj.uz

답안 #387100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387100 2021-04-07T23:12:39 Z ogibogi2004 Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 711 ms 96992 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[0]=0;
		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++)
	{
		if(used[i]==0)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]]];
			}
			if(y==-1)assert(false);
			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};
			}
			/*cout<<roots.size()<<endl;
			for(auto xd:roots)cout<<xd.second<<" ";
			cout<<endl;
			for(int j=1;j<=n;++j)
			{
				cout<<j<<":";
				for(auto xd:g[j])cout<<" "<<xd;
				cout<<endl;
			}*/
			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:123:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |  for(int i=0;i<order.size();++i)
      |              ~^~~~~~~~~~~~~
worst_reporter2.cpp:136:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |    for(int j=0;j<v.size();++j)
      |                ~^~~~~~~~~
worst_reporter2.cpp:142:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |    for(int j=0;j<v.size();++j)
      |                ~^~~~~~~~~
worst_reporter2.cpp:148:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |    for(int j=0;j<v.size();++j)
      |                ~^~~~~~~~~
worst_reporter2.cpp:164: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]
  164 |    for(int j=0;j<roots.size()-1;++j)
      |                ~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14572 KB Output is correct
2 Correct 10 ms 14572 KB Output is correct
3 Correct 12 ms 14572 KB Output is correct
4 Correct 10 ms 14572 KB Output is correct
5 Correct 21 ms 15340 KB Output is correct
6 Correct 19 ms 15084 KB Output is correct
7 Correct 20 ms 15084 KB Output is correct
8 Correct 21 ms 15340 KB Output is correct
9 Correct 19 ms 15084 KB Output is correct
10 Correct 19 ms 15084 KB Output is correct
11 Correct 18 ms 15084 KB Output is correct
12 Correct 20 ms 16128 KB Output is correct
13 Correct 22 ms 16108 KB Output is correct
14 Correct 20 ms 15724 KB Output is correct
15 Correct 19 ms 15724 KB Output is correct
16 Correct 21 ms 15340 KB Output is correct
17 Correct 19 ms 15084 KB Output is correct
18 Correct 18 ms 15056 KB Output is correct
19 Correct 20 ms 15724 KB Output is correct
20 Correct 18 ms 15596 KB Output is correct
21 Correct 18 ms 15596 KB Output is correct
22 Correct 18 ms 15340 KB Output is correct
23 Correct 17 ms 15084 KB Output is correct
24 Correct 20 ms 15852 KB Output is correct
25 Correct 19 ms 15596 KB Output is correct
26 Correct 21 ms 16748 KB Output is correct
27 Correct 20 ms 15724 KB Output is correct
28 Correct 21 ms 15980 KB Output is correct
29 Correct 22 ms 16364 KB Output is correct
30 Correct 20 ms 16364 KB Output is correct
31 Correct 20 ms 16364 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 15340 KB Output is correct
2 Correct 663 ms 43492 KB Output is correct
3 Correct 543 ms 31588 KB Output is correct
4 Correct 667 ms 41580 KB Output is correct
5 Correct 578 ms 31596 KB Output is correct
6 Correct 489 ms 31340 KB Output is correct
7 Correct 475 ms 31340 KB Output is correct
8 Correct 443 ms 71908 KB Output is correct
9 Correct 456 ms 71904 KB Output is correct
10 Correct 328 ms 71904 KB Output is correct
11 Correct 424 ms 53472 KB Output is correct
12 Correct 419 ms 53092 KB Output is correct
13 Correct 533 ms 43488 KB Output is correct
14 Correct 418 ms 31584 KB Output is correct
15 Correct 297 ms 31200 KB Output is correct
16 Correct 628 ms 60256 KB Output is correct
17 Correct 372 ms 50016 KB Output is correct
18 Correct 311 ms 50016 KB Output is correct
19 Correct 408 ms 42068 KB Output is correct
20 Correct 276 ms 29792 KB Output is correct
21 Correct 560 ms 61792 KB Output is correct
22 Correct 349 ms 50400 KB Output is correct
23 Correct 546 ms 96992 KB Output is correct
24 Correct 489 ms 65396 KB Output is correct
25 Correct 459 ms 80228 KB Output is correct
26 Correct 455 ms 86628 KB Output is correct
27 Correct 484 ms 84280 KB Output is correct
28 Correct 491 ms 84320 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14572 KB Output is correct
2 Correct 10 ms 14572 KB Output is correct
3 Correct 12 ms 14572 KB Output is correct
4 Correct 10 ms 14572 KB Output is correct
5 Correct 21 ms 15340 KB Output is correct
6 Correct 19 ms 15084 KB Output is correct
7 Correct 20 ms 15084 KB Output is correct
8 Correct 21 ms 15340 KB Output is correct
9 Correct 19 ms 15084 KB Output is correct
10 Correct 19 ms 15084 KB Output is correct
11 Correct 18 ms 15084 KB Output is correct
12 Correct 20 ms 16128 KB Output is correct
13 Correct 22 ms 16108 KB Output is correct
14 Correct 20 ms 15724 KB Output is correct
15 Correct 19 ms 15724 KB Output is correct
16 Correct 21 ms 15340 KB Output is correct
17 Correct 19 ms 15084 KB Output is correct
18 Correct 18 ms 15056 KB Output is correct
19 Correct 20 ms 15724 KB Output is correct
20 Correct 18 ms 15596 KB Output is correct
21 Correct 18 ms 15596 KB Output is correct
22 Correct 18 ms 15340 KB Output is correct
23 Correct 17 ms 15084 KB Output is correct
24 Correct 20 ms 15852 KB Output is correct
25 Correct 19 ms 15596 KB Output is correct
26 Correct 21 ms 16748 KB Output is correct
27 Correct 20 ms 15724 KB Output is correct
28 Correct 21 ms 15980 KB Output is correct
29 Correct 22 ms 16364 KB Output is correct
30 Correct 20 ms 16364 KB Output is correct
31 Correct 20 ms 16364 KB Output is correct
32 Correct 23 ms 15340 KB Output is correct
33 Correct 663 ms 43492 KB Output is correct
34 Correct 543 ms 31588 KB Output is correct
35 Correct 667 ms 41580 KB Output is correct
36 Correct 578 ms 31596 KB Output is correct
37 Correct 489 ms 31340 KB Output is correct
38 Correct 475 ms 31340 KB Output is correct
39 Correct 443 ms 71908 KB Output is correct
40 Correct 456 ms 71904 KB Output is correct
41 Correct 328 ms 71904 KB Output is correct
42 Correct 424 ms 53472 KB Output is correct
43 Correct 419 ms 53092 KB Output is correct
44 Correct 533 ms 43488 KB Output is correct
45 Correct 418 ms 31584 KB Output is correct
46 Correct 297 ms 31200 KB Output is correct
47 Correct 628 ms 60256 KB Output is correct
48 Correct 372 ms 50016 KB Output is correct
49 Correct 311 ms 50016 KB Output is correct
50 Correct 408 ms 42068 KB Output is correct
51 Correct 276 ms 29792 KB Output is correct
52 Correct 560 ms 61792 KB Output is correct
53 Correct 349 ms 50400 KB Output is correct
54 Correct 546 ms 96992 KB Output is correct
55 Correct 489 ms 65396 KB Output is correct
56 Correct 459 ms 80228 KB Output is correct
57 Correct 455 ms 86628 KB Output is correct
58 Correct 484 ms 84280 KB Output is correct
59 Correct 491 ms 84320 KB Output is correct
60 Correct 11 ms 14572 KB Output is correct
61 Correct 11 ms 14572 KB Output is correct
62 Correct 12 ms 14572 KB Output is correct
63 Correct 11 ms 14572 KB Output is correct
64 Incorrect 711 ms 42340 KB Output isn't correct
65 Halted 0 ms 0 KB -