# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1082953 | 2024-09-02T08:32:33 Z | mychecksedad | COVID tests (CEOI24_covid) | C++17 | 4545 ms | 476 KB |
#include<bits/stdc++.h> using namespace std; #define pb push_back #define all(x) x.begin(),x.end() #define ll long long int #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define en cout << '\n' 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. void find_positive(vector<bool> answer) { 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); } void f(vector<bool> &A, int l, int r){ for(int i = 0; i < A.size(); ++i) A[i] = 0; for(int i = l; i <= r; ++i) A[i] = 1; } int main() { int T; scanf("%d %lf %d", &N, &P, &T); if(P > 0.2){ for(int i = 0; i < T; ++i){ vector<bool> ans(N), arr(N); for(int j = 0; j < N; ++j){ arr[j] = 1; ans[j] = test_students(arr); arr[j] = 0; } find_positive(ans); } return 0; } for (int i = 0; i < T; i++) { int S = N * P; vector<vector<int>> block; for(int j = 0; j < N; j += S){ block.pb({}); for(int l = j; l < min(N, j + S); ++l){ block.back().pb(l); } } vector<bool> ans(N); for(auto v: block){ int sz = int(v.size()) - 1; int l = v[0], r = v.back(); vector<bool> arr(N); for(;l <= r;){ f(arr, l, r); bool is = test_students(arr); if(!is) break; if(l == r){ ans[l] = 1; break; } int lm = l, rm = r, fst = r; while(lm <= rm){ int mid = lm+rm>>1; f(arr, l, mid); if(test_students(arr)){ fst = mid; rm = mid - 1; }else lm = mid + 1; } ans[fst] = 1; r = fst + 1; } } find_positive(ans); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 344 KB | Output is correct |
2 | Correct | 6 ms | 344 KB | Output is correct |
3 | Correct | 6 ms | 344 KB | Output is correct |
4 | Correct | 6 ms | 344 KB | Output is correct |
5 | Correct | 6 ms | 344 KB | Output is correct |
6 | Correct | 6 ms | 344 KB | Output is correct |
7 | Correct | 6 ms | 344 KB | Output is correct |
8 | Correct | 6 ms | 344 KB | Output is correct |
9 | Correct | 8 ms | 344 KB | Output is correct |
10 | Execution timed out | 4545 ms | 344 KB | Time limit exceeded (wall clock) |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2818 ms | 476 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |