Submission #1148649

#TimeUsernameProblemLanguageResultExecution timeMemory
1148649fatman87878Toxic Gene (NOI23_toxic)C++20
0 / 100
0 ms320 KiB
#include "toxic.h"
#include<bits/stdc++.h>
using namespace std;
#define IOS cin.tie(nullptr)->sync_with_stdio(0),cin.exceptions(cin.failbit);
#define lb(x) (x)&-(x)
#define all(x) (x).begin(),(x).end()
#define ll long long

constexpr int blk = 8;

void determine_type(int n){
	mt19937 rng(time(0));
	int toxic;
	vector<int> idx(n+1),nottoxic,isstrong(n+1),istoxic(n+1);
	iota(all(idx),0);
	shuffle(idx.begin()+1,idx.end(),rng);
	for(int i = 1;i<=n;){
		int R = min(n+1,i+blk);
		vector<int> ask;
		for(int cnt = 0,k = i;k<R;k++,cnt++){
			for(int j = 0;j<1<<cnt;j++)ask.emplace_back(idx[k]);
		}
		int ret = query_sample(ask);
		if(query_sample(ask)!=ask.size()){
			ask.clear();
			for(int k = i;k<R;k++,ret>>=1){
				if(ret&1)isstrong[idx[k]] = 1;
				else ask.emplace_back(idx[k]);
			}
			int l = 0,r = ask.size();
			for(;l+1!=r;){
				int mid=l+r>>1;
				if(query_sample(vector(ask.begin(),ask.begin()+mid)))r=mid;
				else l=mid;
			}
			istoxic[toxic=idx[l]]=1;
			i=l+1;
		}
		else {
			for(;i<R;i++)nottoxic.emplace_back(idx[i]);
		}
	}
	for(int i = 0;i<nottoxic.size();){
		vector<int> ask(1,toxic);
		for(int cnt = 0,k = i;cnt<8&&k<nottoxic.size();k++,cnt++){
			for(int j = 0;j<1<<cnt;j++)ask.emplace_back(nottoxic[k]);
		}
		int ret = query_sample(ask);
		for(int cnt = 0;cnt<8&&i<nottoxic.size();i++,cnt++,ret>>=1){
			isstrong[nottoxic[i]] = ret&1;
		}
	}
	for(int i = 1;i<=n;i++){
		if(istoxic[i])answer_type(i,'T');
		else if(isstrong[i])answer_type(i,'S');
		else answer_type(i,'R');
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...