Submission #531818

#	Time	Username	Problem	Language	Result	Execution time	Memory
531818		EqualTurtle	Stations (IOI20_stations)	C++14	0 / 100	913 ms	584 KiB

stations

#include "stations.h"
#include <vector>
using namespace std;

constexpr int MAXN = 1e3 + 7;
vector <int> graf[MAXN];

int order;
int depth[MAXN];
vector<int> labels;
void dfs(int w)
{
	for (int i : graf[w])
	{
		if (i == 0 || depth[i] > 0)
			continue;
		depth[i] = depth[w] + 1;
		if (depth[i] % 2 == 0)
			labels[i] = order++;
		dfs(i);
		if (depth[i] % 2 == 1)
			labels[i] = order++;
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
	vector<int> cl(n);
	swap(cl, labels);
	for (int i = 0; i < n; i++){
		while(graf[i].size())
			graf[i].pop_back();
		depth[i] = 0;
	}
	order = 1;
	
	

	for (int i = 0; i < n; i++){
		graf[u[i]].push_back(v[i]);
		graf[v[i]].push_back(u[i]);
	}
	dfs(0);
	labels[0] = 0;
	
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if (c.size() == 1)
		return c[0];

	for (int i : c)
		if (i == t)
			return i;
	
	if (s > c.back())
	{
		if (t > s)
			return c[0];
		
		for (int i = 1; i < (int)c.size(); i++)
		{
			if (c[i] < t && (i == (int)c.size() - 1 || c[i + 1] > t))
				return c[i];
		}

		return c[0];
	}
	else
	{
		if (t > c[c.size() - 2] || t < s)
			return c.back();
		
		for (int i = 0; i < (int)c.size(); i++)
		{
			if (c[i] > t)
				return c[i];
		}

		return c.back();
	}
}

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