Submission #593827

#TimeUsernameProblemLanguageResultExecution timeMemory
5938271ne기지국 (IOI20_stations)C++14
0 / 100
3031 ms2097152 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> labels(n);
	vector<vector<int>>adj(n);
	for (int i = 0;i<n;++i){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	int time = 0;
	function<void(int,int)>dfs = [&](int x,int par){
		labels[x] = time++;
		for (auto y:adj[x]){
			if (y == par)continue;
			dfs(y,x);
		}
	};
	dfs(0,-1);
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if ((int)c.size() == 1)return c[0];
	if ((int)c.size() == 2){
		if (c[0] > c[1] && c[0] <= t){
			return c[0];
		}
		if (c[1] > c[0] && c[1] <=t){
			return c[1];
		}
		if (c[0] <= t)return c[0];
		return c[1];
	}
	return c[0];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...