#include<bits/stdc++.h>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
/// You may use:
// The number of students
const int TAILLE_MAX=1000+5;
const double INFINI=1000.0*1000.0*1000.0;
int N,nbTest;
vector<bool> rep;
vector<bool> attendu;
double puis[TAILLE_MAX],puisMoins[TAILLE_MAX];
double memo[TAILLE_MAX];
int suiv[TAILLE_MAX];
// 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(vector<bool> mask) {
assert(mask.size() == (size_t)N);
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';
}
/*bool test_students(vector<bool> mask) {
nbTest++;
bool ans=false;
for (int i=0;i<N;i++) {
if (mask[i] and attendu[i]) {
ans=true;
}
}
return ans;
}*/
bool dicho(int deb,int fin,bool assure) {
if (!assure) {
vector<bool> quest(N);
for (int i=deb;i<=fin;i++) {
if (!rep[i]) {
quest[i]=true;
}
}
if (!test_students(quest)) {
return false;
}
}
if (deb==fin) {
rep[deb]=true;
}
else {
int mid=(deb+fin)/2;
if (!dicho(deb,mid,false)) {
dicho(mid+1,fin,true);
}
}
return true;
}
void calc(int taille) {
for (int i=0;i<N;i+=taille) {
bool trouve=true;
while (trouve) {
trouve=dicho(i,min(i+taille-1,N-1),false);
}
}
}
/// 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.
vector<bool> find_positive() {
rep.clear();
rep.resize(N,false);
if (P>0.17) {
calc(4);
}
else if (P>0.15) {
calc(4);
}
else if (P>0.9) {
calc(8);
}
else if (P>0.06) {
calc(8);
}
else if (P>0.03) {
calc(16);
}
else if (P>0.02) {
calc(32);
}
else if (P>0.01) {
calc(64);
}
else if (P>0.004) {
calc(128);
}
else {
calc(1000);
}
return rep;
}
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;
}
/*int main() {
int T;
cin>>N>>P>>T;
// You may perform any extra initialization here.
char val;
for (int i = 0; i < T; i++) {
attendu.clear();
for (int j=0;j<N;j++) {
cin>>val;
//cout<<val;
attendu.push_back(val=='1');
}
std::vector<bool> answer = find_positive();
for (int j=0;j<N;j++) {
if (attendu[j]!=answer[j]) {
cout<<"PROBLEME"<<" "<<i<<" "<<j<<endl;
return 0;
}
}
}
cout<<nbTest/T<<endl;
cout<<"OK"<<endl;
return 0;
}*/
Compilation message
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
38 | scanf(" %c", &answer);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:129:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
129 | scanf("%d %lf %d", &N, &P, &T);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:144:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
144 | scanf(" %c", &verdict);
| ~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
15 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=11.0) -> 90.00 points |
| 2 |
Correct |
125 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=48.5) -> 90.00 points |
| 3 |
Correct |
231 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=95.6) -> 87.42 points |
| 4 |
Correct |
475 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=202.3) -> 73.43 points |
| 5 |
Correct |
627 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=263.0) -> 70.80 points |
| 6 |
Correct |
990 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=401.2) -> 65.11 points |
| 7 |
Correct |
1344 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=544.8) -> 62.30 points |
| 8 |
Correct |
1701 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=723.0) -> 59.01 points |
| 9 |
Correct |
2095 ms |
344 KB |
Output is correct (P=0.2, F=731.4, Q=852.4) -> 54.16 points |
