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 <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second
using namespace std;
template<typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
struct Solver
{
vector<int> edge[1005];
int in[1005] = { 0, }, out[1005] = { 0, };
int depth[1005] = { 0, };
int vis = 0;
void dfs(int root)
{
in[root] = vis;
vis++;
for (auto& e : edge[root])
{
edge[e].erase(find(all(edge[e]), root));
depth[e] = depth[root] + 1;
dfs(e);
}
out[root] = vis;
vis++;
}
};
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
Solver s;
for (int i = 0; i < n - 1; i++)
{
s.edge[u[i]].push_back(v[i]);
s.edge[v[i]].push_back(u[i]);
}
s.dfs(0);
vector<int> res(n);
for (int i = 0; i < n; i++)
{
if (s.depth[i] % 2 == 0)
res[i] = s.in[i];
else
res[i] = s.out[i];
}
return res;
}
int find_next_station(int s, int t, vector<int> c)
{
// s = in time, cs = out time
if (s < c[0])
{
int pc = s;
for (int i = 0; i < c.size(); i++)
{
if (t > pc && t <= c[i])
return c[i];
pc = c[i];
}
return c.back();
}
else
{
// s = out time, cs = in time
for (int i = 0; i < c.size(); i++)
{
int nc = (i == c.size() - 1) ? (s + 1) : c[i + 1];
if (t >= c[i] && t < nc)
return c[i];
}
return c[0];
}
}
Compilation message (stderr)
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:83:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
83 | for (int i = 0; i < c.size(); i++)
| ~~^~~~~~~~~~
stations.cpp:96:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
96 | for (int i = 0; i < c.size(); i++)
| ~~^~~~~~~~~~
stations.cpp:98:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
98 | int nc = (i == c.size() - 1) ? (s + 1) : c[i + 1];
| ~~^~~~~~~~~~~~~~~
# | 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... |