제출 #1295866

#제출 시각아이디문제언어결과실행 시간메모리
1295866AbdullahIshfaq악어의 지하 도시 (IOI11_crocodile)C++20
100 / 100
338 ms54932 KiB
#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.push({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);
        }
        else
        {
            vis[v]++;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...