Submission #1285403

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285403		farica	Stations (IOI20_stations)	C++20	0 / 100	396 ms	588 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;
using vi = vector<int>;

vi labels;
vector<vi>adjL;

int dfs(int pos, int cnt, int state, int prev=-1) {
	if(!state) labels[pos] = cnt;
	for(int adj: adjL[pos]) {
		if(adj == prev) continue;
		cnt = dfs(adj, cnt+1, (state+1)%2, pos);
	}
	if(state) labels[pos] = cnt;
	return cnt;
}

vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	labels.resize(n);
	adjL.assign(n, vi());
	for(int i=0; i<n-1; ++i) {
		adjL[u[i]].push_back(v[i]);
		adjL[v[i]].push_back(u[i]);
	}
	dfs(0, 0, 0);
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int n = (int)c.size();
	if(s < c[0]) { // s - in[s]
		if(s) {
			int prnt = c[n-1];
			if(n == 1) return prnt;
			if(t < s or t >= c.back()) return prnt;
			--n;
		}
		for(int i=0; i<n; ++i) {
			if(t <= c[i]) return c[i];
		} 
	} else { // s - ot[s]
		int prnt = c[0];
		if(n == 1) return prnt;
		if(c[0] >= t or t > s) return prnt;
		for(int i=n-1; i>0; --i) {
			if(c[i] <= t) return c[i];
		}
	}
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^

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