oj.uz

답안 #109432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109432 2019-05-06T14:07:15 Z amiratou 꿈 (IOI13_dreaming) C++14
14 / 100
 75 ms 13428 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
#define fi first
#define se second
#define INF (int)(1e9)
vector<vector<pair<int,int> > > vec;
bool vis[100005];
int maxi=0,a,idx=0;
vector<pair<int,int> > tree_d;
pair<int,int> p[100005],center[100005];
int comp[100005];
vector<int> nodes;
int dfs(int node,int d){
	int ans=1;
	nodes.push_back(node);
	if(d>maxi)
		a=node,maxi=d;
	vis[node]=1;
	for(auto child:vec[node])
		if(child.fi!=p[node].fi){
			vis[child.fi]=1;
			p[child.fi]={node,child.se};
			ans+=dfs(child.fi,d+child.se);
		}
	return ans;
}
pair<int,int> findCenter(int node){
	maxi=0;
	int s=dfs(node,0);
	for(auto i:nodes)
		p[i]={-1,-1};
	nodes.clear();
	int B=a,sum=0,mini=INF,c=node,sh=INF;
	maxi=0;
	dfs(B,0);
	nodes.clear();
	for(;a!=-1;sum+=p[a].se,a=p[a].fi){
		if(abs(maxi/2-sum)<mini)
			mini=abs(maxi/2-sum),c=a,sh=sum;
	}
	tree_d.push_back({maxi,idx});
	//cout<<maxi-sh<<" "<<c<<"\n";
	return {c,max(maxi-sh,0)};
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	vec.resize(N);
	for (int i = 0; i < M; ++i)
	{
		vec[A[i]].push_back({B[i],T[i]});
		vec[B[i]].push_back({A[i],T[i]});
	}
	for (int i = 0; i < N; ++i)
		if(!vis[i])
			center[idx++]=findCenter(i);
	sort(tree_d.begin(),tree_d.end(),greater<pair<int,int> >());
	int centroid=center[0].first,ans=tree_d[0].fi,max_d=0;
	//cout<<centroid<<" "<<ans;
	for (int i = 1; i < tree_d.size(); ++i)
	{
		ans=max(ans,center[tree_d[i].se].se+center[tree_d[0].se].se+L);
		ans=max(ans,tree_d[i].fi);
	}
	/*for (int i = 1; i < tree_d.size(); ++i)
	{
		vec[center[tree_d[i].se].fi].push_back({center[tree_d[0].se].fi,2});
		vec[center[tree_d[0].se].fi].push_back({center[tree_d[i].se].fi,2});
	}
	maxi=0;
	memset(p,-1,sizeof p);
	dfs(0,0);
	nodes.clear();
	int b=a;
	memset(p,-1,sizeof p);
	maxi=0;
	dfs(b,0);*/
    return ans;
}

Compilation message

dreaming.cpp: In function 'std::pair<int, int> findCenter(int)':
dreaming.cpp:30:6: warning: unused variable 's' [-Wunused-variable]
  int s=dfs(node,0);
      ^
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:59:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < tree_d.size(); ++i)
                  ~~^~~~~~~~~~~~~~~
dreaming.cpp:57:6: warning: unused variable 'centroid' [-Wunused-variable]
  int centroid=center[0].first,ans=tree_d[0].fi,max_d=0;
      ^~~~~~~~
dreaming.cpp:57:48: warning: unused variable 'max_d' [-Wunused-variable]
  int centroid=center[0].first,ans=tree_d[0].fi,max_d=0;
                                                ^~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 13428 KB Output is correct
2 Correct 75 ms 13408 KB Output is correct
3 Correct 41 ms 8948 KB Output is correct
4 Correct 9 ms 2304 KB Output is correct
5 Correct 8 ms 1408 KB Output is correct
6 Correct 15 ms 3328 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 27 ms 5120 KB Output is correct
9 Correct 34 ms 6904 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 51 ms 8952 KB Output is correct
12 Correct 55 ms 11120 KB Output is correct
13 Correct 2 ms 384 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 13428 KB Output is correct
2 Correct 75 ms 13408 KB Output is correct
3 Correct 41 ms 8948 KB Output is correct
4 Correct 9 ms 2304 KB Output is correct
5 Correct 8 ms 1408 KB Output is correct
6 Correct 15 ms 3328 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 27 ms 5120 KB Output is correct
9 Correct 34 ms 6904 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 51 ms 8952 KB Output is correct
12 Correct 55 ms 11120 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Incorrect 2 ms 384 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 13428 KB Output is correct
2 Correct 75 ms 13408 KB Output is correct
3 Correct 41 ms 8948 KB Output is correct
4 Correct 9 ms 2304 KB Output is correct
5 Correct 8 ms 1408 KB Output is correct
6 Correct 15 ms 3328 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 27 ms 5120 KB Output is correct
9 Correct 34 ms 6904 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 51 ms 8952 KB Output is correct
12 Correct 55 ms 11120 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Incorrect 2 ms 384 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 22 ms 9728 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 13428 KB Output is correct
2 Correct 75 ms 13408 KB Output is correct
3 Correct 41 ms 8948 KB Output is correct
4 Correct 9 ms 2304 KB Output is correct
5 Correct 8 ms 1408 KB Output is correct
6 Correct 15 ms 3328 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 27 ms 5120 KB Output is correct
9 Correct 34 ms 6904 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 51 ms 8952 KB Output is correct
12 Correct 55 ms 11120 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Runtime error 3 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 13428 KB Output is correct
2 Correct 75 ms 13408 KB Output is correct
3 Correct 41 ms 8948 KB Output is correct
4 Correct 9 ms 2304 KB Output is correct
5 Correct 8 ms 1408 KB Output is correct
6 Correct 15 ms 3328 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 27 ms 5120 KB Output is correct
9 Correct 34 ms 6904 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 51 ms 8952 KB Output is correct
12 Correct 55 ms 11120 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Incorrect 2 ms 384 KB Output isn't correct
18 Halted 0 ms 0 KB -