#include "stations.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
vector<int> label(int n, int k,vector<int> u,vector<int> v) {
int in[n+1];
for(int i=0;i<n;i++)in[i]=0;
for(int i=0;i<n;i++){
in[v[i]]++;
in[u[i]]++;
}
int piv=0;
for(int i=0;i<n;i++){
if(in[i]==1){
piv=i;
break;
}
}
//cout<<piv<<endl;
vector<int> gg;
gg.push_back(piv);
for(int i=0;i<n-1;i++){
for(int j=0;j<n;j++){
if(u[j]==piv){
gg.push_back(v[j]);
piv=v[j];
}
}
}
if(gg.size()==1){
for(int i=0;i<n-1;i++){
for(int j=0;j<n;j++){
if(v[j]==piv){
gg.push_back(u[j]);
piv=u[j];
break;
}
}
}
}
//for(auto i:gg)cout<<i<<" ";
//cout<<endl;
vector<int> labels(n);
for(int i=0;i<n;i++){
//cout<<gg[i]<<" ";
labels[gg[i]]=i;
}
//cout<<endl;
return labels;
}
int find_next_station(int s, int t,vector<int> c) {
if(t<s)return s-1;
else return s+1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
384 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
4 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
3 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
938 ms |
640 KB |
Output is correct |
2 |
Runtime error |
1 ms |
376 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |