# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1175566 | MuhammadSaram | COVID tests (CEOI24_covid) | C++20 | 696 ms | 408 KiB |
#include <bits/stdc++.h>
using namespace std;
int N;
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(string mask_str) {
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> find_positive() {
vector<bool> ans(N);
// int C=1;
// vector<int> v[C];
for (int i=0;i<N;i++)
{
string s(N,'0');s[i]='1';
if (test_students(s))
ans[i]=1;
// v[i%C].push_back(i);
}
// for (int j=0;j<C;j++)
// {
// int pre=-1;
// while (1)
// {
// int s=pre,e=v[j].size();
// while (s+1<e)
// {
// int mid=(s+e)/2;
// string q(N,'0');
// for (int i=s+1;i<=mid;i++)
// q[v[j][i]]='1';
// bool b=test_students(q);
// if (b)
// e=mid;
// else
// s=mid;
// }
// if (e<v[j].size())
// ans[v[j][e]]=1;
// else
// break;
// pre=e;
// }
// }
return ans;
}
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++) {
vector<bool> answer = find_positive();
assert(answer.size() == (size_t)N);
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;
}
컴파일 시 표준 에러 (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... |