# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199566 | SamAnd | Klasika (COCI20_klasika) | C++17 | 5102 ms | 487632 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 m_p make_pair
const int N = 200005;
int n, m;
pair<int, int> b[N];
vector<int> a[N];
int d[N];
int ti, tin[N], tout[N];
void dfs(int x)
{
tin[x] = ++ti;
for (int i = 0; i < a[x].size(); ++i)
{
int h = a[x][i];
dfs(h);
}
tout[x] = ti;
}
int z;
int t[N * 32][2];
set<int> s[N * 32];
void ubd(int x, int y)
{
int pos = 0;
for (int i = 30; i >= 0; --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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |