Submission #1292847

#TimeUsernameProblemLanguageResultExecution timeMemory
1292847gustavo_dStations (IOI20_stations)C++20
0 / 100
395 ms432 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1000;

// int depth[MAXN];
// vector<int> adj[MAXN];

// void dfs(int v, int pai) {
// 	for (int viz : adj[v]) {
// 		if (viz == pai) continue;
// 		depth[viz] = depth[v] + 1;
// 		dfs(viz, v);
// 	}
// }

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	// for (int i=0; i<n; i++) {
	// 	adj[i].clear();
	// }
	// for (int i=0; i<n-1; i++) {
	// 	int a = u[i], b = v[i];
	// 	adj[a].push_back(b);
	// 	adj[b].push_back(a);
	// }

	// dfs(0, -1);

	vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = i+1;
	}
	return labels;
}

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