# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1134535 | Nurislam | COVID tests (CEOI24_covid) | C++20 | 4254 ms | 392836 KiB |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define pb push_back
int n;
double P;
bool tst(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';
}
std::vector<bool> find_positive() {
vector<bool> ans(n, 0);
auto dfs = [&](auto dfs, int l, int r) -> void{
if(r - l < 10){
vector<bool> m(n, 0);
for(int i = l; i <= r; i++){
m[i] = 1;
if(tst(m))ans[i]=1;
m[i]= 0;
}
return;
}
int bl = 58;
vector<bool> mark(n, 0);
for(int i = l; i <= r; i+=bl){
int nl = i , nr = min(i + bl-1, r);
for(int j = nl; j <= nr; j++)mark[j] = 1;
if(tst(mark))dfs(dfs, nl, nr);
for(int j = nl; j <= nr; j++)mark[j] = 0;
}
};
dfs(dfs, 0, n-1);
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++) {
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;
}
컴파일 시 표준 에러 (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... |