Submission #800403

#	Time	Username	Problem	Language	Result	Execution time	Memory
800403		Liudas	Stations (IOI20_stations)	C++17	0 / 100	1 ms	296 KiB

stations

#include <bits/stdc++.h>
using namespace std;
void dfs(int head, int par, vector<vector<int>> &tree, int &col, vector<int> &labels){
    for(int i : tree[head]){
        if(i != par){
            dfs(i, head, tree, col, labels);
        }
    }
    labels[head] = col ++;
}
int find_next_station(int s, int t, vector<int> labels){
    sort(labels.begin(), labels.end());
    if(t > labels.back()){
        return labels.back();
    }
    for(int i : labels){
        if(t <= i){
            return i;
        }
    }
}
vector<int> label(int N, int K, vector<int> U, vector<int> V){
    vector<vector<int>> tree(N);
    for(int i = 0; i < N-1; i ++){
        tree[U[i]].push_back(V[i]);
        tree[V[i]].push_back(U[i]);
    }
    vector<int> labels(N);
    int col = 0;
    dfs(0, -1, tree, col, labels);
    for(int i : labels){
        cout << i << endl;
    }
    return labels;
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:21:1: warning: control reaches end of non-void function [-Wreturn-type]
   21 | }
      | ^

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