# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223756 | johutha | Railway (BOI17_railway) | C++17 | 242 ms | 61036 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 <iostream>
#include <vector>
#include <algorithm>
#include <set>
#define int int64_t
using namespace std;
int log2(int n)
{
int r = 0;
for (; n; n /= 2) r++;
return r;
}
struct tree
{
int n;
vector<vector<int>> adjlist;
vector<vector<int>> st;
vector<vector<int>> en;
vector<int> res;
set<int>* smldfs(int curr, int par)
{
set<int>* rs = new set<int>(st[curr].begin(), st[curr].end());
for (auto next : adjlist[curr])
{
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |