#include "stations.h"
#include <bits/stdc++.h>
#include <vector>
#define PB push_back
using namespace std;
vector<int>ady[1001];
int lab[1001];
int cur = 0;
int dfs(int node, int parent){
for(auto i:ady[node]){
if(i==parent)continue;
dfs(i, node);
}
lab[node]=cur++;
return 1;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int>ab;
for(int i = 0 ; i < n-1 ; i++){
ady[u[i]].PB(v[i]);
ady[v[i]].PB(u[i]);
}
dfs(0, -1);
for(int i = 0 ; i <= n-1 ; i++){
ab.PB(lab[i]);
//cout<<lab[i]<<" ";
}
return ab;
}
int find_next_station(int s, int t, std::vector<int> c) {
int li=0, ls=c.size()-1, pos;
pos=(li+ls)/2;
while(li+1<ls){
//cout<<li<<" "<<ls<<endl;
pos=(li+ls)/2;
if(c[pos]>=t)ls=pos;
else li=pos;
}
for(int i = ls ; i >= li ; i--){
if(c[i]>=t)pos=i;
}
//pos=(li+ls)/2;
return c[pos];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2114 ms |
2097156 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3045 ms |
540 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1958 ms |
2097156 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
958 ms |
400 KB |
Output is correct |
2 |
Runtime error |
1482 ms |
2097156 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3209 ms |
1660164 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |