oj.uz

답안 #109419

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109419 2019-05-06T13:10:42 Z amiratou 꿈 (IOI13_dreaming) C++14
0 / 100
 68 ms 12020 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];
vector<int> nodes;
void dfs(int node,int d){
	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};
			dfs(child.fi,d+child.se);
		}
}
pair<int,int> findCenter(int node){
	maxi=0;
	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});
	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;
	for (int i = 0; i < idx-1; ++i)
	{
		if(center[tree_d[i+1].se].se>center[tree_d[i].se].se)
			centroid=center[tree_d[i+1].se].fi;
		ans=max(ans,center[tree_d[i+1].se].se+center[tree_d[i].se].se+2);
	}*/
	for (int i = 1; i < idx; ++i)
	{
		vec[center[i].fi].push_back({center[0].fi,2});
		vec[center[0].fi].push_back({center[i].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 maxi;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 12020 KB Output is correct
2 Correct 68 ms 12020 KB Output is correct
3 Correct 47 ms 8308 KB Output is correct
4 Correct 11 ms 2816 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 18 ms 3584 KB Output is correct
7 Incorrect 3 ms 1152 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 12020 KB Output is correct
2 Correct 68 ms 12020 KB Output is correct
3 Correct 47 ms 8308 KB Output is correct
4 Correct 11 ms 2816 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 18 ms 3584 KB Output is correct
7 Incorrect 3 ms 1152 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 12020 KB Output is correct
2 Correct 68 ms 12020 KB Output is correct
3 Correct 47 ms 8308 KB Output is correct
4 Correct 11 ms 2816 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 18 ms 3584 KB Output is correct
7 Incorrect 3 ms 1152 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 22 ms 9720 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 68 ms 12020 KB Output is correct
2 Correct 68 ms 12020 KB Output is correct
3 Correct 47 ms 8308 KB Output is correct
4 Correct 11 ms 2816 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 18 ms 3584 KB Output is correct
7 Incorrect 3 ms 1152 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 12020 KB Output is correct
2 Correct 68 ms 12020 KB Output is correct
3 Correct 47 ms 8308 KB Output is correct
4 Correct 11 ms 2816 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 18 ms 3584 KB Output is correct
7 Incorrect 3 ms 1152 KB Output isn't correct
8 Halted 0 ms 0 KB -