#include <bits/stdc++.h>
#include "toxic.h"
using namespace std;
#define isz(a) (int)(a).size()
const int NM = 300;
int n;
char a[NM+5];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bool calc(){
int cnt = 0;
for (int i = 1; i <= n; i++)
if (a[i] == '?') cnt++;
return cnt;
}
void determine_type(int _n){
int n = _n;
for (int i = 1; i <= n; i++) a[i] = ' ';
int l = 1, r = n, ft = -1;
while (l <= r){
int mid = (l+r)/2;
vector <int> species = {};
for (int i = 1; i <= mid; i++) species.push_back(i);
if (query_sample(species) < mid){
ft = mid;
r = mid-1;
}
else l = mid+1;
}
a[ft] = 'T';
while (true){
vector <int> arr = {};
for (int i = 1; i <= n; i++)
if (a[i] == ' ' && isz(arr) < 8) arr.push_back(i);
if (arr.empty()) break;
vector <int> species = {};
for (int i = 0; i < isz(arr); i++){
for (int j = 0; j < (1<<i); j++) species.push_back(arr[i]);
}
species.push_back(ft);
int tmp = query_sample(species);
for (int i = 0; i < isz(arr); i++)
if ((tmp>>i)&1) a[arr[i]] = 'S';
else a[arr[i]] = '?';
}
while (true){
int cnt = calc();
if (cnt <= 30) break;
vector <int> arr = {}, species;
for (int i = 1; i <= n; i++)
if (a[i] == '?') arr.push_back(i);
shuffle(arr.begin(), arr.end(), rng);
int sz = (cnt+29)/30;
for (int i = 0; i < isz(arr); i += sz){
species.clear();
for (int j = i; j < min(i+sz, isz(arr)); j++)
species.push_back(j);
if (query_sample(species) > 0){
for (int x : species) a[x] = 'R';
}
}
}
for (int i = 1; i <= n; i++)
if (a[i] == '?'){
if (query_sample({i}) > 0) a[i] = 'R'; else a[i] = 'T';
}
for (int i = 1; i <= n; i++)
answer_type(i, a[i]);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 3 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 4 |
Partially correct |
5 ms |
504 KB |
Partially correct |
| 5 |
Partially correct |
7 ms |
348 KB |
Partially correct |
| 6 |
Partially correct |
5 ms |
500 KB |
Partially correct |
| 7 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 8 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 9 |
Partially correct |
6 ms |
500 KB |
Partially correct |
| 10 |
Partially correct |
9 ms |
600 KB |
Partially correct |
| 11 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 12 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 13 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 14 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 15 |
Partially correct |
5 ms |
500 KB |
Partially correct |
| 16 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 17 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 18 |
Partially correct |
7 ms |
348 KB |
Partially correct |
| 19 |
Partially correct |
6 ms |
500 KB |
Partially correct |
| 20 |
Partially correct |
6 ms |
344 KB |
Partially correct |
| 21 |
Partially correct |
5 ms |
600 KB |
Partially correct |
| 22 |
Correct |
5 ms |
512 KB |
Output is correct |
| 23 |
Correct |
4 ms |
348 KB |
Output is correct |
| 24 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 25 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 26 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 27 |
Partially correct |
5 ms |
524 KB |
Partially correct |
| 28 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 29 |
Partially correct |
5 ms |
344 KB |
Partially correct |
| 30 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 31 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 32 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 33 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 34 |
Partially correct |
5 ms |
508 KB |
Partially correct |
| 35 |
Partially correct |
5 ms |
348 KB |
Partially correct |
| 36 |
Partially correct |
2 ms |
348 KB |
Partially correct |
