| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1026615 |
2024-07-18T08:40:29 Z |
김은성(#10945) |
COVID tests (CEOI24_covid) |
C++17 |
|
9 ms |
380 KB |
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
/// You may use:
// The number of students
int N;
// 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.
vector<bool> answer, query;
int D;
int td[9] = {10, 30, 60, 100, 150, 200, 300, 400, 500};
double pos[9] = {0.002, 0.006, 0.012, 0.030,
0.040, 0.070, 0.110, 0.160, 0.210};
void solve(int lo, int hi){
int i;
for(i=lo; i<=hi; i++)
query[i] = 1;
bool x = test_students(query);
for(i=lo; i<=hi; i++)
query[i] = 0;
if(!x)
return;
if(lo==hi)
answer[lo] = 1;
else{
if(hi-lo < D){
for(int i=lo; i<=hi; i++)
solve(i, i);
}
else{
int i, x = lo-1;
for(i=1; i<=D; i++){
solve(x+1, (lo*(D-i) + hi*i)/D);
x = (lo*(D-i) + hi*i)/D;
}
}
}
}
std::vector<bool> find_positive() {
answer.resize(N);
query.resize(N);
int i;
for(i=0; i<9; i++){
if(pos[i] >= P){
D = td[i];
break;
}
}
D = -1000 * (int)(log(1-P) / log(2));
for(i=0; i<N; i++)
answer[i]= query[i] = 0;
solve(0, N-1);
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
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
31 | scanf(" %c", &answer);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:90:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
90 | scanf("%d %lf %d", &N, &P, &T);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:106:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
106 | scanf(" %c", &verdict);
| ~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
translate:wrong |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
344 KB |
Output is correct |
| 2 |
Correct |
8 ms |
344 KB |
Output is correct |
| 3 |
Correct |
6 ms |
344 KB |
Output is correct |
| 4 |
Correct |
7 ms |
344 KB |
Output is correct |
| 5 |
Correct |
7 ms |
344 KB |
Output is correct |
| 6 |
Correct |
8 ms |
344 KB |
Output is correct |
| 7 |
Correct |
8 ms |
344 KB |
Output is correct |
| 8 |
Incorrect |
0 ms |
380 KB |
translate:wrong |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
translate:wrong |
| 2 |
Halted |
0 ms |
0 KB |
- |
