# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209637 | Kenzo_1114 | Crocodile's Underground City (IOI11_crocodile) | C++17 | 1354 ms | 93432 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>
#include "crocodile.h"
using namespace std;
const int MAXN = 1000010;
const int MAXM = 1000010;
const int INF = 2e9 + 7;
int N, M, R[MAXM][2], K, P[MAXN];
int L[MAXM];
int dist[MAXN], dist2[MAXN];
vector<int> graf[MAXN];
vector<int> cost[MAXN];
void DIK(int n)
{
set<pair<pair<int, int>, int> > s;
for(int i = 0; i < n; i++)
s.insert({{dist2[i], dist[i]}, i});
while(!s.empty())
{
int cur = s.begin()->second;
s.erase(s.begin());
for(int i = 0; i < graf[cur].size(); i++)
{
int adj = graf[cur][i];
int c = cost[cur][i];
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... |