Submission #1183597

#TimeUsernameProblemLanguageResultExecution timeMemory
1183597inesfiStations (IOI20_stations)C++20
0 / 100
300 ms564 KiB
#include "stations.h"
#include<bits/stdc++.h>
using namespace std;

const int TAILLEMAXI=1002;
vector<int> adja[TAILLEMAXI];
int num[TAILLEMAXI];
int dejavu[TAILLEMAXI];
int ec;

void dfs(int a){
	if (dejavu[a]==1){
		return ;
	}
	dejavu[a]=1;
	num[a]=ec;
	ec++;
	for (int i:adja[a]){
		dfs(i);
	}
}

vector<int> label(int nbstations,int k,vector<int> u,vector<int> v) {
	vector<int> rep;
	rep.clear();
	for (int i=0;i<nbstations-1;i++){
		adja[u[i]].push_back(v[i]);
		adja[v[i]].push_back(u[i]);
	}
	dfs(0);
	for (int i=0;i<nbstations;i++){
		rep.push_back(num[i]);
	}
	return rep;
}

int find_next_station(int s,int t,vector<int> voisins) {
	return voisins[0];
	if (t<=s or t<=voisins[0]){
		return voisins[0];
	}
	int a=0;
	while (a<(int)voisins.size() and t>=voisins[a]){
		a++;
	}
	a--;
	return voisins[a];
}
#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...