# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402732 | Cantfindme | Crocodile's Underground City (IOI11_crocodile) | C++17 | 580 ms | 73780 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;
typedef long long ll;
typedef pair<ll,ll> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
const ll maxn = 100010;
ll state[maxn];
ll dist[maxn], distreal[maxn];
vector <pi> adjlist[maxn];
ll n, e;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
n = N; e = M;
for (ll i =0;i<e;i++) {
ll a = R[i][0], b = R[i][1], c = L[i];
adjlist[a].push_back(pi(b,c));
adjlist[b].push_back(pi(a,c));
}
priority_queue <pi, vector<pi>, greater<pi>> pq;
memset(dist,-1,sizeof dist);
memset(distreal,-1,sizeof distreal);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |