| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 460760 | comopo7935 | Game (IOI14_game) | C++14 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
vector < pair < int, int > > v[100010];
set < int > win;
int dfs(int pos, int prec) {
    if (win.find(pos) != win.end()) return 0;
    vector < int > s;
    for (auto k: v[pos]) {
        if (k.first == prec) continue;
        s.push_back(dfs(k.first, pos) + k.second);
    }
    sort(s.begin(), s.end());
    s.push_back(int(1e12));
    s.push_back(int(1e12));
    return s[1];
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    for (int i = 0; i < M; i++) {
        v[R[i][0]].push_back({
            R[i][1],
            L[i]
        });
        v[R[i][1]].push_back({
            R[i][0],
            L[i]
        });
    }
    for (int i = 0; i < K; i++) win.insert(P[i]);
    return dfs(0, -1);
}
// :)
