Submission #605945

#TimeUsernameProblemLanguageResultExecution timeMemory
605945polyaStations (IOI20_stations)C++14
0 / 100
977 ms644 KiB
#include "stations.h"
#include <vector>
 
using namespace std;
 
vector<int> adj[1004];
vector<int> labels;
int cnt = 0;
 
void dfs(int nn) {
    if (labels[nn] != 1000) return;
	labels[nn] = cnt++;
	for (auto &i : adj[nn]) dfs(i);
}
 
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	labels.resize(n, 1000);
	for (int i=0; i<n-1; i++) {
		adj[u[i]].emplace_back(v[i]), adj[v[i]].emplace_back(u[i]);
	}
	for (int i=0; i<n; i++) {
		dfs(i);
	}
    return labels;
}
 
int find_next_station(int s, int t, std::vector<int> c) {
	if (s < t) return s+1;
	else return s-1;
}
#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...