#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define conts continue
#define sz(a) (int)a.size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &x, T y){
x = min(x,y);
}
template<typename T>
void amax(T &x, T y){
x = max(x,y);
}
template<typename A,typename B>
string to_string(pair<A,B> p);
string to_string(const string &s){
return "'"+s+"'";
}
string to_string(const char* s){
return to_string((string)s);
}
string to_string(bool b){
return b?"true":"false";
}
template<typename A>
string to_string(A v){
string res = "{";
trav(x,v){
res += to_string(x)+",";
}
if(res.back() == ',') res.pop_back();
res += "}";
return res;
}
template<typename A,typename B>
string to_string(pair<A,B> p){
return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}
#define debug(x) cout << "[" << #x << "]: "; cout << to_string(x) << endl
const int MOD = 1e9 + 7;
const int NN = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;
/// 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);
// return answer;
int n = N;
vector<bool> ans(n);
auto go = [&](int l, int r, auto &&go){
if(l > r) return;
vector<bool> mask(n);
for(int i = l; i <= r; ++i){
mask[i] = 1;
}
if(!test_students(mask)) return;
if(l == r){
ans[l] = 1;
return;
}
int mid = (l+r) >> 1;
go(l,mid,go);
go(mid+1,r,go);
};
go(0,n-1,go);
// rep(i,n){
// vector<bool> mask(n);
// mask[i] = 1;
// if(test_students(mask)){
// ans[i] = 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;
}
Compilation message
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:94:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
94 | scanf(" %c", &answer);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:146:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
146 | scanf("%d %lf %d", &N, &P, &T);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:162:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
162 | scanf(" %c", &verdict);
| ~~~~~^~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
13 ms |
344 KB |
Output is correct |
| 2 |
Correct |
11 ms |
344 KB |
Output is correct |
| 3 |
Correct |
13 ms |
344 KB |
Output is correct |
| 4 |
Correct |
17 ms |
596 KB |
Output is correct |
| 5 |
Correct |
12 ms |
344 KB |
Output is correct |
| 6 |
Correct |
16 ms |
344 KB |
Output is correct |
| 7 |
Correct |
14 ms |
344 KB |
Output is correct |
| 8 |
Correct |
9 ms |
344 KB |
Output is correct |
| 9 |
Correct |
10 ms |
344 KB |
Output is correct |
| 10 |
Correct |
10 ms |
344 KB |
Output is correct |
| 11 |
Correct |
13 ms |
344 KB |
Output is correct |
| 12 |
Correct |
9 ms |
344 KB |
Output is correct |
| 13 |
Correct |
10 ms |
344 KB |
Output is correct |
| 14 |
Correct |
9 ms |
344 KB |
Output is correct |
| 15 |
Correct |
10 ms |
344 KB |
Output is correct |
| 16 |
Correct |
15 ms |
344 KB |
Output is correct |
| 17 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
41 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=17.8) -> 52.47 points |
| 2 |
Correct |
183 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=78.0) -> 28.98 points |
| 3 |
Correct |
380 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=150.0) -> 27.09 points |
| 4 |
Correct |
732 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=303.5) -> 26.95 points |
| 5 |
Correct |
953 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=388.5) -> 27.20 points |
| 6 |
Correct |
1401 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=569.4) -> 27.95 points |
| 7 |
Correct |
1822 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=751.4) -> 28.75 points |
| 8 |
Correct |
2316 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=967.6) -> 29.45 points |
| 9 |
Correct |
2799 ms |
344 KB |
Output is correct (P=0.2, F=731.4, Q=1112.6) -> 29.18 points |
