Submission #1362706

#TimeUsernameProblemLanguageResultExecution timeMemory
1362706cowkimStations (IOI20_stations)C++20
0 / 100
291 ms564 KiB
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
void dfs(int x, int p, int& i, vector<int>& labels,vector<vector<int>>& adj){
	labels[x] = i++;
	for(auto node : adj[x]){
		if(node == p) continue;
		dfs(node,x,i,labels,adj);
	}
}																
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<vector<int>> adj(n);
	for(int i = 0; i< u.size(); i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}

	std::vector<int> labels(n);
	int i = 0;
	dfs(0,0,i,labels,adj);
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	sort(c.begin(),c.end());
	for(int i = c.size()-1; i >= 0; i--){
		if(c[i] <= t) return c[i];
	}
	return c[0];
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...