제출 #430220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430220		dreezy	기지국 (IOI20_stations)	C++17	0 / 100	5 ms	784 KiB

stations

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

#define ll long long
#define pb push_back

vector<int> labels;
vector<vector<int>> graph;

vector<int> sz;
void dfs1(int n,int p){//calc sizes
	sz[n] = 1;
	for(int adj : graph[n])
	{
		if(adj == p) continue;
		dfs1(adj, n);
		sz[n] += sz[adj];
	}
}

int counter = 0;
void name_subtree(int n, int p){
	labels[n] =counter++;
	for(int adj : graph[n]){
		if(adj == p)
		continue;
		name_subtree(adj, n);
	}
}


vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	sz.assign(n, 0);
	labels.assign(n, 0);
	graph.assign( n, vector<int>());
	for (int i = 0; i < n - 1; i++) {
		graph[u[i]].pb(v[i]);
		graph[v[i]].pb(u[i]);
	}
	
	int root = 0;		

	dfs1(0,-1);
	//for(int i =0; i<n; i++) cout <<i<<": "<< sz[i]<<endl;
	
	name_subtree(root, -1);
	
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	
	for(int adj : c){
		if(adj < s) continue;
		//cout << s <<"->"<<t<<": "<<adj<<", "<<sz[adj]<<endl;
		if(adj<= t and t <= adj + sz[adj] -1)
			return adj;
	}
	return c[0];
}


/************/

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