# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
391534 |
2021-04-19T09:02:02 Z |
ljuba |
Stations (IOI20_stations) |
C++17 |
|
1045 ms |
668 KB |
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1100;
vector<int> adj[mxN];
std::vector<int> labels;
int timer = 0;
void dfs(int s, int p, int pa) {
if(pa^1)
labels[s] = timer++;
for(auto e : adj[s]) {
if(e == p) continue;
dfs(e, s, pa^1);
}
if(pa)
labels[s] = timer++;
}
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();
}
for(int i = 0; i < n-1; ++i) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
labels.resize(n);
dfs(0, -1, 0);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
sort(c.begin(), c.end());
if(s < c[0]) {
//in ostali out
for(auto e : c) {
if(t >= s && t <= e)
return e;
}
return c.back();
} else {
reverse(c.begin(), c.end());
for(auto e : c) {
if(t <= s && t >= e)
return e;
}
return c[0];
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
344 KB |
Invalid labels (values out of range). scenario=2, k=1000, vertex=1, label=1008 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
328 KB |
Invalid labels (values out of range). scenario=1, k=1000, vertex=1, label=1507 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
736 ms |
664 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1045 ms |
528 KB |
Output is correct |
2 |
Correct |
836 ms |
524 KB |
Output is correct |
3 |
Incorrect |
651 ms |
400 KB |
Wrong query response. |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
529 ms |
668 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |