제출 #377833

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
377833		autumn_eel	Stations (IOI20_stations)	C++14	10 / 100	1093 ms	1060 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<int(n);i++)
using namespace std;
typedef long long ll;

static vector<vector<int>>E;
static vector<int>labels;
static int cnt=0;

void dfs(int v,int p){
	int L=cnt++;
	for(int u:E[v]){
		if(u==p)continue;
		dfs(u,v);
	}
	int R=cnt;
	labels[v]=L*1000+R;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v){
	E=vector<vector<int>>(n);
	labels=vector<int>(n);
	cnt=0;
	rep(i,n-1){
		E[u[i]].push_back(v[i]);
		E[v[i]].push_back(u[i]);
	}
	dfs(0,-1);
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int sl=s/1000,sr=s%1000;
	int tl=t/1000,tr=t%1000;
	for(int u:c){
		int ul=u/1000,ur=u%1000;
		if(ul<=sl&&sr<=ur)continue;
		if(ul<=tl&&tr<=ur)return u;
	}
	for(int u:c){
		int ul=u/1000,ur=u%1000;
		if(ul<=sl&&sr<=ur)return u;
	}
	return -1;
}

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