제출 #361726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
361726		David_M	꿈 (IOI13_dreaming)	C++14	0 / 100	61 ms	15980 KiB

dreaming

#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;
int d[3][1<<17],f[1<<17],W[1<<17],w,e,D,F,S;
vector<pair<int,int> >v[1<<17];
void dfs(int x,int o){
	f[x]++;
	if(o<2&&d[o][x]>=D)e=x,D=d[o][x];
	if(o>1)D=min(D,max(d[1][x],d[2][x]));
	for(auto y:v[x])if(f[y.first]<=o)d[o][y.first]=d[o][x]+y.second,dfs(y.first,o);
}
int travelTime(int N,int M,int L,int A[],int B[],int T[]){
    while(M--)v[A[M]].push_back({B[M],T[M]}),v[B[M]].push_back({A[M],T[M]});
    while(N--)if(!f[N])dfs(N,0),dfs(e,1),dfs(e,2),W[w++]=-D,D=0;
    sort(W,W+w);
	return max(-W[0],-W[2]+L)-W[1]+L;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 10
• Subtask 3: 0 / 23
• Subtask 4: 0 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23