Submission #361741

#	Time	Username	Problem	Language	Result	Execution time	Memory
361741		David_M	Dreaming (IOI13_dreaming)	C++14	100 / 100	111 ms	18796 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,X=-1,Y=-1,Z=-1,R;
vector<pair<int,int> >v[1<<17];
void U(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,U(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])U(N,0),U(e,1),R=max(R,D),U(e,2),W[w++]=D,D=0;
    while(w--){
        if(Z<W[w])Z=W[w];
        if(Y<W[w])Z=Y,Y=W[w];
        if(X<W[w])Y=X,X=W[w];
    }
return max(R,max(X,Z+(Z>=0)*L)+Y+(Y>=0)*L);
}

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