oj.uz

Submission #386421

# Submission time Handle Problem Language Result Execution time Memory
386421 2021-04-06T14:07:16 Z kshitij_sodani Islands (IOI08_islands) C++14
70 / 100
 658 ms 131076 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
 
 
llo n;
vector<pair<int,llo>> adj[1000001];
//vector<pair<int,llo>> adj2[1000001];
 
int par[1000001];
int find(int no){
	if(par[no]==no){
		return no;
	}
	par[no]=find(par[no]);
	return par[no];
}
llo dp[1000001][2];
pair<llo,llo> cur;
vector<pair<int,llo>> pp;
vector<pair<int,llo>> xx;
 
bool vis[1000001];
 
vector<llo> tt;
void dfs(llo no,llo par2=-1){
	
	if(no==cur.b){
		pp=xx;
	}
	tt.pb(no);
	for(auto j:adj[no]){
		/*if(j.a==cur.a and no==cur.b){
			continue;
		}
		if(j.a==cur.b and no==cur.a){
			continue;
		}*/
		
		if(j.a!=par2){
			xx.pb({j.a,j.b});
			dfs(j.a,no);
			xx.pop_back();
		}
	}
}
 
llo maa=0;
 
void dfs2(llo no,llo par2=-1){
	dp[no][0]=0;
	dp[no][1]=0;
	vector<llo> ss;
	llo su=0;
 
	for(auto j:adj[no]){
		if(vis[j.a]){
			continue;
		}
		if(j.a!=par2){
			dfs2(j.a,no);
	//		dp[no][0]=max(dp[no][0],j.b+dp[j.a][0]);
			su+=dp[j.a][1];
			ss.pb(dp[j.a][0]+j.b);
		}
	}
	sort(ss.begin(),ss.end());
	reverse(ss.begin(),ss.end());
	dp[no][1]=0;
	dp[no][0]=0;
	for(llo i=0;i<ss.size();i++){
		if(i==2){
			break;
		}
 
		if(i==0){
			if(ss[i]>=0){
				dp[no][0]+=ss[i];
			}
		}
		if(ss[i]>=0){
			dp[no][1]+=ss[i];
		}
	}
	dp[no][1]=max(dp[no][1],dp[no][0]);
	maa=max(maa,dp[no][1]);
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(llo i=0;i<n;i++){
		par[i]=i;
	}
	vector<pair<pair<int,int>,llo>> ed;
	for(llo i=0;i<n;i++){
		llo aa,cc;
		cin>>aa>>cc;
		aa--;
		llo x=find(i);
		llo y=find(aa);
		if(x!=y){
			par[x]=y;
			adj[i].pb({aa,cc});
			adj[aa].pb({i,cc});
		}
		else{
			ed.pb({{i,aa},cc});
		}
	}
	llo ans=0;
	for(auto j:ed){
		cur=j.a;
		llo cost=0;
		tt.clear();
		dfs(j.a.a);
		pp.pb({cur.a,j.b});
		for(auto i:pp){
			vis[i.a]=1;
		}
		vector<pair<pair<int,int>,llo>> pc;
		pc.pb(j);
 
		for(auto i:tt){
			for(auto k:adj[i]){
				if(vis[k.a]+vis[i]<2){
					//adj2[i].pb(k);
				}
				else{
					if(k.a<i){
						pc.pb({{i,k.a},k.b});
					}
				}
			}
		}

		maa=0;
		for(auto i:tt){
				for(auto k:adj[i]){
					if(vis[k.a]+vis[i]<2){
					//	adj2[i].pb(k);
					}
					else{
 
					}
				}
			}
		for(auto i:pp){
			dfs2(i.a);
		}
		cost=max(cost,maa);
	
		llo xx=pp.size();
		multiset<llo> zz;
		for(int i=0;i<xx;i++){
			pp.pb(pp[i]);
		}
		vector<llo> xd;
		llo su2=0;
		for(llo i=0;i<pp.size();i++){
			if(i>=xx){
				auto jj=zz.find(xd[i-xx]);
				zz.erase(jj);
			}
			su2+=pp[i].b;
			if(zz.size()){
				auto jj=zz.end();
				jj--;
				cost=max(cost,dp[pp[i].a][0]+su2+(*jj));
			}
			if(i<xx){
				xd.pb(dp[pp[i].a][0]-su2);
				zz.insert(xd.back());
			}
		}
		ans+=cost;
 
 
 
 
 
 
 
 
	}
	cout<<ans<<endl;
 
 
 
 
 
 
 
	return 0;
}

Compilation message

islands.cpp: In function 'void dfs2(llo, llo)':
islands.cpp:77:15: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |  for(llo i=0;i<ss.size();i++){
      |              ~^~~~~~~~~~
islands.cpp: In function 'int main()':
islands.cpp:166:16: warning: comparison of integer expressions of different signedness: 'llo' {aka 'long long int'} and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |   for(llo i=0;i<pp.size();i++){
      |               ~^~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 17 ms 23788 KB Output is correct
7 Correct 17 ms 23788 KB Output is correct
8 Correct 18 ms 23788 KB Output is correct
9 Correct 17 ms 23788 KB Output is correct
10 Correct 17 ms 23916 KB Output is correct
11 Correct 17 ms 23916 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 24044 KB Output is correct
2 Correct 18 ms 23916 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24044 KB Output is correct
2 Correct 19 ms 24556 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 25452 KB Output is correct
2 Correct 42 ms 29964 KB Output is correct
3 Correct 34 ms 25836 KB Output is correct
4 Correct 24 ms 24812 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 32176 KB Output is correct
2 Correct 68 ms 35024 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 44052 KB Output is correct
2 Correct 161 ms 56320 KB Output is correct
3 Correct 193 ms 76588 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 55504 KB Output is correct
2 Correct 324 ms 106560 KB Output is correct
3 Correct 487 ms 126300 KB Output is correct
4 Runtime error 318 ms 131072 KB Execution killed with signal 9

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 121188 KB Output is correct
2 Runtime error 658 ms 131076 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 404 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -