제출 #307118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307118		dxz05	Stations (IOI20_stations)	C++14	0 / 100	3107 ms	2097156 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1111;

vector<int> g[MAXN];
vector<int> vec;
void dfs(int v, int p){
    vec.push_back(v);
    for (int u : g[v]){
        if (u != p) dfs(u, v);
    }
}

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

	int idx = 0;
	for (int i = 0; i < n; i++){
        if (g[i].size() == 1) idx = i;
	}

	dfs(idx, -1);
	for (int i = 0; i < n; i++){
        labels[vec[i]] = i;
	}
	return labels;
}

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

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