Submission #380296

#	Time	Username	Problem	Language	Result	Execution time	Memory
380296		SuhaibSawalha1	Stations (IOI20_stations)	C++17	0 / 100	993 ms	1012 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> adj;
int n;
vector<int> lb, ord;

void dfs (int u, int p = -1) {
	ord.push_back(u);
	for (int v : adj[u]) {
		if (v ^ p) {
			dfs(v, u);
		}
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	::n = n;
	ord.clear();
	adj.assign(n, {});
	lb.resize(n);
	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; ++i) {
		if (adj[i].size() == 1) {
			dfs(i);
			break;
		}
	}
	for (int i = 0; i < n; ++i) {
		lb[ord[i]] = i;
	}
	return lb;
}

int find_next_station(int s, int t, vector<int> c) {
	return s > t ? c[0] : c[1];
}

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