# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308279 | Peti | Stations (IOI20_stations) | C++14 | 1134 ms | 1280 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<vector<int>> g;
vector<bool> volt;
int ido = 0;
void Bejar(vector<int> &labels, int akt, int t)
{
volt[akt] = true;
if(t%2 == 0)
labels[akt] = ido / 2;
ido++;
for(int x : g[akt])
if(!volt[x])
Bejar(labels, x, t+1);
if(t%2 == 1)
labels[akt] = ido / 2;
ido++;
return;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
# | 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... |