Submission #693301

#	Time	Username	Problem	Language	Result	Execution time	Memory
693301		PoonYaPat	Dreaming (IOI13_dreaming)	C++14	18 / 100	36 ms	10912 KiB

dreaming

#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int mmax[100001],dis_min,mmax1,mmax2,mnode;
bool vis[100001];
vector<pii> adj[100001];
vector<int> v;

void dfs1(int x, int par, int root) {
    vis[x]=true;
    for (auto s : adj[x]) {
        if (s.first==par) continue;
        dfs1(s.first,x,root);
        int dis=mmax[s.first]+s.second;

        if (x==root) {

            if (mmax1<=dis) {
                mmax2=mmax1;
                mmax1=dis;
                mnode=s.first;
            } else if (mmax2<=dis) mmax2=dis;

        } else mmax[x]=max(mmax[x],dis);
    }
}

void dfs2(int x, int par, int dis) {
    dis_min=min(dis_min,max(mmax[x],dis));
    for (auto s : adj[x]) if (s.first!=par) dfs2(s.first,x,dis+s.second);
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    for (int i=0; i<M; ++i) {
        adj[A[i]].push_back(pii(B[i],T[i]));
        adj[B[i]].push_back(pii(A[i],T[i]));
    }
    for (int i=0; i<N; ++i) {
        if (!vis[i]) {
            mmax1=mmax2=0;
            dfs1(i,-1,i);
            dis_min=mmax1;
            for (auto s : adj[i]) {
                if (s.first==mnode) dfs2(mnode,i,mmax2+s.second);
            }
            v.push_back(dis_min);
        }
    }

    sort(v.begin(),v.end(),greater<int>());
    if (v.size()==1) return v[0];
    else if (v.size()==2) return v[0]+v[1]+L;
    return max(v[0]+v[1]+L,v[1]+v[2]+2*L);
}

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