Submission #1229334

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229334		Rokas159	기지국 (IOI20_stations)	C++20	0 / 100	301 ms	580 KiB

stations

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

vector<vector<int>> adj;
vector<int> labels;
vector<bool> vis;
int cnt = 0;

void dfs(int v) {
	vis[v] = true;
	labels[v] = cnt++;
	for (int u : adj[v]) {
		if (!vis[u]) {
			dfs(u);
		}
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	adj.resize(n);
	labels.resize(n);
	vis.resize(n, false);

	for (int i = 0; i < u.size(); i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}

	dfs(0);

	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	auto upper = upper_bound(c.begin(), c.end(), t);

	if (upper != c.begin()) {
		upper--;
	}

	return *upper;
}

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