제출 #1186681

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186681		owoovo	기지국 (IOI20_stations)	C++20	0 / 100	308 ms	572 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> e[1010];
int lb[1010],cnt;
void dfs(int now,int last,int lv){
	if(lv==1){
		lb[now]=cnt;
		cnt++;
	}
	for(auto x:e[now]){
		if(x==last)continue;
		dfs(x,now,lv^1);
	}
	if(lv==0){
		lb[now]=cnt;
		cnt++;
	}
	return;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	cnt=0;
	for(int i=0;i<n;i++)e[i].clear();
	for(int i=0;i<n-1;i++)e[u[i]].push_back(v[i]),e[v[i]].push_back(u[i]);
	dfs(0,0,0);
	vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = lb[i];
		cerr<<lb[i]<<" ";
	}	
	cerr<<"\n";
	return labels;
}

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

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