# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941061 | socpite | Toxic Gene (NOI23_toxic) | C++17 | 19 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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> T;
vector<vector<int>> finding_nemo;
vector<int> vec(n);
vector<bool> bad(n+1, 0);
vector<bool> done(n+1, 0);
iota(vec.begin(), vec.end(), 1);
// vector<int> missing;
int tcnt = 0;
while(!vec.empty()){
// shuffle(vec.begin(), vec.end(), rng);
vector<int> sampling;
vector<int> species;
vector<int> missing;
for(int i = 0; i < min<int>(8, vec.size()); i++){
sampling.push_back(vec[i]);
for(int _ = 0; _ < (1<<i); _++)species.push_back(vec[i]);
}
for(int i = 0; i < sampling.size(); i++)vec.erase(vec.begin());
// cout << "????" << endl;
int tot1 = shuffled_query(species);
if(tot1 == species.size()){
finding_nemo.push_back(sampling);
}
else {
for(int i = 0; i < sampling.size(); i++){
if(tot1&(1<<i)){
shuffled_answer(sampling[i], 'S');
}
else missing.push_back(sampling[i]);
}
int ql = 0, r = missing.size()-1;
while(ql < r){
int mid = (ql+r)>>1;
vector<int> nw(missing.begin(), missing.begin() + mid + 1);
if(!finding_nemo.empty()){
vector<int> old_sampling = finding_nemo.back();
for(int i = 0; i < old_sampling.size(); i++){
for(int _ = 0; _ < (1<<i); _++)nw.push_back(old_sampling[i]);
}
}
int tmp = shuffled_query(nw);
if(tmp != nw.size()){
r = mid;
if(!finding_nemo.empty()){
vector<int> old_sampling = finding_nemo.back();
finding_nemo.pop_back();
for(int i = 0; i < old_sampling.size(); i++){
if(tmp&(1<<i))shuffled_answer(old_sampling[i], 'S');
else shuffled_answer(old_sampling[i], 'R');
}
}
}
else ql = mid+1;
}
tcnt++;
for(int i = 0; i <= ql; i++){
if(i < ql)shuffled_answer(missing[i], 'R');
else {
shuffled_answer(missing[i], 'T');
T.push_back(missing[i]);
}
}
for(int i = ql+1; i < missing.size(); i++){
bad[missing[i]] = 1;
vec.push_back(missing[i]);
}
}
}
// cout << T.back() << endl;
for(auto old_sampling: finding_nemo){
vector<int> nw;
for(int i = 0; i < old_sampling.size(); i++){
for(int _ = 0; _ < (1<<i); _++)nw.push_back(old_sampling[i]);
}
nw.push_back(T.back());
int tmp = shuffled_query(nw);
for(int i = 0; i < old_sampling.size(); i++){
if(tmp&(1<<i))shuffled_answer(old_sampling[i], 'S');
else shuffled_answer(old_sampling[i], 'R');
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |