Submission #1278970

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278970		Tymond	Park (JOI17_park)	C++20	100 / 100	402 ms	748 KiB

park

#include "park.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXN = 1505;
vi g[MAXN];
int vis[MAXN];
int f[MAXN];
bool blocked[MAXN];
static int p[MAXN];
bool connected[MAXN][MAXN];
int parent[MAXN];
vi curr, e, curr2;
int n;

void dfs(int v){
	curr.pb(v);
	for(auto u : g[v]){
		dfs(u);
	}
}

void dfs3(int v){
	curr2.pb(v);
	for(auto u : g[v]){
		if(!vis[u]){
			dfs3(u);
		}
	}
}

void dfs2(int v, int a){
	while(true){
		curr2.clear();
		dfs3(v);

		if(vis[v]){
			return;
		}

		for(int i = 0; i < n; i++){
			p[i] = 0;
		}
		for(auto ele : curr2){
			p[ele] = 1;
		}
		p[a] = 1;
		if(!Ask(min(v, a), max(v, a), p)){
			return;
		}

		int lo = 0;
		int hi = sz(curr2) - 1;
		int mid, res;
		while(lo <= hi){
			mid = (lo + hi) / 2;
			for(int i = 0; i < n; i++){
				p[i] = 0;
			}

			for(int i = 0; i <= mid; i++){
				p[curr2[i]] = 1;
			}
			p[a] = 1;

			if(Ask(min(v, a), max(v, a), p)){
				res = curr2[mid];
				hi = mid - 1;
			}else{
				lo = mid + 1;
			}
		}

		vis[res] = 1;
		e.pb(res);
		for(auto u : g[res]){
			dfs2(u, a);
		}
	}
}

void merge(int a){
	if(f[a]){
		return;
	}

	for(int i = 0; i < n; i++){
		p[i] = f[i];
		vis[i] = 0;
	}

	p[a] = 1;
	while(!Ask(0, a, p)){
		int lo = 0;
		int hi = n - 1;
		int mid, res;
		while(lo <= hi){
			mid = (lo + hi) / 2;
			for(int i = 0; i < n; i++){
				if(f[i] || i <= mid){
					p[i] = 1;
				}else{
					p[i] = 0;
				}
			}
			p[a] = 1;

			if(Ask(0, a, p)){
				hi = mid - 1;
				res = mid;
			}else{
				lo = mid + 1;
			}
		}

		merge(res);
		for(int i = 0; i < n; i++){
			p[i] = f[i];
		}

		p[a] = 1;
	}

	//znajdź krawędzie z a do odwiedzonych
	for(int i = 0; i < n; i++){
		vis[i] = 0;
	}
	curr.clear();
	dfs(0);
	e.clear();
	dfs2(0,a);

	for(auto ele : e){
		Answer(min(ele, a), max(ele, a));
	}
	parent[a] = e[0];
	g[e[0]].pb(a);
	f[a] = 1;
}

void Detect(int T, int N){
	for(int i = 0; i < MAXN; i++){
		f[i] = 0;
		p[i] = 0;
	}
	n = N;
	
	f[0] = 1;
	for(int i = 1; i < n; i++){
		merge(i);
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 27 / 27
• Subtask 4: 30 / 30
• Subtask 5: 23 / 23