제출 #1330058

#제출 시각아이디문제언어결과실행 시간메모리
1330058duckindog기지국 (IOI20_stations)C++20
0 / 100
410 ms584 KiB
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);

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

	vector<int> st(n);
	int timer = 0;
	function<void(int, int)> dfs = [&](int u, int p) {
		st[u] = timer++;
		for (int v : adj[u]) {
			if (v == p) continue;
			dfs(v, u);
		}
	};
	dfs(0, -1);

	for (int i = 0; i < n; i++) {
		labels[i] = st[i];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if (t < s) {
		assert(c[0] < s);
		return c[0];
	}
	int answer = c.back();
	for (const auto& v : c) { 
		if (v > t) { 
			answer = *prev(&v);
			break;
		}
	}
	return answer;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...