# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211399 | socho | Crocodile's Underground City (IOI11_crocodile) | C++14 | 589 ms | 50656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "crocodile.h"
#include "bits/stdc++.h"
using namespace std;
// #define endl '\n'
// #define int long long
int n, m;
const int MXN = 100005;
vector<pair<int, int> > adj[MXN];
int vis[MXN];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
n = N, m = M;
for (int i=0; i<m; i++) {
int a, b, w;
a = R[i][0], b = R[i][1], w = L[i];
adj[a].push_back(make_pair(b, w));
adj[b].push_back(make_pair(a, w));
}
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > proc;
for (int i=0; i<K; i++) {
int x = P[i];
proc.push(make_pair(0, x));
vis[x] = 1;
}
while (!proc.empty()) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |