oj.uz

답안 #387080

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387080 2021-04-07T22:26:42 Z ogibogi2004 Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 660 ms 97632 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];
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]});
				}
			}
			sort(roots.begin(),roots.end());
			vector<int>g1;
			for(auto xd:g[roots[roots.size()-1].second])
			{
				if(xd==roots[0].second)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])g[roots[roots.size()-1].second].push_back(xd);
				g[roots[j].second]={roots[j+1].second};
			}
			//cout<<roots.size()<<" "<<roots[0].second<<endl;
			dfs11(roots[0].second,0);
			map<int,ll>mp;
			dfs(roots[0].second,0,mp);
			ans+=mp[0];
		}
	}
	cout<<ans<<endl;
return 0;
}

Compilation message

worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:121:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |  for(int i=0;i<order.size();i++)
      |              ~^~~~~~~~~~~~~
worst_reporter2.cpp:134:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |    for(int j=0;j<v.size();j++)
      |                ~^~~~~~~~~
worst_reporter2.cpp:140:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  140 |    for(int j=0;j<v.size();j++)
      |                ~^~~~~~~~~
worst_reporter2.cpp:145:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |    for(int j=0;j<v.size();++j)
      |                ~^~~~~~~~~
worst_reporter2.cpp:160: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]
  160 |    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 11 ms 14572 KB Output is correct
4 Correct 11 ms 14572 KB Output is correct
5 Correct 22 ms 15340 KB Output is correct
6 Correct 20 ms 15084 KB Output is correct
7 Correct 19 ms 15084 KB Output is correct
8 Correct 21 ms 15360 KB Output is correct
9 Correct 20 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 16108 KB Output is correct
13 Correct 18 ms 16108 KB Output is correct
14 Correct 20 ms 15724 KB Output is correct
15 Correct 20 ms 15596 KB Output is correct
16 Correct 21 ms 15340 KB Output is correct
17 Correct 19 ms 15084 KB Output is correct
18 Correct 20 ms 15084 KB Output is correct
19 Correct 21 ms 15872 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 15212 KB Output is correct
24 Correct 20 ms 15852 KB Output is correct
25 Correct 18 ms 15596 KB Output is correct
26 Correct 21 ms 16748 KB Output is correct
27 Correct 20 ms 15852 KB Output is correct
28 Correct 20 ms 16108 KB Output is correct
29 Correct 20 ms 16364 KB Output is correct
30 Correct 21 ms 16364 KB Output is correct
31 Correct 21 ms 16364 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 15340 KB Output is correct
2 Correct 660 ms 44256 KB Output is correct
3 Correct 550 ms 33120 KB Output is correct
4 Correct 650 ms 42340 KB Output is correct
5 Correct 561 ms 32996 KB Output is correct
6 Correct 472 ms 32996 KB Output is correct
7 Correct 446 ms 33124 KB Output is correct
8 Correct 445 ms 73696 KB Output is correct
9 Correct 430 ms 73760 KB Output is correct
10 Correct 332 ms 73752 KB Output is correct
11 Correct 434 ms 54740 KB Output is correct
12 Correct 416 ms 54848 KB Output is correct
13 Correct 534 ms 44124 KB Output is correct
14 Correct 420 ms 32988 KB Output is correct
15 Correct 300 ms 32860 KB Output is correct
16 Correct 539 ms 61148 KB Output is correct
17 Correct 362 ms 51804 KB Output is correct
18 Correct 308 ms 51676 KB Output is correct
19 Correct 406 ms 42868 KB Output is correct
20 Correct 271 ms 31836 KB Output is correct
21 Correct 557 ms 62684 KB Output is correct
22 Correct 352 ms 52188 KB Output is correct
23 Correct 553 ms 97632 KB Output is correct
24 Correct 475 ms 66268 KB Output is correct
25 Correct 453 ms 80864 KB Output is correct
26 Correct 457 ms 87264 KB Output is correct
27 Correct 486 ms 84960 KB Output is correct
28 Correct 494 ms 84960 KB Output is correct

Subtask #3
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 11 ms 14572 KB Output is correct
4 Correct 11 ms 14572 KB Output is correct
5 Correct 22 ms 15340 KB Output is correct
6 Correct 20 ms 15084 KB Output is correct
7 Correct 19 ms 15084 KB Output is correct
8 Correct 21 ms 15360 KB Output is correct
9 Correct 20 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 16108 KB Output is correct
13 Correct 18 ms 16108 KB Output is correct
14 Correct 20 ms 15724 KB Output is correct
15 Correct 20 ms 15596 KB Output is correct
16 Correct 21 ms 15340 KB Output is correct
17 Correct 19 ms 15084 KB Output is correct
18 Correct 20 ms 15084 KB Output is correct
19 Correct 21 ms 15872 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 15212 KB Output is correct
24 Correct 20 ms 15852 KB Output is correct
25 Correct 18 ms 15596 KB Output is correct
26 Correct 21 ms 16748 KB Output is correct
27 Correct 20 ms 15852 KB Output is correct
28 Correct 20 ms 16108 KB Output is correct
29 Correct 20 ms 16364 KB Output is correct
30 Correct 21 ms 16364 KB Output is correct
31 Correct 21 ms 16364 KB Output is correct
32 Correct 21 ms 15340 KB Output is correct
33 Correct 660 ms 44256 KB Output is correct
34 Correct 550 ms 33120 KB Output is correct
35 Correct 650 ms 42340 KB Output is correct
36 Correct 561 ms 32996 KB Output is correct
37 Correct 472 ms 32996 KB Output is correct
38 Correct 446 ms 33124 KB Output is correct
39 Correct 445 ms 73696 KB Output is correct
40 Correct 430 ms 73760 KB Output is correct
41 Correct 332 ms 73752 KB Output is correct
42 Correct 434 ms 54740 KB Output is correct
43 Correct 416 ms 54848 KB Output is correct
44 Correct 534 ms 44124 KB Output is correct
45 Correct 420 ms 32988 KB Output is correct
46 Correct 300 ms 32860 KB Output is correct
47 Correct 539 ms 61148 KB Output is correct
48 Correct 362 ms 51804 KB Output is correct
49 Correct 308 ms 51676 KB Output is correct
50 Correct 406 ms 42868 KB Output is correct
51 Correct 271 ms 31836 KB Output is correct
52 Correct 557 ms 62684 KB Output is correct
53 Correct 352 ms 52188 KB Output is correct
54 Correct 553 ms 97632 KB Output is correct
55 Correct 475 ms 66268 KB Output is correct
56 Correct 453 ms 80864 KB Output is correct
57 Correct 457 ms 87264 KB Output is correct
58 Correct 486 ms 84960 KB Output is correct
59 Correct 494 ms 84960 KB Output is correct
60 Incorrect 11 ms 14572 KB Output isn't correct
61 Halted 0 ms 0 KB -