| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 905131 | Macker | 악어의 지하 도시 (IOI11_crocodile) | C++14 | 555 ms | 69712 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "crocodile.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    vector<vector<pair<int, int>>> adj(N);
    vector<bool> bl(N, 0);
    vector<int> dist(N, INT_MAX/2);
    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>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    for (int i = 0; i < K; i++) {
        q.push({0, P[i]});
        bl[P[i]] = 1;
    }
    
    while(q.size()){
        auto [d, a] = q.top(); q.pop();
        if(!bl[a]){
            bl[a] = 1;
            continue;
        }
        if(d < dist[a]){
            dist[a] = d;
            for (auto &[b, c] : adj[a]) {
                if(dist[b] > dist[a] + c){
                    //dist[b] = dist[a] + c;
                    q.push({dist[a] + c, b});
                }
            }
        }
    }
    
    return dist[0];
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
