Submission #1106134

#	Time	Username	Problem	Language	Result	Execution time	Memory
1106134		snpmrnhlol	기지국 (IOI20_stations)	C++17	0 / 100	818 ms	668 KiB

stations

#include "stations.h"
#include <vector>
#include <iostream>
using namespace std;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    vector <vector<int>> e;
    vector<int> labels;
    e.resize(n);
    int cnt = 0;
    auto dfs = [&](auto self,int node, int p) -> void{
        labels[node] = cnt++;
        for(auto i:e[node]){
            if(i == p)continue;
            self(self, i, node);
        }
    };
	labels.resize(n);
	for(int i = 0;i < n - 1;i++){
        e[u[i]].push_back(v[i]);
        e[v[i]].push_back(u[i]);
	}
	for(int i = 0;i < n;i++){
        if(e[i].size() == 1){
            dfs(dfs, 0, -1);
            break;
        }
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if(s < t){
        ///s go up
        int mx = -1;
        for(auto i:c){
            mx = max(mx,i);
        }
        return mx;
    }else{
        ///s go down?
        int mn = 1000000;
        for(auto i:c){
            mn = min(mn,i);
        }
        return mn;
    }
}
/**
1
7 99
0 1
0 2
1 3
1 4
2 5
2 6
**/

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