# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730058 | danikoynov | 기지국 (IOI20_stations) | C++14 | 3096 ms | 2097152 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 <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
vector < int > g[maxn], order, my_labels;
int in[maxn], out[maxn], timer, par[maxn];
void dfs(int v, int p)
{
in[v] = timer ++;
par[v] = p;
order.push_back(v);
for (int u : g[v])
{
if (u == p)
continue;
dfs(u, v);
}
out[v] = timer;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
for (int i = 0; i < v.size(); i ++)
{
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
my_labels.resize(n);
dfs(0, 0);
for (int i = 0; i < n; i ++)
{
my_labels[i] = in[i] * 1000 + out[i];
}
return my_labels;
}
int used[maxn];
int find_next_station(int s, int t, vector<int> c)
{
return 0;
int in_s = s / 1000, out_s = s % 1000;
int in_t = t / 1000, out_t = t % 1000;
int par_s = -1;
for (int i = 0; i < c.size(); i ++)
{
int u = c[i];
int in_u = u / 1000, out_u = u % 1000;
if (in_u <= in_s && out_u >= out_s)
{
par_s = u;
}
else
{
if (in_u <= in_t && out_u >= out_t)
{
///cout << u << endl;
return u;
}
}
}
return par_s;
}
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... |