# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
535274 | groshi | Railway (BOI17_railway) | C++17 | 220 ms | 23364 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<utility>
using namespace std;
int poziomy[19][100100];
struct wi{
vector<int> Q;
int wiel=0;
int poz=0;
int wchodze=0;
int wynik=0;
int ktora=0;
int suma=0;
}*w;
int jestem=1;
void ustaw_poziomy(int x)
{
for(int i=1;i<19;i++)
poziomy[i][x]=poziomy[i-1][poziomy[i-1][x]];
}
void dfs(int x,int ojciec)
{
w[x].wchodze=jestem;
jestem++;
for(int i=0;i<w[x].Q.size();i+=2)
{
int pomoc=w[x].Q[i];
if(pomoc==ojciec)
{
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |