제출 #423993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423993		lakshith_	기지국 (IOI20_stations)	C++14	5 / 100	1174 ms	600 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout <"checker reached " << a << "\n"

vector<vector<int>> adj(1000,vector<int>());

vector<int> path;

void dfs(int u,int p){
	path.push_back(u);
	for(int v:adj[u])
		if(v!=p)dfs(v,u);
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for(int i=0;i<n;i++)
		adj[i] = vector<int>();
	for(int i=0;i<n-1;i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	int start = 0;
	for(int i=0;i<n;i++)
		if(adj[i].size()==1){
			start = i;
			break;
		}
	path.clear();
	dfs(start,start);
	vector<int> lbl(n);
	for(int i=0;i<n;i++)
		lbl[path[i]] = i;
	return lbl;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(c.size()==1)return c[0];
	if(s<t)
		return c[1];
	else 
		return c[0];
}

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