oj.uz

Submission #118150

# Submission time Handle Problem Language Result Execution time Memory
118150 2019-06-18T09:20:15 Z baluteshih Islands (IOI08_islands) C++14
80 / 100
 1248 ms 131072 KB 
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i,j) memset(i,j,sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
vector<int> G[1000005];
vector<pll> cir;
deque<int> dq;
bitset<1000005> yc,vis;
ll M;
pii edge[1000005];
const ll INF=1e18;
 
bool dfs(int u,int f)
{
	int flag=0;
	vis[u]=1;
	for(int i:G[u])
		if(i!=f)
			if(!vis[i])
				if(dfs(i,i))
					flag=1,cir.back().S=edge[i].S;
				else;
			else if(!yc[u])
				flag=1,yc[i]=1,cir.pb(MP(i,edge[i].S));
	if(u!=f)
		if(!vis[edge[u].F])
			if(dfs(edge[u].F,u))
				flag=1,cir.back().S=edge[u].S;
			else;
		else if(!yc[u])
			flag=1,yc[edge[u].F]=1,cir.pb(MP(edge[u].F,edge[u].S));
	if(flag)
		if(yc[u]) flag=0;
		else cir.pb(MP(u,0)),yc[u]=1;
	return flag;
}
 
ll dfs2(int u)
{
	ll mx=0,sx=0;
	yc[u]=1;
	for(int i:G[u])
		if(!yc[i])
		{
			ll d=dfs2(i)+edge[i].S;
			if(d>mx) sx=mx,mx=d;
			else if(d>sx) sx=d;
		}
	if(!yc[edge[u].F])
	{
		ll d=dfs2(edge[u].F)+edge[u].S;
		if(d>mx) sx=mx,mx=d;
		else if(d>sx) sx=d;
	}
	M=max(M,sx+mx);
	vector<int>().swap(G[u]);
	return mx;
}
 
int main()
{
	int n;
	ll ans=0,sum;
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	{
		scanf("%d%d",&edge[i].F,&edge[i].S);
		if(edge[i].F!=i) G[edge[i].F].pb(i);
	}
	for(int i=1;i<=n;++i)
		if(!vis[i])
		{
			vector<pll>().swap(cir),M=0,dfs(i,-1);
			deque<int>().swap(dq);
			for(int j=0;j<cir.size();++j)
				cir[j].F=dfs2(cir[j].F);
			if(cir.size()>1)
			{
				int n=cir.size();
				sum=0,dq.pb(0);
				for(int j=0;j<n;++j)	
					cir.pb(cir[j]);
				for(int j=1;j<cir.size();++j)
				{
					while(dq.size()&&j-dq[0]>=n) dq.pop_front();
					sum+=cir[j-1].S,M=max(M,sum+cir[j].F+cir[dq[0]].F);
					cir[j].F-=sum;
					while(dq.size()&&cir[j].F>=cir[dq.back()].F)
						dq.pop_back();
					dq.pb(j);
				}
			}
			ans+=M;
		}
	printf("%lld\n",ans);
}

Compilation message

islands.cpp: In function 'bool dfs(int, int)':
islands.cpp:29:5: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   if(i!=f)
     ^
islands.cpp:36:4: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
  if(u!=f)
    ^
islands.cpp:43:4: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
  if(flag)
    ^
islands.cpp: In function 'int main()':
islands.cpp:86:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j=0;j<cir.size();++j)
                ~^~~~~~~~~~~
islands.cpp:94:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=1;j<cir.size();++j)
                 ~^~~~~~~~~~~
islands.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
islands.cpp:78:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&edge[i].F,&edge[i].S);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23808 KB Output is correct
2 Correct 23 ms 23808 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 22 ms 23808 KB Output is correct
5 Correct 23 ms 23936 KB Output is correct
6 Correct 24 ms 23860 KB Output is correct
7 Correct 27 ms 23804 KB Output is correct
8 Correct 23 ms 23808 KB Output is correct
9 Correct 21 ms 23808 KB Output is correct
10 Correct 21 ms 23808 KB Output is correct
11 Correct 21 ms 23808 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 24064 KB Output is correct
2 Correct 22 ms 23852 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23896 KB Output is correct
2 Correct 24 ms 24192 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 24696 KB Output is correct
2 Correct 40 ms 26616 KB Output is correct
3 Correct 33 ms 24440 KB Output is correct
4 Correct 27 ms 24184 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 28272 KB Output is correct
2 Correct 59 ms 29256 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 31732 KB Output is correct
2 Correct 116 ms 44392 KB Output is correct
3 Correct 143 ms 55412 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 38012 KB Output is correct
2 Correct 223 ms 66016 KB Output is correct
3 Correct 253 ms 83544 KB Output is correct
4 Correct 314 ms 100532 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 35960 KB Output is correct
2 Correct 937 ms 126908 KB Output is correct
3 Correct 304 ms 46952 KB Output is correct
4 Correct 413 ms 99180 KB Output is correct
5 Correct 710 ms 96976 KB Output is correct
6 Correct 1248 ms 51096 KB Output is correct
7 Runtime error 434 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 387 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -