Submission #1257929

#	Time	Username	Problem	Language	Result	Execution time	Memory
1257929		Nurislam	Stations (IOI20_stations)	C++20	0 / 100	306 ms	600 KiB

stations

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


using namespace std;

vector<int> label(int n, int k, vector<int> u,vector<int> v) {
	vector<vector<int>> g(n);
	for(int i = 0; i+1 < n; i ++ ) {
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	};
	
	int ct = 0;
	vector<int> l(n);
	
	function<void(int,int,int)> dfs = [&](int ps,int pr, int tp) {
		if(tp) l[ps] = ct ++ ;
		
		for(int to : g[ps] )
			if(to != pr)
				dfs(to,ps,tp^1);
		
		if(!tp) l[ps] = ct ++ ;
	};
	dfs(0,0,0);
	
	return l;
};


int find_next_station(int s, int t, vector<int> g) {
	
	for(int i : g) if(t == i) return i;
	
	if(s < g[0]){
		if(t < s)return g.back();
		int ans = g.back();
		for(int i : g)
			if(t <= i)
				ans = i;
		
		return ans;
	}
	
	if(t > s) return g[0];
	reverse(g.begin(), g.end());
	int ans = g.back();
	for(int i : g) 
		if(i <= t) 
			ans = i;
	return ans;	
};

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