Submission #838283

#	Time	Username	Problem	Language	Result	Execution time	Memory
838283		JakobZorz	Stations (IOI20_stations)	C++14	0 / 100	3039 ms	2097152 KiB

stations

#include"stations.h"
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;

vector<int>labels;
int n;
vector<int>nodes[1000];
int curr_label=0;

void dfs(int node,int par){
    for(int ne:nodes[node]){
        if(ne==par)
            continue;
        dfs(ne,node);
    }
    labels[node]=curr_label++;
}

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

int find_next_station(int s,int t,vector<int>c){
    sort(c.begin(),c.end());
    /*cout<<"s "<<s<<endl;
    cout<<"t "<<t<<endl;
    cout<<"arr ";
    for(int i:c)
        cout<<i<<" ";
    cout<<endl;*/
    
    if(s==t)
        return s;
    int i=0;
    while(i<(int)c.size()&&c[i]<=t)
        i++;
    i--;
    //cout<<"return "<<c[i]<<endl;
	return c[i];
}

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