This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#ifndef EVAL
#include "stub.cpp"
#endif
#include "stations.h"
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pii pair<int, int>
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
using namespace std;
const int MAXN = 1005;
vector <int> g[MAXN];
int tin[MAXN], tout[MAXN], tiktak = 0;
int pr[MAXN];
void clean() {
for (int i = 0; i < MAXN; i++) {
g[i].clear();
tin[i] = 0;
tout[i] = 0;
pr[i] = 0;
}
tiktak = 0;
}
void precalc(int v, int par) {
tin[v] = ++tiktak;
pr[v] = par;
for (int to : g[v]) {
if (to != par) {
precalc(to, v);
}
}
tout[v] = tiktak;
}
void up(int v, vector <int> &vec) {
vec.pb(v);
if (pr[v] != -1) {
up(pr[v], vec);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
clean(); // на всякий случай
for (int i = 0; i <= n - 2; i++) {
int x = u[i];
int y = v[i];
g[x].pb(y);
g[y].pb(x);
}
precalc(0, -1);
vector <int> labels(n);
for (int i = 0; i < n; i++) {
// 10 битов для tin
// 10 битов для tout
labels[i] = tin[i] + (tout[i] << 10);
}
return labels;
}
bool father(int a, int b) {
int tin_a = 0;
int tout_a = 0;
int tin_b = 0;
int tout_b = 0;
for (int i = 0; i < 30; i++) {
if (a & (1 << i)) {
if (i <= 9) {
tin_a += (1 << i);
} else {
tout_a += (1 << (i - 10));
}
}
if (b & (1 << i)) {
if (i <= 9) {
tin_b += (1 << i);
} else {
tout_b += (1 << (i - 10));
}
}
}
return tin_a <= tin_b && tout_b <= tout_a;
}
int find_next_station(int s, int t, vector<int> c) {
if (father(s, t)) {
for (int el : c) {
if (father(s, el) && father(el, t)) {
return el;
}
}
}
for (int el : c) {
if (father(el, s)) {
return el;
}
}
}
Compilation message (stderr)
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:106:1: warning: control reaches end of non-void function [-Wreturn-type]
106 | }
| ^
# | 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... |