#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int dydis = 1000;
vector<int> gr[dydis];
int enter[dydis];
int leave[dydis];
vector<int> ret (dydis);
int dbInd = 0;
void dfs(int v, int came){
enter[v] = dbInd++;
for(auto x : gr[v]){
if(x == came) continue;
dfs(x, v);
}
leave[v] = dbInd;
ret[v] = enter[v] * dydis + leave[v] - 1;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i = 0; i < n-1; i++){
gr[u[i]].push_back(v[i]);
gr[v[i]].push_back(u[i]);
}
dfs(0, -1);
ret.resize(n);
return ret;
}
int find_next_station(int s, int t, vector<int> c) {
int enterS = s / 1000;
int leaveS = s % 1000;
int enterT = t / 1000;
int leaveT = t % 1000;
if(enterS <= enterT && leaveT <= leaveS){
for(auto x : c){
int e = x / 1000;
int l = x % 1000;
if(e <= enterT && leaveT <= l){
return x;
}
}
}else{ // eisiu aukstyn
for(auto x : c){
int e = x / 1000;
int l = x % 1000;
if(e <= enterS && leaveS <= l){
return x;
}
}
}
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2115 ms |
2097156 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3052 ms |
416 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1483 ms |
2097152 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1307 ms |
528 KB |
Output is correct |
2 |
Runtime error |
1215 ms |
2097156 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2663 ms |
2097156 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |