Submission #815843

#	Time	Username	Problem	Language	Result	Execution time	Memory
815843		eltu0815	기지국 (IOI20_stations)	C++14	0 / 100	706 ms	596 KiB

stations

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

vector<int> graph[1005];
void dfs(int node, int par, int val, vector<int>& label) {
    label[node] = val;
    for(auto v : graph[node]) if(v != par) dfs(v, node, val + 1, label);
}

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

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];
	return c[0];
}

/*
2

2 1
0 1
2
0 1 1
1 0 0

3 3
0 1
1 2
3
1 0 0
0 1 1
2 0 1
*/

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