# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
308262 |
2020-09-30T16:25:36 Z |
Peti |
Stations (IOI20_stations) |
C++14 |
|
867 ms |
768 KB |
#include "stations.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<vector<int>> g;
vector<bool> volt;
int ido = 0;
void Bejar(vector<int> &labels, int akt, int t)
{
volt[akt] = true;
if(t%2 == 0)
labels[akt] = ido;
ido++;
for(int x : g[akt])
if(!volt[x])
Bejar(labels, x, t+1);
if(t%2 == 1)
labels[akt] = ido;
ido++;
return;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
g.resize(n);
volt.resize(n, false);
for(int i = 0; i < n-1; i++)
{
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
std::vector<int> labels(n);
Bejar(labels, 0, 1);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
sort(c.begin(), c.end());
if(s < c[0])
{
if(t < s || t > (*c.rbegin()))
return (*c.rbegin());
for(int x : c)
if(x >= t)
return x;
}
else
{
if(t > s || t <= c[0])
return c[0];
reverse(c.begin(), c.end());
for(int x : c)
if(x <= t)
return x;
}
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
512 KB |
Invalid labels (duplicates values). scenario=1, label=0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
508 KB |
Invalid labels (values out of range). scenario=0, k=1000, vertex=0, label=1991 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
867 ms |
768 KB |
Output is correct |
2 |
Incorrect |
1 ms |
256 KB |
Invalid labels (duplicates values). scenario=1, label=0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
512 KB |
Invalid labels (duplicates values). scenario=1, label=0 |
2 |
Halted |
0 ms |
0 KB |
- |