#include<bits/stdc++.h>
#include"toxic.h"
using namespace std;
mt19937 rng(69420);
int query_sample(vector<int> species);
int h[301];
int shuffled_query(vector<int> speices){
for(auto &v: speices)v = h[v];
return query_sample(speices);
}
void shuffled_answer(int x, char c){
answer_type(h[x], c);
}
void determine_type(int n){
int l = 1, r = n;
iota(h+1, h+n+1, 1);
shuffle(h+1, h+n+1, rng);
vector<int> vec(n);
vector<bool> done(n+1, 0);
iota(vec.begin(), vec.end(), 1);
while(l < r){
int mid = (l+r)>>1;
int tmp = shuffled_query(vector<int>(vec.begin() + l - 1, vec.begin() + mid));
if(tmp != mid - l + 1)r = mid;
else l = mid+1;
}
vec.erase(vec.begin() + l - 1);
shuffled_answer(l, 'T');
int d = 0;
vector<int> sampling;
vector<int> species;
for(int i = 0; i < vec.size(); i++){
if(species.size() + (1<<d) < 300){
for(int _ = 0; _ < (1<<d); _++)species.push_back(vec[i]);
sampling.push_back(vec[i]);
d++;
}
else {
int tot1 = shuffled_query(species);
if(tot1 == species.size()){
species.push_back(l);
int tot2 = shuffled_query(species);
for(int j = 0; j < sampling.size(); j++){
if(tot2&(1<<j)){
shuffled_answer(sampling[j], 'S');
done[sampling[j]] = 1;
}
else shuffled_answer(sampling[j], 'R');
}
}
else {
// cout << tot1 << " " << tot2 << endl;
for(int j = 0; j < sampling.size(); j++){
if(tot1&(1<<j)){
shuffled_answer(sampling[j], 'S');
done[sampling[j]] = 1;
}
else {
if(shuffled_query({sampling[j]}))shuffled_answer(sampling[j], 'R');
else shuffled_answer(sampling[j], 'T');
}
}
}
sampling = {vec[i]};
species = {vec[i]};
d = 1;
}
}
int tot1 = shuffled_query(species);
if(tot1 == species.size()){
species.push_back(l);
int tot2 = shuffled_query(species);
for(int j = 0; j < sampling.size(); j++){
if(tot2&(1<<j)){
shuffled_answer(sampling[j], 'S');
done[sampling[j]] = 1;
}
else shuffled_answer(sampling[j], 'R');
}
}
else {
// cout << tot1 << " " << tot2 << endl;
for(int j = 0; j < sampling.size(); j++){
if(tot1&(1<<j)){
shuffled_answer(sampling[j], 'S');
done[sampling[j]] = 1;
}
else {
if(shuffled_query({sampling[j]}))shuffled_answer(sampling[j], 'R');
else shuffled_answer(sampling[j], 'T');
}
}
}
}
Compilation message
toxic.cpp: In function 'void determine_type(int)':
toxic.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
38 | for(int i = 0; i < vec.size(); i++){
| ~~^~~~~~~~~~~~
toxic.cpp:46:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | if(tot1 == species.size()){
| ~~~~~^~~~~~~~~~~~~~~~~
toxic.cpp:49:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
49 | for(int j = 0; j < sampling.size(); j++){
| ~~^~~~~~~~~~~~~~~~~
toxic.cpp:59:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | for(int j = 0; j < sampling.size(); j++){
| ~~^~~~~~~~~~~~~~~~~
toxic.cpp:76:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | if(tot1 == species.size()){
| ~~~~~^~~~~~~~~~~~~~~~~
toxic.cpp:79:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
79 | for(int j = 0; j < sampling.size(); j++){
| ~~^~~~~~~~~~~~~~~~~
toxic.cpp:89:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
89 | for(int j = 0; j < sampling.size(); j++){
| ~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 3 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 4 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 5 |
Partially correct |
6 ms |
476 KB |
Partially correct |
| 6 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 7 |
Partially correct |
6 ms |
508 KB |
Partially correct |
| 8 |
Partially correct |
6 ms |
504 KB |
Partially correct |
| 9 |
Partially correct |
6 ms |
344 KB |
Partially correct |
| 10 |
Partially correct |
6 ms |
344 KB |
Partially correct |
| 11 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 12 |
Partially correct |
8 ms |
348 KB |
Partially correct |
| 13 |
Partially correct |
6 ms |
512 KB |
Partially correct |
| 14 |
Partially correct |
6 ms |
344 KB |
Partially correct |
| 15 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 16 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 17 |
Partially correct |
6 ms |
344 KB |
Partially correct |
| 18 |
Partially correct |
6 ms |
600 KB |
Partially correct |
| 19 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 20 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 21 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 22 |
Correct |
7 ms |
512 KB |
Output is correct |
| 23 |
Correct |
5 ms |
348 KB |
Output is correct |
| 24 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 25 |
Partially correct |
6 ms |
600 KB |
Partially correct |
| 26 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 27 |
Partially correct |
6 ms |
512 KB |
Partially correct |
| 28 |
Partially correct |
6 ms |
344 KB |
Partially correct |
| 29 |
Partially correct |
6 ms |
512 KB |
Partially correct |
| 30 |
Partially correct |
6 ms |
344 KB |
Partially correct |
| 31 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 32 |
Partially correct |
6 ms |
600 KB |
Partially correct |
| 33 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 34 |
Partially correct |
6 ms |
512 KB |
Partially correct |
| 35 |
Partially correct |
6 ms |
348 KB |
Partially correct |
| 36 |
Partially correct |
1 ms |
348 KB |
Partially correct |
