Submission #940930

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
940930	2024-03-08T02:36:10 Z	TranGiaHuy1508	Toxic Gene (NOI23_toxic)	C++17	67.6 / 100	25 ms	600 KB

toxic

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

#include "toxic.h"

enum BacteriaType {
	REGULAR = 'R',
	 STRONG = 'S',
	  TOXIC = 'T'
};

int query(vector<pair<int, int>> samples){
	vector<int> species;
	for (auto [type, cnt]: samples){
		for (int _ = 0; _ < cnt; _++) species.push_back(type + 1);
	}
	return query_sample(species);
}

void determine_type(int n){
	vector<char> vec(n, REGULAR);
	vector<int> other;

	static mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

	vector<int> lst(n);
	iota(lst.begin(), lst.end(), 0);

	vector<int> bruh;
	int tox = 0;

	while (!lst.empty()){
		shuffle(lst.begin(), lst.end(), rng);

		vector<pair<int, int>> crrq;
		int a = 1;

		while (!lst.empty() && a < 256){
			crrq.emplace_back(lst.back(), a);
			a <<= 1;
			lst.pop_back();
		}

		int mask = query(crrq);
		vector<int> dead;

		if (mask == (1 << crrq.size()) - 1){
			for (auto elem: crrq) bruh.push_back(elem.first);
			continue;
		}
		else{
			for (int j = 0; j < (int)crrq.size(); j++){
				if ((mask >> j) & 1) vec[crrq[j].first] = STRONG;
				else dead.push_back(crrq[j].first);
			}
		}

		int l = 0, r = dead.size() - 1;
		while (l < r){
			int mid = (l + r) >> 1;

			vector<pair<int, int>> subq;
			for (int j = 0; j <= mid; j++) subq.emplace_back(dead[j], 1);

			int any = query(subq);
			if (any) l = mid + 1;
			else r = mid;
		}

		vec[dead[l]] = TOXIC; tox = dead[l];
		for (int j = l+1; j < (int)dead.size(); j++) lst.push_back(dead[j]);
	}

	for (int i = 0; i < n; i++){
		bool valid = true;
		for (auto elem: bruh) if (elem == i) valid = false;
		if (valid) answer_type(i+1, vec[i]);
	}

	while (!bruh.empty()){
		vector<pair<int, int>> crrq;
		int a = 1;

		while (!bruh.empty() && a < 256){
			crrq.emplace_back(bruh.back(), a);
			a <<= 1;
			bruh.pop_back();
		}
		crrq.emplace_back(tox, 1);

		int mask = query(crrq);
		for (int j = 0; j < (int)crrq.size() - 1; j++){
			if ((mask >> j) & 1) vec[crrq[j].first] = STRONG;
		}
	}

	for (int i = 0; i < n; i++) answer_type(i+1, vec[i]);
}

Subtask #1

67.6 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	504 KB	Output is correct
2	Partially correct	21 ms	348 KB	Partially correct
3	Partially correct	21 ms	344 KB	Partially correct
4	Partially correct	19 ms	508 KB	Partially correct
5	Partially correct	23 ms	348 KB	Partially correct
6	Partially correct	23 ms	344 KB	Partially correct
7	Partially correct	22 ms	348 KB	Partially correct
8	Partially correct	22 ms	344 KB	Partially correct
9	Partially correct	24 ms	500 KB	Partially correct
10	Partially correct	21 ms	348 KB	Partially correct
11	Partially correct	18 ms	508 KB	Partially correct
12	Partially correct	21 ms	344 KB	Partially correct
13	Partially correct	21 ms	344 KB	Partially correct
14	Partially correct	19 ms	348 KB	Partially correct
15	Partially correct	23 ms	484 KB	Partially correct
16	Partially correct	23 ms	344 KB	Partially correct
17	Partially correct	23 ms	348 KB	Partially correct
18	Partially correct	24 ms	348 KB	Partially correct
19	Partially correct	22 ms	344 KB	Partially correct
20	Partially correct	21 ms	544 KB	Partially correct
21	Correct	19 ms	348 KB	Output is correct
22	Correct	17 ms	344 KB	Output is correct
23	Correct	16 ms	348 KB	Output is correct
24	Partially correct	21 ms	596 KB	Partially correct
25	Partially correct	21 ms	344 KB	Partially correct
26	Partially correct	21 ms	348 KB	Partially correct
27	Partially correct	20 ms	348 KB	Partially correct
28	Correct	19 ms	348 KB	Output is correct
29	Partially correct	22 ms	512 KB	Partially correct
30	Partially correct	23 ms	508 KB	Partially correct
31	Partially correct	23 ms	348 KB	Partially correct
32	Partially correct	21 ms	344 KB	Partially correct
33	Partially correct	18 ms	348 KB	Partially correct
34	Partially correct	24 ms	600 KB	Partially correct
35	Partially correct	25 ms	348 KB	Partially correct
36	Partially correct	3 ms	348 KB	Partially correct