Submission #941013

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
941013	2024-03-08T05:08:58 Z	socpite	Toxic Gene (NOI23_toxic)	C++17	45.2235 / 100	11 ms	544 KB

toxic

#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');
	// vector<int> missing;
    while(!vec.empty()){
        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]);
        }
        int tot1 = shuffled_query(species);
        if(tot1 == species.size()){
            species.push_back(l);
            int tot2 = shuffled_query(species);
            for(int i = 0; i < sampling.size(); i++){
                if((tot1&tot2)&(1<<i))shuffled_answer(sampling[i], 'S');
                else shuffled_answer(sampling[i], 'R');
                vec.erase(find(vec.begin(), vec.end(), sampling[i]));
            }
        }
        else {
            for(int i = 0; i < sampling.size(); i++){
                if(tot1&(1<<i)){
                    shuffled_answer(sampling[i], 'S');
                    vec.erase(find(vec.begin(), vec.end(), sampling[i]));
                }
                else missing.push_back(sampling[i]);
            }
            int l = 0, r = missing.size()-1;
            while(l < r){
                int mid = (l+r)>>1;
                if(!shuffled_query(vector<int>(missing.begin(), missing.begin() + mid + 1)))r = mid;
                else l = mid+1;
            }
            for(int i = 0; i <= l; i++){
                if(i < l)shuffled_answer(missing[i], 'R');
                else shuffled_answer(missing[i], 'T');
                vec.erase(find(vec.begin(), vec.end(), missing[i]));
            }
        }
    }
}

Compilation message

toxic.cpp: In function 'void determine_type(int)':
toxic.cpp:45:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         if(tot1 == species.size()){
      |            ~~~~~^~~~~~~~~~~~~~~~~
toxic.cpp:48:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             for(int i = 0; i < sampling.size(); i++){
      |                            ~~^~~~~~~~~~~~~~~~~
toxic.cpp:55:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |             for(int i = 0; i < sampling.size(); i++){
      |                            ~~^~~~~~~~~~~~~~~~~

Subtask #1

45.22352941 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Partially correct	9 ms	348 KB	Partially correct
3	Partially correct	8 ms	348 KB	Partially correct
4	Partially correct	9 ms	348 KB	Partially correct
5	Partially correct	9 ms	516 KB	Partially correct
6	Partially correct	10 ms	348 KB	Partially correct
7	Partially correct	9 ms	348 KB	Partially correct
8	Partially correct	8 ms	512 KB	Partially correct
9	Partially correct	9 ms	348 KB	Partially correct
10	Partially correct	9 ms	348 KB	Partially correct
11	Partially correct	9 ms	348 KB	Partially correct
12	Partially correct	9 ms	348 KB	Partially correct
13	Partially correct	9 ms	348 KB	Partially correct
14	Partially correct	8 ms	512 KB	Partially correct
15	Partially correct	10 ms	348 KB	Partially correct
16	Partially correct	8 ms	348 KB	Partially correct
17	Partially correct	10 ms	516 KB	Partially correct
18	Partially correct	9 ms	344 KB	Partially correct
19	Partially correct	10 ms	472 KB	Partially correct
20	Partially correct	9 ms	348 KB	Partially correct
21	Partially correct	9 ms	348 KB	Partially correct
22	Correct	8 ms	348 KB	Output is correct
23	Correct	7 ms	348 KB	Output is correct
24	Partially correct	8 ms	348 KB	Partially correct
25	Partially correct	8 ms	348 KB	Partially correct
26	Partially correct	8 ms	348 KB	Partially correct
27	Partially correct	9 ms	348 KB	Partially correct
28	Partially correct	8 ms	348 KB	Partially correct
29	Partially correct	10 ms	512 KB	Partially correct
30	Partially correct	9 ms	348 KB	Partially correct
31	Partially correct	9 ms	344 KB	Partially correct
32	Partially correct	11 ms	516 KB	Partially correct
33	Partially correct	9 ms	344 KB	Partially correct
34	Partially correct	9 ms	544 KB	Partially correct
35	Partially correct	9 ms	348 KB	Partially correct
36	Partially correct	1 ms	348 KB	Partially correct