제출 #1145190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1145190		thieunguyenhuy	Speedrun (RMI21_speedrun)	C++20	100 / 100	81 ms	24036 KiB

speedrun

#ifndef hwe
	#include "speedrun.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T1, class T2> T1 random(T1 l, T2 r) {
    return uniform_int_distribution<T1>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

#ifdef hwe
void setHintLen(int l);
void setHint(int i, int j, bool b);
int getLength();
bool getHint(int j);
bool goTo(int x);
#endif

vector<int> adj[N];
int par[N];

void dfs(int u, int fa, vector<int> &tour) {
	tour.emplace_back(u);
	for (auto v : adj[u]) if (v != fa) {
		par[v] = u;
		dfs(v, u, tour);
	}
}

void assignHints(int subtask, int n, int A[], int B[]) {
	for (int i = 1; i < n; ++i) {
		int u = A[i], v = B[i];
		adj[u].emplace_back(v), adj[v].emplace_back(u);
	}

	vector<int> tour; par[1] = 0, dfs(1, -1, tour);
	tour.emplace_back(tour[0]);

	setHintLen(20);
	for (int i = 1; i <= n; ++i) {
		// send the parent
		for (int j = 0; j < 10; ++j)
			setHint(i, j + 1, BIT(par[i], j));
		for (int j = 0; j < 10; ++j)
			setHint(tour[i - 1], j + 11, BIT(tour[i], j));
	}
}

void speedrun(int subtask, int n, int start) {
	auto get_parent = [&]() {
		int parent = 0;
		for (int j = 0; j < 10; ++j) 
			if (getHint(j + 1)) parent = ON(parent, j);
		return parent;
	};

	auto get_next_tour = [&]() {
		int next_tour = 0;
		for (int j = 0; j < 10; ++j)
			if (getHint(j + 11)) next_tour = ON(next_tour, j);
		return next_tour;
	};

	int current = start;
	auto move = [&](int x) {
		bool tmp = goTo(x);
		if (tmp) current = x;
		return tmp;
	};

	while (get_parent() != 0) move(get_parent());

	for (int _ = 1; _ < n; ++_) {
		int nxt = get_next_tour();
		while (!move(nxt)) move(get_parent());
	}
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);



    cerr << '\n'; return 0;
}
#endif

• Subtask 1: 21 / 21
• Subtask 2: 8 / 8
• Subtask 3: 19 / 19
• Subtask 4: 12 / 12
• Subtask 5: 40 / 40