Submission #1305941

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305941		orgiloogii	Crocodile's Underground City (IOI11_crocodile)	C++20	0 / 100	1 ms	572 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
vector <vector <pair <int, int>>> adj;
long long dfs(int u) {
    int m = INT_MAX, m1 = INT_MAX;
    for (auto [x, y] : adj[u]) {
        int u = dfs(x) + y;
        if (u < m) {
            m1 = m;
            m = u;
        }
        else if (u < m1) {
            m1 = u;
        }
    }
    if (m1 == INT_MAX) {
        return 0;
    }
    return m1;
}

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) {
    adj.resize(n);
    for (int i = 0;i < m;i++) {
        if (r[i][0] > r[i][1]) {
            swap(r[i][0], r[i][1]);
        }
        adj[r[i][0]].push_back({r[i][1], l[i]});
    }
    return dfs(0);
}
//int main() {
//}

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