oj.uz

Submission #832856

# Submission time Handle Problem Language Result Execution time Memory
832856 2023-08-21T16:00:00 Z jlallas384 Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 445 ms 49908 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
using ll = long long;

int travel_plan(int n, int m, int r[][2], int L[], int k, int p[]){
    vector<int> lst(n);
    priority_queue<pair<ll,int>> pq;
    vector<vector<ll>> dist(n);
    for(int i = 0; i < k; i++){
        pq.emplace(0, p[i]);
        lst[p[i]] = 1;
        dist[p[i]].push_back(0);
        dist[p[i]].push_back(0);
    }
    vector<vector<pair<int,int>>> g(n);
    for(int i = 0; i < m; i++){
        g[r[i][0]].emplace_back(r[i][1], L[i]);
        g[r[i][1]].emplace_back(r[i][0], L[i]);
    }
    ll ans = 1e18;
    while(pq.size()){
        auto [d, v] = pq.top(); pq.pop();
        if(-d != dist[v].back()) continue;
        if(v == 0){
            ans = min(ans, -d);
            continue;
        }
        for(auto [u, w]: g[v]){
            if(dist[u].empty()){
                dist[u].push_back(-d + w);
            }else if(dist[u].size() == 1){
                dist[u].push_back(-d + w);
                sort(dist[u].begin(), dist[u].end());
                pq.emplace(-dist[u][1], u);
            }else{
                if(-d + w < dist[u][1]){
                    dist[u].push_back(-d + w);
                    sort(dist[u].begin(), dist[u].end());
                    dist[u].pop_back();
                    pq.emplace(-dist[u][1], u);
                }
            }
        }
    }
    return ans;
}

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 2 ms 664 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 2 ms 664 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 340 ms 41536 KB Output is correct
17 Correct 60 ms 15556 KB Output is correct
18 Correct 79 ms 16460 KB Output is correct
19 Correct 445 ms 49908 KB Output is correct
20 Correct 253 ms 34220 KB Output is correct
21 Correct 30 ms 6252 KB Output is correct
22 Incorrect 237 ms 32116 KB Output isn't correct
23 Halted 0 ms 0 KB -