oj.uz

Submission #984942

# Submission time Handle Problem Language Result Execution time Memory
984942 2024-05-17T08:33:42 Z 54skyxenon Crocodile's Underground City (IOI11_crocodile) C++17
46 / 100
 10 ms 9816 KB 
// 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;

ll 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(weight + dfs(nei));
        }
    }

    sort(distances.begin(), distances.end());

    if (curr == 0) {
        return distances[1];
    }

    if (distances.size() < 2) {
        // return INF;
        throw runtime_error("Got into a cycle!");
    }

    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);

    // try {
    // }
    // catch (...) {
    //     vector<int> direct_escapes;
    //     for (auto [nei, dist] : graph[0]) {
    //         if (is_exit[nei]) {
    //             direct_escapes.push_back(dist);
    //         }
    //     }
    //     assert(direct_escapes.size() > 1);
    //     sort(direct_escapes.begin(), direct_escapes.end());
    //     return direct_escapes[1];
    //     return *min_element(direct_escapes.begin(), direct_escapes.end());
    // }
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4544 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4544 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Runtime error 10 ms 9816 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4544 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Runtime error 10 ms 9816 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -