# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680838 | aryan12 | Stations (IOI20_stations) | C++17 | 826 ms | 676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
int tin[N], tout[N];
int tim = 0;
vector<int> g[N];
void dfs(int node, int par)
{
tin[node] = tim++;
for(int to: g[node])
{
if(to == par) continue;
dfs(to, node);
}
tout[node] = tim;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
tim = 0;
for(int i = 0; i < N; i++)
{
g[i].clear();
}
for(int i = 0; i < u.size(); i++)
{
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
dfs(0, -1);
vector<int> labels;
// cout << "in label\n";
for(int i = 0; i < n; i++)
{
// cout << tin[i] << " " << tout[i] << "\n";
labels.push_back(tin[i] * 1000 + tout[i]);
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
// cout << "find_next_station(" << s << ", " << t << ")\n";
int min_tim_in = 1e9, min_tim_pos = 0;
int t_in = t / 1000, t_out = t % 1000;
int s_in = s / 1000;
for(int i = 0; i < c.size(); i++)
{
int time_in = c[i] / 1000, time_out = c[i] % 1000;
if(time_in <= t_in && t_out <= time_out && time_in > s_in)
{
return c[i];
}
if(time_in < min_tim_in)
{
min_tim_in = time_in;
min_tim_pos = i;
}
}
return c[min_tim_pos];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |