oj.uz

답안 #387104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387104 2021-04-07T23:17:25 Z ogibogi2004 Worst Reporter 4 (JOI21_worst_reporter4) C++14
100 / 100
 878 ms 102500 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:g1[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 10 ms 14572 KB Output is correct
2 Correct 11 ms 14572 KB Output is correct
3 Correct 10 ms 14572 KB Output is correct
4 Correct 11 ms 14572 KB Output is correct
5 Correct 21 ms 15340 KB Output is correct
6 Correct 20 ms 15084 KB Output is correct
7 Correct 19 ms 15092 KB Output is correct
8 Correct 21 ms 15340 KB Output is correct
9 Correct 21 ms 15212 KB Output is correct
10 Correct 19 ms 15084 KB Output is correct
11 Correct 19 ms 15084 KB Output is correct
12 Correct 20 ms 16108 KB Output is correct
13 Correct 19 ms 16108 KB Output is correct
14 Correct 20 ms 15596 KB Output is correct
15 Correct 20 ms 15596 KB Output is correct
16 Correct 21 ms 15340 KB Output is correct
17 Correct 20 ms 15084 KB Output is correct
18 Correct 18 ms 15084 KB Output is correct
19 Correct 21 ms 15724 KB Output is correct
20 Correct 18 ms 15612 KB Output is correct
21 Correct 19 ms 15724 KB Output is correct
22 Correct 19 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 20 ms 16072 KB Output is correct
29 Correct 20 ms 16364 KB Output is correct
30 Correct 21 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 22 ms 15340 KB Output is correct
2 Correct 656 ms 43492 KB Output is correct
3 Correct 556 ms 31460 KB Output is correct
4 Correct 651 ms 41452 KB Output is correct
5 Correct 557 ms 31468 KB Output is correct
6 Correct 483 ms 31340 KB Output is correct
7 Correct 453 ms 31340 KB Output is correct
8 Correct 450 ms 72032 KB Output is correct
9 Correct 425 ms 71904 KB Output is correct
10 Correct 335 ms 71904 KB Output is correct
11 Correct 436 ms 53216 KB Output is correct
12 Correct 413 ms 53344 KB Output is correct
13 Correct 537 ms 43556 KB Output is correct
14 Correct 414 ms 31560 KB Output is correct
15 Correct 303 ms 31200 KB Output is correct
16 Correct 536 ms 60320 KB Output is correct
17 Correct 361 ms 50192 KB Output is correct
18 Correct 312 ms 50016 KB Output is correct
19 Correct 413 ms 42068 KB Output is correct
20 Correct 274 ms 29668 KB Output is correct
21 Correct 546 ms 61920 KB Output is correct
22 Correct 353 ms 50472 KB Output is correct
23 Correct 554 ms 96736 KB Output is correct
24 Correct 478 ms 65432 KB Output is correct
25 Correct 457 ms 79972 KB Output is correct
26 Correct 446 ms 86628 KB Output is correct
27 Correct 492 ms 84192 KB Output is correct
28 Correct 490 ms 84260 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14572 KB Output is correct
2 Correct 11 ms 14572 KB Output is correct
3 Correct 10 ms 14572 KB Output is correct
4 Correct 11 ms 14572 KB Output is correct
5 Correct 21 ms 15340 KB Output is correct
6 Correct 20 ms 15084 KB Output is correct
7 Correct 19 ms 15092 KB Output is correct
8 Correct 21 ms 15340 KB Output is correct
9 Correct 21 ms 15212 KB Output is correct
10 Correct 19 ms 15084 KB Output is correct
11 Correct 19 ms 15084 KB Output is correct
12 Correct 20 ms 16108 KB Output is correct
13 Correct 19 ms 16108 KB Output is correct
14 Correct 20 ms 15596 KB Output is correct
15 Correct 20 ms 15596 KB Output is correct
16 Correct 21 ms 15340 KB Output is correct
17 Correct 20 ms 15084 KB Output is correct
18 Correct 18 ms 15084 KB Output is correct
19 Correct 21 ms 15724 KB Output is correct
20 Correct 18 ms 15612 KB Output is correct
21 Correct 19 ms 15724 KB Output is correct
22 Correct 19 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 20 ms 16072 KB Output is correct
29 Correct 20 ms 16364 KB Output is correct
30 Correct 21 ms 16364 KB Output is correct
31 Correct 20 ms 16364 KB Output is correct
32 Correct 22 ms 15340 KB Output is correct
33 Correct 656 ms 43492 KB Output is correct
34 Correct 556 ms 31460 KB Output is correct
35 Correct 651 ms 41452 KB Output is correct
36 Correct 557 ms 31468 KB Output is correct
37 Correct 483 ms 31340 KB Output is correct
38 Correct 453 ms 31340 KB Output is correct
39 Correct 450 ms 72032 KB Output is correct
40 Correct 425 ms 71904 KB Output is correct
41 Correct 335 ms 71904 KB Output is correct
42 Correct 436 ms 53216 KB Output is correct
43 Correct 413 ms 53344 KB Output is correct
44 Correct 537 ms 43556 KB Output is correct
45 Correct 414 ms 31560 KB Output is correct
46 Correct 303 ms 31200 KB Output is correct
47 Correct 536 ms 60320 KB Output is correct
48 Correct 361 ms 50192 KB Output is correct
49 Correct 312 ms 50016 KB Output is correct
50 Correct 413 ms 42068 KB Output is correct
51 Correct 274 ms 29668 KB Output is correct
52 Correct 546 ms 61920 KB Output is correct
53 Correct 353 ms 50472 KB Output is correct
54 Correct 554 ms 96736 KB Output is correct
55 Correct 478 ms 65432 KB Output is correct
56 Correct 457 ms 79972 KB Output is correct
57 Correct 446 ms 86628 KB Output is correct
58 Correct 492 ms 84192 KB Output is correct
59 Correct 490 ms 84260 KB Output is correct
60 Correct 11 ms 14572 KB Output is correct
61 Correct 11 ms 14572 KB Output is correct
62 Correct 11 ms 14572 KB Output is correct
63 Correct 11 ms 14572 KB Output is correct
64 Correct 685 ms 40924 KB Output is correct
65 Correct 606 ms 37344 KB Output is correct
66 Correct 683 ms 45024 KB Output is correct
67 Correct 599 ms 37596 KB Output is correct
68 Correct 537 ms 37292 KB Output is correct
69 Correct 500 ms 36832 KB Output is correct
70 Correct 690 ms 65444 KB Output is correct
71 Correct 646 ms 59208 KB Output is correct
72 Correct 724 ms 77852 KB Output is correct
73 Correct 690 ms 77944 KB Output is correct
74 Correct 717 ms 67680 KB Output is correct
75 Correct 576 ms 56672 KB Output is correct
76 Correct 549 ms 56544 KB Output is correct
77 Correct 632 ms 67680 KB Output is correct
78 Correct 515 ms 56800 KB Output is correct
79 Correct 746 ms 66536 KB Output is correct
80 Correct 631 ms 57296 KB Output is correct
81 Correct 567 ms 56680 KB Output is correct
82 Correct 878 ms 102500 KB Output is correct
83 Correct 307 ms 38248 KB Output is correct
84 Correct 787 ms 78448 KB Output is correct
85 Correct 792 ms 78336 KB Output is correct
86 Correct 769 ms 75484 KB Output is correct
87 Correct 809 ms 78448 KB Output is correct
88 Correct 804 ms 78432 KB Output is correct