Submission #950967

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
950967	2024-03-21T03:16:48 Z	GrandTiger1729	Toxic Gene (NOI23_toxic)	C++17	54.1 / 100	62 ms	1496 KB

toxic

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

const int K = 8;
vector<int> encode(vector<int> qry)
{
	int n = qry.size();
	vector<int> ret;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < (1 << i); j++)
		{
			ret.push_back(qry[i]);
		}
	}
	return ret;
}
void determine_type(int n)
{
	vector<int> ord(n);
	iota(ord.begin(), ord.end(), 1);
	random_shuffle(ord.begin(), ord.end());
	string ans(n + 1, 'R');
	int tt = -1;
	vector<int> stk;
	int i = 0;
	while (i < n)
	{
		int j = min(n, i + K);
		{
			vector<int> qry;
			for (int k = i; k < j; k++)
			{
				qry.push_back(ord[k]);
			}
			int res = query_sample(encode(qry));
			if (res == (1 << qry.size()) - 1)
			{
				stk.insert(stk.end(), qry.begin(), qry.end());
				i = j;
				continue;
			}
		}
		cerr << "HERE" << endl;
		auto make_query = [&](int mid)
		{
			vector<int> qry;
			for (int k = i; k < mid; k++)
			{
				qry.push_back(ord[k]);
			}
			int x = min(stk.size(), K - qry.size());
			for (int k = 0; k < x; k++)
			{
				qry.push_back(stk.end()[-1 - k]);
			}
			return qry;
		};
		int l = i, r = j;
		while (l < r - 1)
		{
			int mid = (l + r) / 2;
			vector<int> qry = make_query(mid);
			int res = query_sample(encode(qry));
			if (res == (1 << qry.size()) - 1)
			{
				l = mid;
			}
			else
			{
				int x = qry.size() - (mid - i);
				for (int k = mid - i; k < qry.size(); k++)
				{
					ans[qry[k]] = (res >> k & 1) ? 'S' : 'R';
				}
				for (int k = 0; k < x; k++)
				{
					stk.pop_back();
				}
				r = mid;
			}
		}
		vector<int> qry = make_query(l);
		auto tmp = encode(qry);
		tmp.push_back(ord[l]);
		int res = query_sample(tmp);
		for (int k = 0; k < qry.size(); k++)
		{
			ans[qry[k]] = (res >> k & 1) ? 'S' : 'R';
		}
		cerr << "ans " << ans << endl;
		ans[ord[l]] = 'T';
		int x = min((int)stk.size(), K - (l - i + 1));
		for (int k = 0; k < x; k++)
		{
			stk.pop_back();
		}
		cerr << "OK " << l << ' ' << ord[l] << endl;
		i = l + 1;
		tt = ord[l];
	}
	cerr << ans << endl;
	for (int j = 0; j < stk.size(); j++)
	{
		cerr << stk[j] << endl;
	}
	cerr << "tt " << tt << endl;
	while (stk.size())
	{
		int x = min((int)stk.size(), K);
		vector<int> qry;
		for (int k = 0; k < x; k++)
		{
			qry.push_back(stk.back());
			stk.pop_back();
		}
		auto tmp = encode(qry);
		tmp.push_back(tt);
		int res = query_sample(tmp);
		for (int k = 0; k < (int)qry.size(); k++)
		{
			ans[qry[k]] = (res >> k & 1) ? 'S' : 'R';
		}
	}
	cerr << ans << endl;
	for (int j = 1; j <= n; j++)
	{
		answer_type(j, ans[j]);
	}
}

Compilation message

toxic.cpp: In function 'void determine_type(int)':
toxic.cpp:73:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int k = mid - i; k < qry.size(); k++)
      |                           ~~^~~~~~~~~~~~
toxic.cpp:88:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |   for (int k = 0; k < qry.size(); k++)
      |                   ~~^~~~~~~~~~~~
toxic.cpp:104:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |  for (int j = 0; j < stk.size(); j++)
      |                  ~~^~~~~~~~~~~~

Subtask #1

54.1 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Partially correct	53 ms	948 KB	Partially correct
3	Partially correct	54 ms	984 KB	Partially correct
4	Partially correct	55 ms	1112 KB	Partially correct
5	Partially correct	48 ms	1368 KB	Partially correct
6	Partially correct	51 ms	1280 KB	Partially correct
7	Partially correct	49 ms	1328 KB	Partially correct
8	Partially correct	49 ms	1432 KB	Partially correct
9	Partially correct	51 ms	1324 KB	Partially correct
10	Partially correct	48 ms	1300 KB	Partially correct
11	Partially correct	48 ms	1496 KB	Partially correct
12	Partially correct	52 ms	1108 KB	Partially correct
13	Partially correct	54 ms	1108 KB	Partially correct
14	Partially correct	58 ms	888 KB	Partially correct
15	Partially correct	48 ms	1360 KB	Partially correct
16	Partially correct	48 ms	1308 KB	Partially correct
17	Partially correct	49 ms	1324 KB	Partially correct
18	Partially correct	49 ms	1372 KB	Partially correct
19	Partially correct	48 ms	1364 KB	Partially correct
20	Partially correct	49 ms	1364 KB	Partially correct
21	Partially correct	49 ms	1420 KB	Partially correct
22	Partially correct	56 ms	1260 KB	Partially correct
23	Partially correct	53 ms	1028 KB	Partially correct
24	Partially correct	52 ms	1108 KB	Partially correct
25	Partially correct	52 ms	1016 KB	Partially correct
26	Partially correct	50 ms	896 KB	Partially correct
27	Partially correct	54 ms	860 KB	Partially correct
28	Partially correct	52 ms	972 KB	Partially correct
29	Partially correct	55 ms	1364 KB	Partially correct
30	Partially correct	49 ms	1356 KB	Partially correct
31	Partially correct	48 ms	1360 KB	Partially correct
32	Partially correct	49 ms	1364 KB	Partially correct
33	Partially correct	49 ms	1476 KB	Partially correct
34	Partially correct	62 ms	1364 KB	Partially correct
35	Partially correct	61 ms	1364 KB	Partially correct
36	Partially correct	6 ms	344 KB	Partially correct