Submission #1073770

#	Time	Username	Problem	Language	Result	Execution time	Memory
1073770		thatsgonzalez	Stations (IOI20_stations)	C++14	0 / 100	1255 ms	2097152 KiB

stations

#include "stations.h"
#include <vector>

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


#define s second
#define f first
#define pb push_back

vector <int> sub_tree;
vector <int> labels;
vector <vector<int>> g;
int mx , mn;

int dfs(int node, int p){

	for(auto &x: g[node]){
		if(x == node) continue;

		sub_tree[node]+=dfs(x,node);

	}

	return sub_tree[node]=sub_tree[node]+1;

}

void calc_labels(int node, int p, int t){

	if(t){
		labels[node] = mn+sub_tree[node]-1;
	}
	else{
		labels[node] = mn; mn++;
	}

	for(auto &x: g[node]){
		if(x == p) continue;

		calc_labels(x,node,t^1);
	}


}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	
	sub_tree.assign(n,0);
	g.resize(n);

	for(int i = 0; i<n-1; i++){
		g[u[i]].pb(v[i]);
		g[v[i]].pb(u[i]);
	}


	dfs(0,-1);
	mn = 1;
	calc_labels(0,-1,1);


	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	
	if(c[0]>s){
		int l = s;
		for(int i = 0; i<c.size()-1; i++){
			if(t>=l and t<=c[i]){
				return c[i];
			}
			else l = c[i]+1;
		}
		return c.back();
	}
	else{
		int r = s;
		for(int i = c.size()-1; i; i--){
			if(t>=c[i] and t<=r) return c[i];
			else r = c[i]-1;
		}
		return c[0];
	}

}

Compilation message (stderr)

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

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