# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
742240 | beaboss | Race (IOI11_race) | C++14 | 495 ms | 111092 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>
using namespace std;
#define s second
#define f first
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
typedef vector<ll> vi;
#define FOR(i, a, b) for (ll i = (a); i<b; i++)
const ll MN = 3e5 + 10;
vpii adj[MN];
ll d[MN]; // from root in highways
ll d2[MN]; // from root in distance
ll k;
map<ll, ll> small[MN];
void dfs(ll cur = 0, ll dist = 0, ll dist2 = 0, ll p = -1) {
// cout << cur << endl;
d[cur]=dist;
d2[cur]=dist2;
small[cur][dist2]=dist;
# | 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... |