# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051752 | n1k | COVID tests (CEOI24_covid) | C++17 | 1630 ms | 344 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 <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
/// You may use:
// The number of students
int N, T;
// The probability any given student is positive
double P;
// This function performs a test on a subset of samples.
// Its argument is a vector of Booleans of length N,
// where the i-th element is true if the i-th sample should be added to the mix.
// It returns true if (and only if) at least one of the samples in the mix is positive.
bool test_students(std::vector<bool> mask) {
assert(mask.size() == (size_t)N);
std::string mask_str(N, ' ');
for (int i = 0; i < N; i++)
mask_str[i] = mask[i] ? '1' : '0';
printf("Q %s\n", mask_str.c_str());
fflush(stdout);
char answer;
scanf(" %c", &answer);
return answer == 'P';
}
/// You should implement:
// This function will be called once for each test instance.
// It should use test_students to determine which samples are positive.
// It must return a vector of Booleans of length N,
// where the i-th element is true if and only if the i-th sample is positive.
std::vector<bool> find_positive() {
std::vector<bool> answer(N);
vector<int> a(N);
iota(a.begin(), a.end(), 0);
shuffle(a.begin(), a.end(), mt19937{std::random_device{}()});
double E = N * P;
int take = T == 1 ? 1 : max(1., (1./(E / N)) * 2./3);
for(int i=0; i<N;){
take = T == 1 ? 1 : max(1., (1./(max(1., E) / N)) * 2./3);
//cerr << E << " " << take << endl;
vector<bool> mask(N);
for(int j=0; j<take and i+j<N; j++){
mask[i+j] = 1;
}
if(test_students(mask)){
int lb = i, rb = min(i + take - 1, N-1);
while(lb<rb){
int mb = (lb+rb)/2;
mask.assign(N, 0);
for(int j=lb; j<=mb; j++) mask[j]=1;
if(test_students(mask)){
rb = mb;
}else{
lb = mb + 1;
}
}
answer[lb]=1;
E--;
i = lb + 1;
}else{
i += take;
}
}
return answer;
}
int main() {
scanf("%d %lf %d", &N, &P, &T);
// You may perform any extra initialization here.
for (int i = 0; i < T; i++) {
std::vector<bool> answer = find_positive();
assert(answer.size() == (size_t)N);
std::string answer_str(N, ' ');
for (int j = 0; j < N; j++)
answer_str[j] = answer[j] ? '1' : '0';
printf("A %s\n", answer_str.c_str());
fflush(stdout);
char verdict;
scanf(" %c", &verdict);
if (verdict == 'W')
exit(0);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |