Submission #410917

#	Time	Username	Problem	Language	Result	Execution time	Memory
410917		SuhaibSawalha1	Stations (IOI20_stations)	C++17	0 / 100	1351 ms	4524 KiB

stations

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

int go[1000][1000];
vector<vector<int>> adj;
int U, V;

void dfs (int u, int p) {
	go[U][u] = V;
	for (int v : adj[u]) {
		if (v != p) {
			dfs(v, u);
		}
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> a(n);
	iota(a.begin(), a.end(), 0);
	adj.assign(n, {});
	for (int i = 0; i < n - 1; ++i) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	for (U = 0; U < n; ++U) {
		go[U][U] = U;
		for (int v : adj[U]) {
			V = v;
			dfs(V, U);
		}
	}
	return a;
}

int find_next_station(int s, int t, std::vector<int> c) {
	return go[s][t];
}

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