# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725316 | onepunchac168 | Crocodile's Underground City (IOI11_crocodile) | C++14 | 445 ms | 45596 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 fi first
#define se second
#define pb push_back
typedef pair <int,int> ii;
const char nl='\n';
ii dp[100005][2];
vector <int > gg;
vector <ii> vt[100005];
int n;
int dijkstra()
{
for (int i=0;i<n;i++)
{
dp[i][0]=dp[i][1]={1e9+5,-1};
}
priority_queue<ii,vector <ii> ,greater <ii> > qu;
for (auto v:gg)
{
dp[v][0]=dp[v][1]={0,-1};
qu.push({0,v});
}
while (!qu.empty())
{
int aa=qu.top().fi;
int u=qu.top().se;
qu.pop();
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... |