Submission #828800

#	Time	Username	Problem	Language	Result	Execution time	Memory
828800		Minindu206	Stations (IOI20_stations)	C++14	0 / 100	3054 ms	2097152 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[1005], vals;
int t = 0;
void dfs(int node, int p)
{
	if (p == -1 || vals[p] == 0)
		vals[node] = t++;
	for (auto a : adj[node])
	{
		if (a != p)
			dfs(a, node);
	}
	if (vals[node] == 0)
		vals[node] = t++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
	for (int i = 0; i < n - 1; i++)
	{
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	vals.resize(n, 0);
	dfs(0, -1);

	// for (int i = 0; i < n; i++)
	// 	cout << vals[i] << "\n";
	// cout << '\n';
	return vals;
}

int find_next_station(int s, int t, vector<int> c)
{

	if (c.back() < s)
		reverse(c.begin(), c.end());
	for (int x : c)
		if (min(s, x) <= t && t <= max(s, x))
			return x;
	return c.back();
}

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