# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
308277 |
2020-09-30T17:58:01 Z |
Peti |
Stations (IOI20_stations) |
C++14 |
|
956 ms |
1116 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 / 2;
ido++;
for(int x : g[akt])
if(!volt[x])
Bejar(labels, x, t+1);
if(t%2 == 1)
labels[akt] = ido / 2;
ido++;
return;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
ido = 0;
volt.assign(n, false);
g.assign(n, vector<int>());
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, 0);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
sort(c.begin(), c.end());
for(int i = 0; i < (int)c.size(); i++)
c[i] *= 2;
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 |
696 ms |
1024 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
460 ms |
1024 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
566 ms |
1024 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
956 ms |
640 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
648 ms |
1116 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |