Submission #1214336

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214336		Aviansh	Stations (IOI20_stations)	C++20	0 / 100	304 ms	552 KiB

stations

#include "stations.h"
#include <vector>

#include <bits/stdc++.h>

using namespace std;

int tim;

void dfs(int st, vector<int>g[], vector<int>&labels, int p){
    labels[st]=tim++;
    for(int i : g[st]){
        if(i==p)
            continue;
        dfs(i,g,labels,st);
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    vector<int>g[n];
    for(int i = 0;i<n-1;i++){
        g[u[i]].push_back(v[i]);
        g[v[i]].push_back(u[i]);
    }
	vector<int> labels(n);
	tim=0;
    dfs(0,g,labels,-1);
    return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    sort(c.begin(),c.end());
    if(s!=0){
        //not root
        if(t<s){
            return c[0];
        }
        c.erase(c.begin());
    }
    int n = c.size();
    assert(n);
    for(int i = 1;i<n;i++){
        if(c[i]>t){
            return c[i-1];
        }
    }
    return c[n-1];
}

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