Submission #699908

#	Time	Username	Problem	Language	Result	Execution time	Memory
699908		Alihan_8	경주 (Race) (IOI11_race)	C++17	21 / 100	3068 ms	8788 KiB

race

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
int best_path(int n, int k, int h[][2], int L[]){
    vector <pair<int,int>> g[n];
    for ( int i = 0; i+1 < n; i++ ){
        g[h[i][0]].pb({h[i][1], L[i]});
        g[h[i][1]].pb({h[i][0], L[i]});
    }
    const int inf = 1e9+1;
    int Mn = inf;
    function <int(int,int,int,int)> dfs = [&](int x, int par, int depth, int len){
        if ( len >= k ){
            return len == k ? depth : inf;
        }
        for ( auto [to, w]: g[x] ){
            if ( to == par ) continue;
            Mn = min(Mn, dfs(to, x, depth+1, len+w));
        }
        return inf;
    };
    for ( int i = 0; i < n; i++ ) dfs(i, -1, 0, 0);
    if ( Mn == inf ) Mn = -1;
    return Mn;
}

Compilation message (stderr)

race.cpp: In function 'void IO(std::string)':
race.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57