Submission #605865

#	Time	Username	Problem	Language	Result	Execution time	Memory
605865		polya	Stations (IOI20_stations)	C++14	0 / 100	722 ms	520 KiB

stations

#include "stations.h"
#include <vector>
 
using namespace std;
 
vector<int> adj[1004];
vector<int> labels;
bool vis[1004];
int cnt = 0;
 
void dfs(int n) {
    if (vis[n]) return;
	labels[n] = cnt++, vis[n] = true;
	for (auto &i : adj[n]) dfs(i);
}
 
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	labels.resize(n, -1);
	for (int i=0; i<n-1; i++) {
		adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
	}
	for (int i=0; i<n; i++) {
		if (adj[i].size() == 1) 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;
}

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