Submission #430371

#	Time	Username	Problem	Language	Result	Execution time	Memory
430371		APROHACK	Stations (IOI20_stations)	C++14	0 / 100	3 ms	2640 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#include <vector>
#define PB push_back
using namespace std;
vector<int>ady[100001];
int lab[100001];
long long cur = 0;
void dfs(int node, int parent){
	cout<<node<<endl;
	for(int i= 0 ; i < ady[node].size() ; i++){
		if(ady[node][i]==parent)continue;
		dfs(ady[node][i], node);
	}
	lab[node]=cur++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	cur=0;
	vector<int>ab;
	for(int i = 0 ; i <= n-1 ; i++){
		ady[i].clear();
	}
	for(int i = 0 ; i < n-1 ; i++){
		ady[u[i]].PB(v[i]);
		ady[v[i]].PB(u[i]);
	}
	dfs(0, -1);
	for(int i = 0 ; i <= n-1 ; i++){
		ab.PB(lab[i]);
		cout<<lab[i]<<" ";
	}
	return ab;
}

int find_next_station(int s, int t, vector<int>c) {
	
	//for(int i = 0 ; i <= ls ; i++){
	//	cout<<c[i]<<" ";
	//}
	//cout<<endl<<s<<" "<<t<<endl;
	int padre;
	if(c[0]>s){//califica de una
		padre = c[c.size()-1];
		if(t<s||t>c[c.size()-2])return padre;
		else{
			int li=0, ls=c.size()-2, pos;
			pos=(li+ls)/2;
			while(li+1<ls){
				//cout<<li<<" "<<ls<<endl;
				pos=(li+ls)/2;
				if(c[pos]>=t)ls=pos;
				else li=pos;
			}
			for(int i = ls ; i >= li ; i--){
				if(c[i]>=t)pos=i;
			}
			return c[pos];
		}
	}else{ // se espera
		padre = c[0];
		if(t>s||t<c[1])return padre;
		else{
			int li=0, ls=c.size()-2, pos;
			pos=(li+ls)/2;
			while(li+1<ls){
				//cout<<li<<" "<<ls<<endl;
				pos=(li+ls)/2;
				if(c[pos]<=t)li=pos;
				else ls=pos;
			}
			for(int i = li ; i <= ls ; i++){
				if(c[i]>=t)pos=i;
			}
			return c[pos];
		}
	}
	//pos=(li+ls)/2;
	//cout<<"a "<<c[pos]<<endl;
	//return c[pos];
}

Compilation message (stderr)

stations.cpp: In function 'void dfs(int, int)':
stations.cpp:11:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for(int i= 0 ; i < ady[node].size() ; i++){
      |                 ~~^~~~~~~~~~~~~~~~~~

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