oj.uz

Submission #905119

# Submission time Handle Problem Language Result Execution time Memory
905119 2024-01-12T15:38:40 Z Macker Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 1 ms 4444 KB 
#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]});
        dist[P[i]] = 0;
        bl[P[i]] = 1;
    }
    
    while(q.size()){
        auto [d, a] = q.top(); q.pop();
        if(!bl[a]){
            bl[a] = 1;
            continue;
        }
        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];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -