Submission #240218

#	Time	Username	Problem	Language	Result	Execution time	Memory
240218		oscarsierra12	악어의 지하 도시 (IOI11_crocodile)	C++14	0 / 100	5 ms	384 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std ;

const int N = 1010 ;
#define  ff   first
#define  ss   second
#define pb    push_back

int dp[N];
vector <pair<int,int>> G[N] ;

int go ( int u, int p ) {
    int frMn = INT_MAX, scMn ;
    for ( auto v:G[u] ) {
        if ( p == v.ff ) continue ;
        go ( v.ff, u ) ;
        if ( dp[v.ff] + v.ss <= frMn ) frMn = dp[v.ff] + v.ss, scMn = frMn ;
        else if ( dp[v.ff] + v.ss < scMn ) scMn = dp[v.ff] + v.ss ;
    }
    dp[u] = scMn ;
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
  for ( int i = 0 ; i < M; ++i ) G[R[i][0]].pb ( { R[i][1], L[i] } ), G[R[i][1]].pb({R[i][0],L[i]}) ;
  return go(0,-1);
}

Compilation message (stderr)

crocodile.cpp: In function 'int go(int, int)':
crocodile.cpp:22:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
crocodile.cpp:21:11: warning: 'scMn' may be used uninitialized in this function [-Wmaybe-uninitialized]
     dp[u] = scMn ;
     ~~~~~~^~~~~~

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11