# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1220382 | KindaGoodGames | Text editor (CEOI24_editor) | C++20 | 1 ms | 324 KiB |
#include<bits/stdc++.h>
#include<chrono>
using namespace std;
/// You may use:
const int MAXA = 1000000;
const int MAXIT = 1000;
// The number of students
int n;
// The probability any given student is positive
double P;
std::default_random_engine rnd{std::random_device{}()};
std::uniform_real_distribution<double> dist(0, MAXA);
// 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() {
srand(time(NULL));
vector<int> perm(n);
iota(perm.begin(),perm.end(), 0);
// unsigned seed = chrono::system_clock::now().time_since_epoch().count();
// shuffle (perm.begin(), perm.end(), std::default_random_engine(seed));
// for(int i = 0; i < n; i++){
// shuffled[perm[i]] = i;
// }
std::vector<bool> answer(n,true);
// std::vector<bool> left(n,true);
for(int k = 0; k < MAXIT; k++){
vector<bool> take(n);
for(int i = 0; i < n; i++){
if(!answer[i]) continue;
if((dist(rnd)/MAXA) > P) {
take[i] = true;
}
}
bool b = test_students(take);
if(!b){
for(int i = 0; i < n; i++){
if(!take[i]) continue;
answer[i] = false;
}
}
}
return answer;
}
int main() {
int T;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |