제출 #1059431

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059431		ArthuroWich	Stations (IOI20_stations)	C++17	0 / 100	504 ms	688 KiB

stations

#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> adj[1005];
int timer = 0, en[1005];
void dfs(int i, int p) {
	for (int j : adj[i]) {
		if (j == p) {
			continue;
		}
		dfs(j, i);
	}
	en[i] = timer;
	timer++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	timer = 0;
	for (int i = 0; i <= n; i++) {
		adj[i].clear();
		en[i] = 0;
	}
	for (int i = 0; i < n-1; i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	dfs(0, -1);
	for (int i = 0; i < n; i++) {
		labels[i] = en[i];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	sort(c.begin(), c.end());
	for (int i : c) {
		if (t <= i) {
			return i;
		}
	}
	return c[0];
}

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