Submission #1106127

#	Time	Username	Problem	Language	Result	Execution time	Memory
1106127		snpmrnhlol	Stations (IOI20_stations)	C++17	0 / 100	3107 ms	2097152 KiB

stations

#include "stations.h"
#include <vector>
using namespace std;
const int N = 1e3;
const int inf = 1e9;
vector <int> e[N];
vector<int> labels;
int cnt = 0;
void dfs(int node, int p){
    for(auto i:e[node]){
        if(i == p)continue;
        dfs(i, node);
    }
    labels[node] = cnt++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	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]);
	}
	dfs(0, -1);
	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 = inf;
        for(auto i:c){
            if(i < mn && t <= i){
                mn = i;
            }
        }
        return mn;
    }
}

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