Submission #1073550

#TimeUsernameProblemLanguageResultExecution timeMemory
1073550allin27xStations (IOI20_stations)C++17
8 / 100
654 ms688 KiB
#include <bits/stdc++.h>
using namespace std;
#include "stations.h"
#include <vector>

const int N = 1001;
vector<int> adj[N];

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for (int i=0; i<n; i++) adj[i].clear();
	std::vector<int> labels(n);
	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++) labels[i] = i;
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if (s>t) return (s-1)/2;
	while ((t-1)/2 > s) t = (t-1)/2;
	if ((t-1)/2 == s) return t;
	return (s-1)/2;
}
#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...