Submission #979302

#	Time	Username	Problem	Language	Result	Execution time	Memory
979302		fv3	Stations (IOI20_stations)	C++14	0 / 100	3155 ms	2097152 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"

using namespace std;

vector<int> lbl;
vector<vector<int>> adj;

void DFS(int index, int last, int id)
{
	lbl[index] = id;
	for (auto node : adj[index])
	{
		if (node == last) continue;
		DFS(node, index, id + 1);
	}
}

vector<int> label(int N, int K, vector<int> U, vector<int> V)
{
	adj.resize(N);
	lbl.resize(N);

	for (int i = 0; i < N - 1; i++)
	{
		adj[U[i]].push_back(V[i]);
		adj[V[i]].push_back(U[i]);
	}

	for (int i = 0; i < N; i++)
	{
		if (adj[i].size() == 1)
		{
			DFS(i, -1, 0);
			break;
		}
	}
	return lbl;
}

int find_next_station(int S, int T, vector<int> C)
{
	if (T > S)
		return S + 1;
	else
		return S - 1;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61