Submission #984912

#	Time	Username	Problem	Language	Result	Execution time	Memory
984912		54skyxenon	Crocodile's Underground City (IOI11_crocodile)	C++17	46 / 100	3 ms	4956 KiB

crocodile

// https://oj.uz/problem/view/IOI11_crocodile

/** Needed for linking!!! */
#include "crocodile.h"

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

#define ll long long
#define INF (ll)1e18

vector<map<int, int>> graph;
vector<bool> is_exit;
vector<bool> visited;

int dfs(int curr) {
    if (is_exit[curr]) {
        return 0;
    }

    vector<ll> distances;
    for (auto [nei, weight] : graph[curr]) {
        if (!visited[nei]) {
            visited[nei] = true;
            distances.push_back(min(INF, (ll)(weight + dfs(nei))));
        }
        else {
            distances.push_back(INF);
        }
    }

    sort(distances.begin(), distances.end());
    return distances[1];
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    graph.resize(N);
    is_exit.resize(N);
    visited.resize(N);

    for (int i = 0; i < M; i++) {
        graph[R[i][0]][R[i][1]] = graph[R[i][1]][R[i][0]] = L[i];
    }

    for (int i = 0; i < K; i++) {
        is_exit[P[i]] = true;
    }

    visited[0] = true;
    return dfs(0); 
}

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