oj.uz

Submission #259378

# Submission time Handle Problem Language Result Execution time Memory
259378 2020-08-07T17:17:31 Z uacoder123 Dreaming (IOI13_dreaming) C++14
14 / 100
 100 ms 15352 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;

int n,m,l,ans=0,vis[100001],co=0,ans1=0;
vector<iii> al[100001];
vi v;
int dfs(int node,int p)
{
	vis[node]=1;
	co++;
	for(int i=0;i<al[node].size();++i)
	{
		if(!vis[al[node][i].S.F])
		{
			al[node][i].F=dfs(al[node][i].S.F,node);
			al[node][i].F+=al[node][i].S.S;
		}
	}
	sort(all(al[node]));
	ans1=max(ans1,al[node].back().F+al[node][al[node].size()-2].F);
	return(al[node].back().F);
}
void dfs2(int node,int p)
{
	sort(all(al[node]));
	int to=al[node].back().S.F;
	ans=min(ans,al[node].back().F);
	if(to==p)
		return;
	for(int i=0;i<al[to].size();++i)
	{
		if(al[to][i].S.F==node)
		{
			al[to][i].F=al[node][al[node].size()-2].F+al[to][i].S.S;
			break;
		}
	}
	dfs2(to,node);
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) 
{
	n=N;
	m=M;
	l=L;
	for(int i=0;i<m;++i)
	{
		al[A[i]].pb(mp(0,mp(B[i],T[i])));
		al[B[i]].pb(mp(0,mp(A[i],T[i])));
		co+=T[i];
	}
	for(int i=0;i<n;++i)
	{
		if(al[i].size()>2)
			exit(0);
		al[i].pb(mp(0,mp(i,i)));
	}
	for(int i=0;i<n;++i)
	{
		if(!vis[i]) 
		{
			dfs(i,i);
			ans=1000000000;
			dfs2(i,i);
			v.pb(ans);
		}
	}
	sort(all(v));
	ans=v.back();
	if(v.size()>1)
		ans=v.back()+v[v.size()-2]+l;
	if(v.size()>2)
		ans=max(ans,2*l+v[v.size()-2]+v[v.size()-3]);
	ans1=max(ans1,ans);
	return(ans1);
}

Compilation message

dreaming.cpp: In function 'int dfs(int, int)':
dreaming.cpp:26:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<al[node].size();++i)
              ~^~~~~~~~~~~~~~~~
dreaming.cpp: In function 'void dfs2(int, int)':
dreaming.cpp:45:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<al[to].size();++i)
              ~^~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 15352 KB Output is correct
2 Correct 98 ms 15096 KB Output is correct
3 Correct 58 ms 12596 KB Output is correct
4 Correct 11 ms 4608 KB Output is correct
5 Correct 11 ms 3840 KB Output is correct
6 Correct 17 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 33 ms 8064 KB Output is correct
9 Correct 45 ms 10616 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 74 ms 12152 KB Output is correct
12 Correct 84 ms 13688 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 15352 KB Output is correct
2 Correct 98 ms 15096 KB Output is correct
3 Correct 58 ms 12596 KB Output is correct
4 Correct 11 ms 4608 KB Output is correct
5 Correct 11 ms 3840 KB Output is correct
6 Correct 17 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 33 ms 8064 KB Output is correct
9 Correct 45 ms 10616 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 74 ms 12152 KB Output is correct
12 Correct 84 ms 13688 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Incorrect 2 ms 2688 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 15352 KB Output is correct
2 Correct 98 ms 15096 KB Output is correct
3 Correct 58 ms 12596 KB Output is correct
4 Correct 11 ms 4608 KB Output is correct
5 Correct 11 ms 3840 KB Output is correct
6 Correct 17 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 33 ms 8064 KB Output is correct
9 Correct 45 ms 10616 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 74 ms 12152 KB Output is correct
12 Correct 84 ms 13688 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Incorrect 2 ms 2688 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 7160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 15352 KB Output is correct
2 Correct 98 ms 15096 KB Output is correct
3 Correct 58 ms 12596 KB Output is correct
4 Correct 11 ms 4608 KB Output is correct
5 Correct 11 ms 3840 KB Output is correct
6 Correct 17 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 33 ms 8064 KB Output is correct
9 Correct 45 ms 10616 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 74 ms 12152 KB Output is correct
12 Correct 84 ms 13688 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Incorrect 2 ms 2688 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 15352 KB Output is correct
2 Correct 98 ms 15096 KB Output is correct
3 Correct 58 ms 12596 KB Output is correct
4 Correct 11 ms 4608 KB Output is correct
5 Correct 11 ms 3840 KB Output is correct
6 Correct 17 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 33 ms 8064 KB Output is correct
9 Correct 45 ms 10616 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 74 ms 12152 KB Output is correct
12 Correct 84 ms 13688 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Incorrect 2 ms 2688 KB Output isn't correct
15 Halted 0 ms 0 KB -