# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952225 | emad234 | Crocodile's Underground City (IOI11_crocodile) | C++17 | 409 ms | 86560 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>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 1e6 + 5;
using namespace std;
vector<vector<pii>> v;
ll dist[mxN], mn[mxN];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
v.clear();
v.resize(N + 3);
for (ll i = 0; i < N; i++)
{
dist[i] = 1e18 + 5;
mn[i] = 1e18 + 5;
}
for (ll i = 0; i < M; i++)
{
v[R[i][1]].push_back({R[i][0], L[i]});
v[R[i][0]].push_back({R[i][1], L[i]});
}
priority_queue<pii, vector<pii>, greater<pii>> q;
for (ll i = 0; i < K; i++)
{
mn[P[i]] = 0;
dist[P[i]] = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |