Submission #330339

#	Time	Username	Problem	Language	Result	Execution time	Memory
330339		marvenlee	Stations (IOI20_stations)	C++14	0 / 100	968 ms	992 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) {


	std::vector<int> labels(n);
    vector< vector<int> > graph(n,vector<int>());
    for(int i=0;i<n-1;i++){
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }
    int s=0;
    for(int i=0;i<n-1;i++){
        if(graph[i].size()==1) {s=i;break;}
    }
    int b;

    for(int i=0;i<n;i++){


        labels[s]=i;
        //printf("%dst: %d, labels[s]:%d\n",i,s,labels[s]);

        b=s;
        for(auto j=graph[b].begin(); j!=graph[b].end();j++){
            if(*j!=b) s=*j;
        }
    }
    //for(int i=0;i<n-1;i++) cout << labels[i] << " ";
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if(c.size()==2){
    if(c[0]>c[1]){
        int temp=c[0];
        c[0]=c[1];
        c[1]=temp;
    }
	return (s<t)?c[1]:c[0];
    }
    else return c[0];
}

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