제출 #1062637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062637		jamjanek	Stations (IOI20_stations)	C++14	0 / 100	668 ms	944 KiB

stations

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

vector<int>graf[1010];
int pre[1010], it=-1, post[1010];
int dep[1010];
void dfs(int x, int o){
	dep[x] = dep[o]+1;
	pre[x] = ++it;
	for(auto j: graf[x])
		if(j!=o)
			dfs(j, x);
	post[x] = ++it;
}
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	int i;
	dep[0] = 0;
	for(i=0;i<n;i++)graf[i].clear();
	for(i=0;i<n-1;i++){
		graf[u[i]].push_back(v[i]);
		graf[v[i]].push_back(u[i]);
	}
	it= -1;
	dfs(0, 0);
	std::vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		if(dep[i]%2==1)
			labels[i] = pre[i];
		else labels[i] = post[i];
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(c.size()==1)return c[0];
	int maxi=0;
	for(auto j: c)
		maxi = max(maxi, j);
	bool czy=0;
	if(s>=maxi){
		s = 2001-s;
		t = 2001-s;
		for(auto &j: c)j = 2001-j;
		czy = 1;
	}
	sort(c.begin(), c.end());
	if(t<s){
		if(czy)c.back()=2001-c.back();
		return c.back();
	}
	if(s==0){
		int pom = *lower_bound(c.begin(), c.end(), t);
		if(pom)pom=2001-pom;
		return pom;
	}
	if(t>c[(int)c.size()-1])return c.back();
	int pom = *lower_bound(c.begin(), c.end(), t);
	if(pom)pom=2001-pom;
	return pom;
}

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