#include <bits/stdc++.h>
using namespace std;
#include "stations.h"
#include <vector>
const int N = 1001;
vector<int> adj[N];
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
for (int i=0; i<n; i++) adj[i].clear();
std::vector<int> labels(n);
for (int i=0; i<n-1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
for (int i=0; i<n; i++) labels[i] = i;
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (s>t) return (s-1)/2;
while ((t-1)/2 > s) t = (t-1)/2;
if ((t-1)/2 == s) return t;
return (s-1)/2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
391 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
330 ms |
684 KB |
Output is correct |
2 |
Correct |
381 ms |
684 KB |
Output is correct |
3 |
Correct |
585 ms |
684 KB |
Output is correct |
4 |
Correct |
496 ms |
684 KB |
Output is correct |
5 |
Correct |
405 ms |
684 KB |
Output is correct |
6 |
Correct |
302 ms |
688 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
389 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
654 ms |
684 KB |
Output is correct |
2 |
Incorrect |
490 ms |
684 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
342 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |