Submission #330337

# Submission time Handle Problem Language Result Execution time Memory
330337 2020-11-24T20:22:38 Z marvenlee Stations (IOI20_stations) C++14
0 / 100
1 ms 372 KB
#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];
}
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 364 KB Execution killed with signal 13 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 364 KB Execution killed with signal 13 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 364 KB Execution killed with signal 13 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 364 KB Execution killed with signal 13 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 372 KB Execution killed with signal 13 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -