Submission #1115101

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115101		thieunguyenhuy	Island Hopping (JOI24_island)	C++17	65 / 100	22 ms	856 KiB

island

#ifndef hwe
	#include "island.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 lg(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 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

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

int n;
int mem[N][N];
int par[N], where[N], dist[N];
bitset<N> mark, worked;
vector<int> adj[N];

#ifdef hwe
int query(int v, int k) {
	cerr << "QUERY = " << v << ' ' << k << '\n';
	memset(dist, -1, sizeof dist); dist[v] = 0;
	queue<int> q; q.emplace(v);
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto v : adj[u]) if (dist[v] == -1) {
			dist[v] = dist[u] + 1;
			q.emplace(v);
		}
	}
	vii ve;
	for (int i = 1; i <= n; ++i) if (i != v) {
		ve.emplace_back(dist[i], i);
	}
	sort (ve.begin(), ve.end());
	return ve[k - 1].se;
	// int ret; cin >> ret; return ret;
}

void answer(int u, int v) {
	cerr << "ANSWER = " << u << ' ' << v << '\n';
}
#endif

int ask(int v, int k) {
	if (mem[v][k] != -1) return mem[v][k];
	return mem[v][k] = query(v, k);
}

void solve(int n, int L) {
	memset(mem, -1, sizeof mem); memset(par, -1, sizeof par);
	par[1] = 0;

	for (int i = 1; i < n; ++i) {
		int v = ask(1, i);
		where[v] = i;
	}

	for (int u = 2; u <= n; ++u) if (par[u] == -1) {
		for (int deg = 1; par[u] == -1 && deg < n; ++deg) {
			int v = ask(u, deg);
			if (where[v] < where[u]) par[u] = v;
			else par[v] = u;
		}
	}

	for (int u = 2; u <= n; ++u) answer(par[u], u);
}


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

    cin >> n;

    for (int i = 1; i <= n; ++i) adj[i].clear();
    for (int i = 1; i < n; ++i) {
    	int u, v; cin >> u >> v;
    	adj[u].emplace_back(v), adj[v].emplace_back(u);
    }
    solve(n, 69);

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

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 0 / 7
• Subtask 4: 9 / 9
• Subtask 5: 13 / 13
• Subtask 6: 15 / 15
• Subtask 7: 22 / 22
• Subtask 8: 0 / 28