# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097762 | quangminh412 | Putovanje (COCI20_putovanje) | C++14 | 77 ms | 25168 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;
/*
John Watson
Handle codeforces : quangminh98
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const int maxn = 2e5 + 9;
struct Data
{
int v, c1, c2;
Data() = default;
Data(int v, int c1, int c2) : v(v), c1(c1), c2(c2) {}
};
vector<Data> adj[maxn];
int diff[maxn], par[20][maxn], h[maxn];
int n;
void DFS(int u, int p = -1)
{
for (Data nxt : adj[u])
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... |