제출 #756583

#제출 시각아이디문제언어결과실행 시간메모리
756583pavement악어의 지하 도시 (IOI11_crocodile)C++17
89 / 100
466 ms45020 KiB
#include "crocodile.h" #include <bits/stdc++.h> using namespace std; #define eb emplace_back using ii = pair<int, int>; int fd[100005], sd[100005]; vector<ii> adj[100005]; priority_queue<ii, vector<ii>, greater<ii> > pq; int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) { for (int i = 0; i < M; i++) { adj[R[i][0]].eb(R[i][1], L[i]); adj[R[i][1]].eb(R[i][0], L[i]); } for (int i = 0; i < N; i++) { fd[i] = sd[i] = (int)2e9; } for (int i = 0; i < K; i++) { fd[P[i]] = sd[P[i]] = 0; pq.emplace(0, P[i]); } while (!pq.empty()) { auto [d, v] = pq.top(); pq.pop(); if (sd[v] != d) continue; for (auto [u, w] : adj[v]) { int c = d + w; if (c < sd[u]) { sd[u] = c; if (sd[u] < fd[u]) swap(fd[u], sd[u]); if (sd[u] != (int)2e9) pq.emplace(sd[u], u); } } } return sd[0]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...