Submission #1295865

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295865		AbdullahIshfaq	Crocodile's Underground City (IOI11_crocodile)	C++20	0 / 100	0 ms	332 KiB

crocodile

#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[])
{
    vector<vector<pair<int, int>>> adj(N);
    for (int i = 0; i < M; i++)
    {
        int u = R[i][0], v = R[i][1];
        adj[u].push_back({v, L[i]});
        adj[v].push_back({u, L[i]});
    }

    vector<int> vis(N);
    priority_queue<pair<int, int>> q;
    for (int i = 0; i < K; i++)
    {
        vis[P[i]]++;
        q.emplace(0, P[i]);
    }

    while (!q.empty())
    {
        auto [d, v] = q.top();
        q.pop();
        if (vis[v] == 1)
        {
            vis[v]++;
            if (v == 0){
                return -d;
            }
            for (auto &[u, w] : adj[v])
                q.emplace(d - w, u);
        }
    }
}

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11