# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
591791 | APROHACK | Stations (IOI20_stations) | C++14 | 902 ms | 788 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>
#include <vector>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
const int N = 1005;
vector<int>adj[N];
bool vis[N];
int cur = 0;
int labeled[N];
void dfs(int node, bool in){
vis[node]=true;
if(in)labeled[node]=cur++;
for(int i = 0 ;i < adj[node].size() ; i++){
if(!vis[adj[node][i]])dfs(adj[node][i], !in);
}
if(!in)labeled[node]=cur++;
}
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
cur=0;
memset(vis, false, sizeof vis);
for(int i = 0 ; i < n ; i++){
adj[i].clear();
}
vector<int> labels(n);
for(int i = 0 ; i < n-1 ; 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |