oj.uz

Submission #830615

# Submission time Handle Problem Language Result Execution time Memory
830615 2023-08-19T08:33:38 Z rainboy Toxic Gene (NOI23_toxic) C++17
93.25 / 100
 10 ms 468 KB 
#include "toxic.h"
#include <string>
#include <vector>

using namespace std;

typedef vector<int> vi;

const int S = 8;	/* 2^S <= 300 */

int min(int a, int b) { return a < b ? a : b; }

unsigned int X;

int rand_() {
	return (X *= 3) >> 1;
}

void determine_type(int n) {
	vi pp(n);
	for (int i = 0; i < n; i++)
		pp[i] = i;
	X = 12345;
	for (int i = 0; i < n; i++) {
		int j = rand_() % (i + 1), tmp;
		tmp = pp[i], pp[i] = pp[j], pp[j] = tmp;
	}
	string cc(n, '?');
	int m = (n + S - 1) / S;
	vi has(m, 0), hh(m, 0); int m_ = 0;
	for (int h = 0; h < m; h++) {
		int l = h * S, r = min((h + 1) * S, n);
		vi ii;
		for (int i = l; i < r; i++)
			for (int t = 0; t < 1 << i - l; t++)
				ii.push_back(pp[i] + 1);
		int b = query_sample(ii);
		if (b == (1 << r - l) - 1)
			hh[m_++] = h;
		else {
			has[h] = 1;
			for (int i = l; i < r; i++)
				if ((b & 1 << i - l) != 0)
					cc[i] = 'S';
		}
	}
	for (int h = 0; h < m; h++) {
		if (!has[h])
			continue;
		int l = h * S, r = min((h + 1) * S, n);
		int lower = l, upper = r;
		while (1) {
			while (upper - lower > 1) {
				int i_ = (lower + upper) / 2;
				vi ii;
				for (int i = lower; i < i_; i++)
					ii.push_back(pp[i] + 1);
				if (m_ > 0) {
					int h_ = hh[m_ - 1], l_ = h_ * S, r_ = min((h_ + 1) * S, n);
					for (int i = l_; i < r_; i++)
						for (int t = 0; t < 1 << i - l_; t++)
							ii.push_back(pp[i] + 1);
				}
				int b = query_sample(ii);
				if (b == (int) ii.size())
					lower = i_;
				else {
					upper = i_;
					if (m_ > 0) {
						int h_ = hh[m_ - 1], l_ = h_ * S, r_ = min((h_ + 1) * S, n);
						for (int i = lower; i < i_; i++)
							if (cc[i] == 'S')
								b--;
						for (int i = l_; i < r_; i++)
							cc[i] = (b & 1 << i - l_) != 0 ? 'S' : 'R';
						m_--;
					}
				}
			}
			cc[lower++] = 'T';
			upper = r;
			vi ii;
			for (int i = lower; i < upper; i++)
				ii.push_back(pp[i] + 1);
			if (m_ > 0) {
				int h_ = hh[m_ - 1], l_ = h_ * S, r_ = min((h_ + 1) * S, n);
				for (int i = l_; i < r_; i++)
					for (int t = 0; t < 1 << i - l_; t++)
						ii.push_back(pp[i] + 1);
			}
			int b = ii.size() == 0 ? 0 : query_sample(ii);
			if (b == (int) ii.size())
				break;
			if (m_ > 0) {
				int h_ = hh[m_ - 1], l_ = h_ * S, r_ = min((h_ + 1) * S, n);
				for (int i = lower; i < upper; i++)
					if (cc[i] == 'S')
						b--;
				for (int i = l_; i < r_; i++)
					cc[i] = (b & 1 << i - l_) != 0 ? 'S' : 'R';
				m_--;
			}
		}
		for (int i = l; i < r; i++)
			if (cc[i] == '?')
				cc[i] = 'R';
	}
	int t = 0;
	while (cc[t] != 'T')
		t++;
	while (m_--) {
		int h = hh[m_], l = h * S, r = min((h + 1) * S, n);
		vi ii;
		ii.push_back(pp[t] + 1);
		for (int i = l; i < r; i++)
			for (int t = 0; t < 1 << i - l; t++)
				ii.push_back(pp[i] + 1);
		int b = query_sample(ii);
		for (int i = l; i < r; i++)
			cc[i] = (b & 1 << i - l) != 0 ? 'S' : 'R';
	}
	for (int i = 0; i < n; i++)
		answer_type(pp[i] + 1, cc[i]);
}

Compilation message

toxic.cpp: In function 'void determine_type(int)':
toxic.cpp:35:31: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   35 |    for (int t = 0; t < 1 << i - l; t++)
      |                             ~~^~~
toxic.cpp:38:20: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   38 |   if (b == (1 << r - l) - 1)
      |                  ~~^~~
toxic.cpp:43:21: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   43 |     if ((b & 1 << i - l) != 0)
      |                   ~~^~~
toxic.cpp:61:34: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   61 |       for (int t = 0; t < 1 << i - l_; t++)
      |                                ~~^~~~
toxic.cpp:75:28: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   75 |        cc[i] = (b & 1 << i - l_) != 0 ? 'S' : 'R';
      |                          ~~^~~~
toxic.cpp:88:33: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   88 |      for (int t = 0; t < 1 << i - l_; t++)
      |                               ~~^~~~
toxic.cpp:100:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  100 |      cc[i] = (b & 1 << i - l_) != 0 ? 'S' : 'R';
      |                        ~~^~~~
toxic.cpp:116:31: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  116 |    for (int t = 0; t < 1 << i - l; t++)
      |                             ~~^~~
toxic.cpp:120:24: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  120 |    cc[i] = (b & 1 << i - l) != 0 ? 'S' : 'R';
      |                      ~~^~~

Subtask #1
93.25 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 8 ms 340 KB Partially correct
3 Partially correct 8 ms 400 KB Partially correct
4 Partially correct 9 ms 392 KB Partially correct
5 Partially correct 8 ms 340 KB Partially correct
6 Partially correct 8 ms 392 KB Partially correct
7 Partially correct 8 ms 340 KB Partially correct
8 Partially correct 8 ms 388 KB Partially correct
9 Partially correct 8 ms 340 KB Partially correct
10 Partially correct 8 ms 396 KB Partially correct
11 Partially correct 8 ms 340 KB Partially correct
12 Partially correct 8 ms 392 KB Partially correct
13 Correct 8 ms 332 KB Output is correct
14 Partially correct 8 ms 392 KB Partially correct
15 Partially correct 8 ms 340 KB Partially correct
16 Partially correct 9 ms 368 KB Partially correct
17 Partially correct 8 ms 340 KB Partially correct
18 Partially correct 9 ms 396 KB Partially correct
19 Partially correct 8 ms 336 KB Partially correct
20 Partially correct 8 ms 340 KB Partially correct
21 Partially correct 8 ms 396 KB Partially correct
22 Correct 8 ms 340 KB Output is correct
23 Correct 8 ms 340 KB Output is correct
24 Correct 8 ms 340 KB Output is correct
25 Partially correct 8 ms 340 KB Partially correct
26 Correct 8 ms 340 KB Output is correct
27 Correct 10 ms 340 KB Output is correct
28 Correct 8 ms 364 KB Output is correct
29 Partially correct 8 ms 340 KB Partially correct
30 Partially correct 8 ms 340 KB Partially correct
31 Partially correct 10 ms 468 KB Partially correct
32 Partially correct 8 ms 364 KB Partially correct
33 Partially correct 8 ms 340 KB Partially correct
34 Partially correct 8 ms 392 KB Partially correct
35 Partially correct 7 ms 340 KB Partially correct
36 Partially correct 1 ms 212 KB Partially correct