제출 #312006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312006		htc001	기지국 (IOI20_stations)	C++14	100 / 100	1085 ms	1140 KiB

stations

#include<bits/stdc++.h>
#include "stations.h"
using namespace std;

const int N=1005;
int tme;
vector<int> lab;
vector<int> nei[N];

void dfs(int x,int p,int lv){
	if(lv) lab[x-1]=tme++;
	for(int i=0;i<int(nei[x].size());i++){
		int to=nei[x][i];
		if(to!=p) dfs(to,x,lv^1);
	}
	if(!lv) lab[x-1]=tme++;
}

vector<int> label(int n,int k,vector<int> u,vector<int> v){
	lab.clear();
	lab.resize(n);
	tme=0;
	for(int i=0;i<N;i++) nei[i].clear();
	for(int i=0;i<n-1;i++){
		u[i]++;v[i]++;
//		printf("%d %d\n",u[i],v[i]);
		nei[u[i]].push_back(v[i]);
		nei[v[i]].push_back(u[i]);
	}
	dfs(1,-1,0);
	return lab;
}

int find_next_station(int s,int t,vector<int> c){
	vector<int>::iterator it;
	if(s<c[0]){
		if(s<t&&t<=c[int(c.size())-1]){
			it=lower_bound(c.begin(),c.end(),t);
			return *it;
		}else return c[int(c.size())-1];
	}else{
		if(c[0]<=t&&t<s){
			it=upper_bound(c.begin(),c.end(),t);
			it--;
			return *it;
		}else return c[0];
	}
}

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