Submission #251102

#	Time	Username	Problem	Language	Result	Execution time	Memory
251102		huuducpro	Dreaming (IOI13_dreaming)	C++14	18 / 100	79 ms	12276 KiB

dreaming

#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
int n,vs[100002],fa[100002],d[100002];
typedef pair <int,int> pp;
vector <pp> adj[100002];
vector <int> X;
void dfs(int u)
{
    vs[u]=1;
    X.push_back(u);
    for (int i=0;i<adj[u].size();i++)
    {
        int v=adj[u][i].first;
        if (vs[v]==1) continue;
        vs[v]=1;fa[v]=u;
        d[v]=d[u]+adj[u][i].second;
        dfs(v);
    }
}
int get(int r)
{
    X.clear();
    dfs(r);
    int p=r;
    for (int i=0;i<X.size();i++)
    {
        if (d[X[i]]>d[p]) p=X[i];
        vs[X[i]]=0;
    }
    X.clear();
    r=p;fa[r]=0;d[r]=0;dfs(p);
    for (int i=0;i<X.size();i++)
        if (d[X[i]]>d[p]) p=X[i];
    int ans=d[p];int w=d[p];
    while (p>0)
    {
        ans=min(ans,max(d[p],w-d[p]));
        p=fa[p];
    }
    return ans;

}
int travelTime(int nn,int m,int l,int A[],int B[],int T[])
{
    n=nn;
    for (int i=0;i<m;i++)
    {
        A[i]++;B[i]++;
        adj[A[i]].push_back({B[i],T[i]});
        adj[B[i]].push_back({A[i],T[i]});
    }
    vector <int> P;
    for (int i=1;i<=n;i++)
    {
        if (vs[i]==1) continue;
        int t=get(i);
       // cout<<i-1<<' '<<t<<'\n';
        P.push_back(t);

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

Compilation message (stderr)

dreaming.cpp: In function 'void dfs(int)':
dreaming.cpp:12:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<adj[u].size();i++)
                  ~^~~~~~~~~~~~~~
dreaming.cpp: In function 'int get(int)':
dreaming.cpp:26:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<X.size();i++)
                  ~^~~~~~~~~
dreaming.cpp:33:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<X.size();i++)
                  ~^~~~~~~~~

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