#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, vi &pos){
for(int i = 0; i < pos.size(); ++i){
A[pos[i]] = 0;
if(l <= i && i <= r) A[pos[i]] = 1;
}
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int ran(int l, int r){
return uniform_int_distribution<int>(l, r)(rng);
}
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;
if(P > 0.02){
double best = 100000000;
int bestS = -1;
for(int j = N/S-10; j <= N; ++j){
if(j<1) continue;
if(((N+j-1)/j + S) * (log2(j)) < best){
best= ((N+j-1)/j + S) * (log2(j));
bestS = j;
}
}
S = bestS;
}else{
S = N/S;
}
vector<vector<int>> block;
vector<int> F;
for(int j = 0; j < N; ++j){
F.pb(j);
swap(F[ran(0, j)], F[j]);
}
for(int j = 0; j < N; j += S){
block.pb({});
for(int l = j; l < min(N, j + S); ++l){
block.back().pb(F[l]);
}
}
vector<bool> ans(N);
for(auto v: block){
int l = 0, r = int(v.size())-1;
vector<bool> arr(N);
for(;l <= r;){
f(arr, l, r, v);
bool is = test_students(arr);
if(!is) break;
if(l == r){
ans[v[l]] = 1;
break;
}
int lm = l, rm = r - 1, fst = r;
while(lm <= rm){
int mid = lm+rm>>1;
f(arr, l, mid, v);
if(test_students(arr)){
fst = mid;
rm = mid - 1;
}else lm = mid + 1;
}
ans[v[fst]] = 1;
l = fst + 1;
}
}
find_positive(ans);
}
return 0;
}
Compilation message
Main.cpp: In function 'void f(std::vector<bool>&, int, int, std::vector<int>&)':
Main.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | for(int i = 0; i < pos.size(); ++i){
| ~~^~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:130:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
130 | int mid = lm+rm>>1;
| ~~^~~
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | scanf(" %c", &answer);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'void find_positive(std::vector<bool>)':
Main.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
51 | scanf(" %c", &verdict);
| ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:71:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
71 | scanf("%d %lf %d", &N, &P, &T);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
6 ms |
344 KB |
Output is correct |
| 5 |
Correct |
7 ms |
344 KB |
Output is correct |
| 6 |
Correct |
6 ms |
344 KB |
Output is correct |
| 7 |
Correct |
5 ms |
344 KB |
Output is correct |
| 8 |
Correct |
6 ms |
344 KB |
Output is correct |
| 9 |
Correct |
6 ms |
344 KB |
Output is correct |
| 10 |
Correct |
6 ms |
344 KB |
Output is correct |
| 11 |
Correct |
6 ms |
344 KB |
Output is correct |
| 12 |
Correct |
6 ms |
344 KB |
Output is correct |
| 13 |
Correct |
6 ms |
344 KB |
Output is correct |
| 14 |
Correct |
10 ms |
344 KB |
Output is correct |
| 15 |
Correct |
7 ms |
344 KB |
Output is correct |
| 16 |
Correct |
6 ms |
344 KB |
Output is correct |
| 17 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 8 |
| 18 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
31 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=10.8) -> 90.00 points |
| 2 |
Correct |
133 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=47.6) -> 90.00 points |
| 3 |
Correct |
232 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=94.5) -> 90.00 points |
| 4 |
Correct |
552 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=218.4) -> 57.62 points |
| 5 |
Correct |
742 ms |
448 KB |
Output is correct (P=0.039856, F=246.3, Q=284.4) -> 55.60 points |
| 6 |
Correct |
1055 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=419.0) -> 57.08 points |
| 7 |
Correct |
2522 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=1000.0) -> 17.45 points |
| 8 |
Correct |
2481 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=1000.0) -> 27.62 points |
| 9 |
Correct |
2478 ms |
492 KB |
Output is correct (P=0.2, F=731.4, Q=1000.0) -> 36.45 points |
