제출 #1206021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1206021		ansori	Stations (IOI20_stations)	C++17	0 / 100	306 ms	548 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
vector<int> g[N] , lab;
int tim;
void dfs(int v , int pr){
	for(auto to : g[v]){
		if(to != pr){
			dfs(to , v);
		}
	}
	lab[v] = (++ tim);
} 

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	lab = vector<int> (n , 0);
	for(int i = 0;i < n; ++ i) g[i].clear();
	for(int i = 0;i < n - 1; ++ i){
		g[v[i]].push_back(u[i]);
		g[u[i]].push_back(v[i]);
	}
	tim = -1;
	dfs(0 , -1);
	//for(auto to : lab) cout << to << ' ';
	return lab;
}

int find_next_station(int s, int t, std::vector<int> c) {
	// cout << s << ' ' << t << ' ';
	// for(auto to : c) cout << to << ' ';
	// cout << '\n';
	if(s == t) return s;
	for(int i = 0;i < c.size(); ++ i){
		if(c[i] >= t) return c[i];
	}
	return c.back();
}

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