Submission #940941

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
940941	2024-03-08T02:53:04 Z	TranGiaHuy1508	Toxic Gene (NOI23_toxic)	C++17	59.5 / 100	17 ms	512 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;

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

	vector<int> bruh;
	int tox = 0;

	int toxic_count = 0;

	while (!lst.empty()){
		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;

			// We try to consume stuff from <bruh>
			int a = 1, k = 0;
			while (!bruh.empty() && a < 256){
				subq.emplace_back(bruh.back(), a);
				a <<= 1; k++;
				bruh.pop_back();
			}

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

			int mask = query(subq);
			if (mask == mid+1 + (1 << k) - 1){
				l = mid + 1;
				for (int j = 0; j < k; j++) bruh.push_back(subq[j].first);
			}
			else{
				r = mid;
				for (int j = 0; j < k; j++){
					if ((mask >> j) & 1) vec[subq[j].first] = STRONG;
				}
			}
		}

		vec[dead[l]] = TOXIC; tox = dead[l];
		for (int j = l+1; j < (int)dead.size(); j++) lst.push_back(dead[j]);
		toxic_count++;
		if (toxic_count == 30){
			bruh.insert(bruh.end(), lst.begin(), lst.end());
			lst.clear();
		}
	}

	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

59.5 / 100.0

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