제출 #1234157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1234157		SpyrosAliv	기지국 (IOI20_stations)	C++20	5 / 100	312 ms	492 KiB

stations

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

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<vector<int>> tree(n);
	for (int i = 0; i < n-1; i++) {
		tree[u[i]].push_back(v[i]);
		tree[v[i]].push_back(u[i]);
	}
	int f = 0;
	for (int i = 0; i < n; i++) {
		if (tree[i].size() == 1) f = i;
	}
	vector<int> label(n, -1);
	for (int i = 0; i < n; i++) {
		label[f] = i;
		for (auto next: tree[f]) {
			if (label[next] == -1) {
				f = next;
				break;
			}
		}
	}
	//for (int i = 0; i < n; i++) cout << label[i] << " ";
	//cout << "\n";
	return label;
}

int find_next_station(int s, int t, vector<int> c) {
	int ch = c.size();
	sort(c.begin(), c.end());
	if (t < s || ch == 1) return c[0];
	else return c[1];
}

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