# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
504801 | Mike4235 | Speedrun (RMI21_speedrun) | C++17 | 0 ms | 0 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.
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")*/
#include <bits/stdc++.h>
#define for1(i,a,b) for (int i = a; i <= b; i++)
#define for2(i,a,b) for (int i = a; i >= b; i--)
#define int long long
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pb push_back
/*
__builtin_popcountll(x) : Number of 1-bit
__builtin_ctzll(x) : Number of trailing 0
*/
const long double PI = 3.1415926535897932384626433832795;
const int INF = 1000000000000000000;
const int MOD = 1000000007;
const int MOD2 = 1000000009;
const long double EPS = 1e-6;
using namespace std;
int now, tin[1005], rev[1005];
vector<int> g[1005];
void dfs(int u, int p) {
for1(i,0,9) if (p & (1 << i)) setHint(u, i + 1, 1);
tin[u] = ++now;
rev[now] = u;
for (auto v : g[u]) if (v != p) dfs(v, u);
}
void assignHints(int subtask, int n, int a[], int b[]) {
setHintLen(20);
for1(i,1,n) {
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
dfs(1, 0);
for1(u,1,n) {
for1(i,0,9) if (rev[tin[u] + 1] & (1 << i)) setHint(u, i + 11, 1);
}
return;
}
int get(int u, bool p) {
int res = 0;
for1(i,0,9) {
bool t = getHint(i + 1 + p * 10);
res ^= (t << i);
}
return res;
}
void speedrun(int subtask, int n, int u) {
int l = getLength();
while (1) {
int v = get(u, 0);
if (!v) break;
goTo(v);
u = v;
}
while (1) {
int v = get(u, 1);
if (!v) return;
if (goTo(v)) u = v;
else {
v = get(u, 0);
goTo(v);
u = v;
}
}
}