Submission #793282

#	Time	Username	Problem	Language	Result	Execution time	Memory
793282		MODDI	Stations (IOI20_stations)	C++17	0 / 100	604 ms	660 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
int cnt;
vector<int> G[1001], labels;
void dfs(int at, int p, int d){
	if(!d)	labels[at] = cnt++;
	for(auto next : G[at]){
		if(next != p)
			dfs(next, at, d^1);
	}
	if(d)	labels[at] = cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v){
	cnt = 0;
	for(int i = 0; i < n; i++){
			G[i].clear();
	}
	for(int i = 0; i < n - 1; i++){
		G[u[i]].pb(v[i]);
		G[v[i]].pb(u[i]);
	}
	labels.resize(n);
	dfs(0, -1, 0);
	return labels;
}
int find_next_station(int s, int t, vector<int> c){
	if(s < c[0]){
		if(t < s ||  t >= c.back())	return c.back();
		return *lower_bound(c.begin(), c.end(), t);
	}
	if(t > s || t <= c[0])	return c[0];
	return *--lower_bound(c.begin(), c.end(), t);
}

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