제출 #1187909

#제출 시각아이디문제언어결과실행 시간메모리
1187909North1304악어의 지하 도시 (IOI11_crocodile)C++20
100 / 100
329 ms72764 KiB
#include <bits/stdc++.h> #include "crocodile.h" using namespace std; const int MAXN = 1e5 + 1; vector<pair<int,int>> vec[MAXN]; int visited[MAXN]; priority_queue<pair<long long,int>, vector<pair<long long,int>>, greater<pair<long long,int>>> q; int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) { for (int i=0;i<m;i++) { vec[r[i][0]].push_back({l[i], r[i][1]}); vec[r[i][1]].push_back({l[i], r[i][0]}); } for (int i=0;i<k;i++) { q.push({0, p[i]}); visited[p[i]] = 1; } while (!q.empty()) { auto [dist,u] = q.top(); q.pop(); if (visited[u]==0) { visited[u] = 1; continue; } if (visited[u]==2) continue; visited[u] = 2; if (u==0) return dist; for (auto [w,v]:vec[u]) { q.push({dist+w, v}); } } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...