# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42498 | MatheusLealV | Evacuation plan (IZhO18_plan) | C++14 | 4096 ms | 37852 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 <bits/stdc++.h>
#define int long long
#define N 100005
#define inf 2000000000000000000LL
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int n, m, k, q, P[N], id[N], dist[N], rev[N], pai[N], peso[N];
vector<pii> grafo[N];
void dijkstra()
{
priority_queue<pii, vector<pii>, greater<pii> > pq;
for(int i = 1; i <= n; i++) dist[i] = inf;
for(int i = 1; i <= k; i++) dist[ P[i] ] = 0, pq.push({0, P[i]});
while(!pq.empty())
{
int x = pq.top().s, d = pq.top().f;
pq.pop();
if(d > dist[x]) continue;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |