Submission #1280328

#	Time	Username	Problem	Language	Result	Execution time	Memory
1280328		Jawad_Akbar_JJ	Stations (IOI20_stations)	C++17	0 / 100	397 ms	540 KiB

stations

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

using namespace std;
vector<int> nei[1005], lbl;
int cur;

void dfs(int u, int p){
	for (int i : nei[u]){
		if (i == p)
			continue;
		dfs(i, u);
	}
	lbl[u] = cur++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v){
	for (int i=0;i<n-1;i++){
		nei[v[i]].push_back(u[i]);
		nei[u[i]].push_back(v[i]);
	}

	lbl.resize(n);
	cur = 0;
	dfs(0, 0);

	for (int i=0;i<n;i++)
		nei[i].clear();
	return lbl;
}

int find_next_station(int s, int t, vector<int> c){
	for (int i=1;i<c.size();i++)
		if (t >= c[i-1] and t < c[i])
			return c[i-1];
	return c.back();
}

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