Submission #772584

#	Time	Username	Problem	Language	Result	Execution time	Memory
772584		khshg	Stations (IOI20_stations)	C++14	0 / 100	692 ms	464 KiB

stations

#include"stations.h"
#include<bits/stdc++.h>
using namespace std;

vector<vector<int>> adj;

vector<int> label(int N, int K, vector<int> u, vector<int> v) {
	adj.resize(N);
	for(auto& I : adj) I.clear();
	for(int i = 0; i < (int)u.size(); ++i) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	vector<int> flat(N);
	int root = -1;
	for(int i = 0; i < N; ++i) {
		if((int)adj[i].size() == 1) { root = i; break; }
	}
	vector<int> labels(N);
	int cur = root, prev = -1;
	for(int i = 0; ; ++i) {
		flat[i] = cur;
		labels[cur] = i;
		if(i == N - 1) break;
		bool f = (adj[cur][0] == prev);
		prev = cur;
		cur = adj[i][f];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if(s > t) {
		return s - 1;
	}
	return s + 1;
}

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