# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1114849 | 2024-11-19T17:08:47 Z | PagodePaiva | COVID tests (CEOI24_covid) | C++17 | 5365 ms | 508 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. std::vector<bool> find_positive() { std::vector<bool> answer(N); int n = N; vector <bool> v; for(int i = 0;i < N;i++){ for(int j = 0;j < n;j++){ v.push_back(false); } v[i] = true; if(test_students(v)) answer[i] = true; v.clear(); } 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 336 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 336 KB | Output is correct |
2 | Correct | 20 ms | 336 KB | Output is correct |
3 | Correct | 17 ms | 508 KB | Output is correct |
4 | Correct | 18 ms | 336 KB | Output is correct |
5 | Correct | 20 ms | 336 KB | Output is correct |
6 | Correct | 17 ms | 336 KB | Output is correct |
7 | Correct | 18 ms | 336 KB | Output is correct |
8 | Correct | 19 ms | 336 KB | Output is correct |
9 | Correct | 21 ms | 336 KB | Output is correct |
10 | Correct | 15 ms | 336 KB | Output is correct |
11 | Correct | 24 ms | 336 KB | Output is correct |
12 | Correct | 18 ms | 336 KB | Output is correct |
13 | Correct | 16 ms | 336 KB | Output is correct |
14 | Correct | 21 ms | 336 KB | Output is correct |
15 | Correct | 20 ms | 336 KB | Output is correct |
16 | Correct | 25 ms | 336 KB | Output is correct |
17 | Correct | 25 ms | 336 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5365 ms | 336 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |