Submission #1292857

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292857		gustavo_d	기지국 (IOI20_stations)	C++20	5 / 100	398 ms	520 KiB

stations

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

const int MAXN = 1000;

int depth[MAXN];
vector<int> adj[MAXN];

void dfs(int v, int pai) {
	for (int viz : adj[v]) {
		if (viz == pai) continue;
		depth[viz] = depth[v] + 1;
		dfs(viz, v);
	}
}

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

	dfs(0, -1);

	int mx = 0;
	for (int i=0; i<n; i++) {
		if (depth[i] > depth[mx]) {
			mx = i;
		}
	}

	// cerr << mx << endl;

	depth[mx] = 0;
	dfs(mx, -1);

	vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = depth[i];
		// cerr << depth[i] << ' ';
	}
	// cerr << '\n';
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if (s > t) {
		return s-1;
	} else return s+1;
}

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