Submission #305692

#	Time	Username	Problem	Language	Result	Execution time	Memory
305692		arthurconmy	Stations (IOI20_stations)	C++14	5 / 100	1101 ms	1152 KiB

stations

#ifndef ARTHUR_LOCAL
	#include "stations.h"
#endif

#ifdef ARTHUR_LOCAL
	#include <bits/stdc++.h>
#endif

using namespace std;
using ll = long long;

vector<int> adj[1001];
bool vis[1001];
int curv;
int labellist[1001];

void dfs(int v)
{
	vis[v]=1;
	labellist[v]=curv++;

	for(auto u:adj[v])
	{
		if(!vis[u]) dfs(u);
	}
}

vector<int> label(int n, int k, vector<int> U, vector<int> V) 
{
	for(int i=0; i<n; i++)
	{
		adj[i].clear();
		vis[i]=0;
	}

	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-1; i++)
	{
		if(adj[i].size() == 1)
		{
			curv=0;
			dfs(i);
			break;
		}
	}

	vector<int> ans;

	for(int i=0; i<n; i++)
	{
		ans.push_back(labellist[i]);
	}

	return ans;
}

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

	if(s < t)
	{
		return C[1];
	}

	else
	{
		return C[0];
	}
}

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