Submission #831153

#	Time	Username	Problem	Language	Result	Execution time	Memory
831153		Baytoro	Stations (IOI20_stations)	C++17	100 / 100	819 ms	752 KiB

stations

#include "stations.h"
//#include "stub.cpp"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> label(int n, int k,vector<int> u, vector<int> v) {
	vector<vector<int>> g(n);
	for(int i=0;i<n-1;i++){
		g[u[i]].pb(v[i]);
		g[v[i]].pb(u[i]);
	}
	vector<int> ans(n),d(n,-1);
	int cnt=0;
	function<void(int)> dfs=[&](int x){
		if(d[x]%2==0) ans[x]=cnt++;
		for(auto it: g[x]){
			if(d[it]!=-1) continue;
			d[it]=d[x]+1;
			dfs(it);
		}
		if(d[x]%2) ans[x]=cnt++;
	};
	d[0]=0;
	dfs(0);
	return ans;
}

int find_next_station(int s, int t, vector<int> c) {
	if(s>=c.back()){
		if(t>s || t<c[0]) return c[0];
		return c[int(lower_bound(c.begin(),c.end(),t+1)-c.begin())-1];
	}
	else{
		if(t<s || t>c.back()) return c.back();
		return c[int(lower_bound(c.begin(),c.end(),t)-c.begin())];
	}
}

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