# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498663 | model_code | Speedrun (RMI21_speedrun) | C++17 | 264 ms | 924 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.
// speedrun_100_panaete.cpp
#include <bits/stdc++.h>
#include "speedrun.h"
using namespace std;
static const int N=1002;
static int n,i,j,k,p,T[N],F[N],D[N],S[N],E[2*N];
static vector<int> v[N];
static bitset<N> used;
static void dfs(int nod)
{
E[++k]=nod;
for(auto vec:v[nod])
if(vec!=T[nod])
{
T[vec]=nod;
dfs(vec);
E[++k]=nod;
}
}
/// Hint
void assignHints(int whatever,int N, int A[], int B[])
{
n=N;T[1]=1;used[1]=1;
setHintLen(20);
for (int i = 1; i < n; ++i){v[A[i]].push_back(B[i]);v[B[i]].push_back(A[i]);}
dfs(1);
for(i=j=k=1;i<=n;i++)
{
# | 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... |