# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1042667 | parsadox2 | Stations (IOI20_stations) | C++17 | 538 ms | 1200 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int n , tim , st_tim[N] , fn_tim[N] , dis[N];
vector <int> adj[N];
void Dfs(int v , int p = -1)
{
st_tim[v] = tim;
tim++;
for(auto u : adj[v]) if(u != p)
{
dis[u] = (dis[v] ^ 1);
Dfs(u , v);
}
fn_tim[v] = tim;
tim++;
}
vector<int> label(int nn, int k, vector<int> u, vector<int> v) {
n = nn;
for(int i = 0 ; i < n ; i++)
{
dis[i] = 0;
adj[i].clear();
}
tim = 0;
# | 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... |