oj.uz

Submission #1033512

# Submission time Handle Problem Language Result Execution time Memory
1033512 2024-07-25T00:36:46 Z ArthuroWich Crocodile's Underground City (IOI11_crocodile) C++17
100 / 100
 290 ms 71108 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    int n = N, m = M;
    vector<int> vis(n, 0);
    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < m; i++) {
        adj[R[i][0]].push_back({R[i][1], L[i]});
        adj[R[i][1]].push_back({R[i][0], L[i]});
    }
    priority_queue<pair<int, int>> pq;
    for (int i = 0; i < K; i++) {
        vis[P[i]] = 1;
        pq.push({0, P[i]});
    }
    while(!pq.empty()) {
        auto [d, a] = pq.top();
        pq.pop();
        d = abs(d);
        vis[a]++;
        if (a == 0 && vis[a] > 1) {
            return d;
        }
        if (vis[a] == 1 || vis[a] > 2) {
            continue;
        }
        for (auto [b, w] : adj[a]) {
            if (vis[b] > 2) {
                continue;
            }
            pq.push({-(d+w), b});
        }
    }
    return 0;
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 289 ms 71108 KB Output is correct
17 Correct 54 ms 13248 KB Output is correct
18 Correct 56 ms 14912 KB Output is correct
19 Correct 281 ms 67012 KB Output is correct
20 Correct 198 ms 63416 KB Output is correct
21 Correct 25 ms 5976 KB Output is correct
22 Correct 290 ms 44624 KB Output is correct