Submission #1183548

#	Time	Username	Problem	Language	Result	Execution time	Memory
1183548		inesfi	기지국 (IOI20_stations)	C++20	0 / 100	3057 ms	2162688 KiB

stations

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

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

void dfs(int a,int vient){
	num[a]=ec;
	ec++;
	for (int i:adja[a]){
		if (i!=vient){
			dfs(i,a);
		}
	}
}

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,-1);
	for (int i=0;i<nbstations;i++){
		rep.push_back(num[i]);
		//cerr<<num[i]<<" ";
	}
	//cout<<endl;
	return rep;
}

int find_next_station(int s,int t,vector<int> voisins) {
	cout<<42<<endl;
	return 0;
	if (t<=s){
		//cout<<voisins[0]<<endl;
		return voisins[0];
	}
	int a=0;
	while (a<(int)voisins.size() and t>=voisins[a]){
		//cout<<a<<endl;
		a++;
	}
	a--;
	return voisins[a];
}

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