Submission #1077165

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077165		mindiyak	Stations (IOI20_stations)	C++14	16 / 100	630 ms	968 KiB

stations

#include "stations.h"
#include <vector>
#include <queue>
#include <iostream>

#include <algorithm>
using namespace std;

vector<vector<int>> paths(1001);
vector<int> dist(1001,-1);

void dfs(int pos,int len){
	if(dist[pos] != -1)return;
	dist[pos] = len;
	for(int i:paths[pos])dfs(i,len+1);
}


std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	paths = vector<vector<int>>(1001);
	dist = vector<int>(1001,-1);

	for(int i = 0;i<n-1;i++){
		paths[u[i]].push_back(v[i]);
		paths[v[i]].push_back(u[i]);
	}

	int head = 0;
	for (int i = 0; i < n; i++) {
		if(paths[i].size() > 2){
			head = i;
		}
	}

	dist[head] = 0;
	int cnt = 1;
	for(int i:paths[head]){
		dfs(i,cnt*1000);
		cnt ++;
	}

	// cerr << head << endl;
	for (int i = 0; i < n; i++) {
		labels[i] = dist[i];
		// cerr << labels[i] << " ";
	}
	// cerr << endl;
	return labels;
}

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

	if(s == 0){
		for (int v : c)
			if (v/1000 == t/1000)
				return v;
	}

	for (int v : c)
        if (v == t)
            return t;
		
	if((t/1000) != (s/1000))return c[0];
	if(t>=s)return c[1];
	return c[0];
}

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