제출 #1073534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073534		allin27x	Stations (IOI20_stations)	C++17	5 / 100	635 ms	948 KiB

stations

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

const int N = 1001;
vector<int> adj[N];
vector<int> order;

void dfs(int i, int p) {
	order.push_back(i);
	for (int c: adj[i]) {
		if (c == p) continue;
		dfs(c,i);
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	order.clear();
	for (int i=0; i<n; i++) adj[i].clear();
	std::vector<int> labels(n);
	for (int i=0; i<n-1; i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	for (int i=0; i<n; i++) {
		if (adj[i].size()==1) {
			dfs(i,i); break;
		}
	}
	for (int i=0; i<n; i++) {
		labels[order[i]] = i;
	}
	return labels;
}

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

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