Submission #1080009

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080009		Faisal_Saqib	기지국 (IOI20_stations)	C++17	0 / 100	3054 ms	2097152 KiB

stations

#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N=1e3+100;
vector<int> ma[N];
vector<int> labels;
void dfs(int x,int v,int p)
{
	labels[x]=v;
	for(auto y:ma[x])
	{
		if(y==p)continue;
		dfs(y,v+1,x);
	}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	labels.resize(n,0);
	for(int i=0;i<(n-1);i++)
	{
		ma[u[i]].push_back(v[i]);
		ma[v[i]].push_back(u[i]);
	}
	for(int i=0;i<n;i++)
	{
		if(ma[i].size()==1)
		{
			dfs(i,0,-1);
		}
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	return *max_element(begin(c),end(c));
}

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