답안 #951005

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
951005	2024-03-21T04:01:20 Z	GrandTiger1729	Toxic Gene (NOI23_toxic)	C++17	93.25 / 100	15 ms	600 KB

toxic

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

const int K = 8, T = 30;
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);
	srand(mt19937(time(0))() + 777771449);
	random_shuffle(ord.begin(), ord.end());
	string ans(n + 1, 'R');
	int cnt = 0;
	int tt = -1;
	vector<int> stk;
	int i = 0;
	while (cnt < T && i < n)
	{
		int j = min(n, i + K);
		int xx = -1;
		{
			vector<int> qry;
			for (int k = i; k < j; 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]);
			}
			xx = query_sample(encode(qry));
			if (xx == (1 << qry.size()) - 1)
			{
				stk.insert(stk.end(), qry.begin(), qry.end());
				i = j;
				continue;
			}
			else
			{
				for (int k = j - i; k < qry.size(); k++)
				{
					ans[qry[k]] = (xx >> k & 1) ? 'S' : 'R';
				}
				for (int k = 0; k < x; k++)
				{
					stk.pop_back();
				}
			}
		}
		int l = i, r = j;
		auto make_query = [&](int mid)
		{
			vector<int> qry;
			for (int k = l; 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;
		};
		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 - l);
				for (int k = mid - l; k < qry.size(); k++)
				{
					ans[qry[k]] = (res >> k & 1) ? 'S' : 'R';
				}
				for (int k = 0; k < x; k++)
				{
					stk.pop_back();
				}
				r = mid;
			}
		}
		for (int k = 0; k < l - i; k++)
		{
			ans[ord[i + k]] = (xx >> k & 1) ? 'S' : 'R';
		}
		ans[ord[l]] = 'T';
		i = l + 1;
		tt = ord[l];
		cnt++;
	}
	while (i < n)
	{
		stk.push_back(ord[i++]);
	}
	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';
		}
	}
	for (int j = 1; j <= n; j++)
	{
		answer_type(j, ans[j]);
	}
}

Compilation message

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

Subtask #1

93.25 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	10 ms	348 KB	Output is correct
3	Correct	10 ms	348 KB	Output is correct
4	Correct	10 ms	524 KB	Output is correct
5	Correct	12 ms	504 KB	Output is correct
6	Correct	15 ms	348 KB	Output is correct
7	Correct	14 ms	348 KB	Output is correct
8	Correct	15 ms	344 KB	Output is correct
9	Correct	12 ms	344 KB	Output is correct
10	Correct	11 ms	344 KB	Output is correct
11	Correct	11 ms	348 KB	Output is correct
12	Correct	10 ms	348 KB	Output is correct
13	Correct	10 ms	348 KB	Output is correct
14	Correct	10 ms	516 KB	Output is correct
15	Correct	11 ms	508 KB	Output is correct
16	Partially correct	11 ms	508 KB	Partially correct
17	Correct	11 ms	344 KB	Output is correct
18	Partially correct	11 ms	508 KB	Partially correct
19	Correct	11 ms	348 KB	Output is correct
20	Partially correct	11 ms	344 KB	Partially correct
21	Partially correct	11 ms	600 KB	Partially correct
22	Correct	10 ms	348 KB	Output is correct
23	Correct	9 ms	348 KB	Output is correct
24	Correct	14 ms	348 KB	Output is correct
25	Correct	10 ms	348 KB	Output is correct
26	Correct	10 ms	348 KB	Output is correct
27	Correct	10 ms	508 KB	Output is correct
28	Correct	10 ms	348 KB	Output is correct
29	Correct	11 ms	500 KB	Output is correct
30	Correct	11 ms	348 KB	Output is correct
31	Correct	11 ms	348 KB	Output is correct
32	Correct	11 ms	344 KB	Output is correct
33	Correct	11 ms	348 KB	Output is correct
34	Correct	11 ms	348 KB	Output is correct
35	Correct	13 ms	348 KB	Output is correct
36	Correct	3 ms	344 KB	Output is correct