#include <bits/stdc++.h>
using namespace std;
vector<bool> answer(1000, 0);
void answer_clear()
{
for (int i=0; i<1000; i++)
answer[i] = 0;
}
bool ask_query(vector<bool> a)
{
cout << "Q ";
for (int i=0; i<1000; i++)
cout << a[i];
cout << '\n';
cout.flush();
char x;
cin >> x;
if (x=='P')
return 1;
return 0;
}
bool ask_query2(int x, int y)
{
cout << "Q ";
for (int i=0; i<x; i++)
cout << '0';
for (int i=x; i<=y; i++)
cout << '1';
for (int i=y+1; i<1000; i++)
cout << '0';
cout << endl;
char k;
cin >> k;
if (k=='P')
return 1;
return 0;
}
bool report(vector<bool> a)
{
cout << "A ";
for (int i=0; i<1000; i++)
cout << a[i];
cout << '\n';
cout.flush();
char x;
cin >> x;
if (x=='C')
return 1;
return 0;
}
long double prob;
bool range_query(int x, int y, bool known)
{
bool response;
if (known==1)
response = 1;
else
response = ask_query2(x, y);
if (response==1)
{
if (x==y)
answer[x] = 1;
else
{
int z = (x+y)/2;
bool a = range_query(x, z, 0);
if (a==0)
range_query(z+1, y, 1);
else
range_query(z+1, y, 0);
}
return 1;
}
return 0;
}
void work(int m)
{
int curr = 0;
bool go_on = 1;
while (go_on)
{
range_query(curr, min(curr+m-1, 999), 0);
if ((curr+m-1)>=999)
go_on = 0;
curr+=m;
}
}
int main()
{
std::ios::sync_with_stdio(false);
int N, T;
long double P;
cin >> N >> P >> T;
if (T==1)
{
while (T--)
{
vector<bool> query(N, 0);
vector<bool> ans(N, 0);
for (int i=0; i<N; i++)
{
query[i] = 1;
ans[i] = ask_query(query);
query[i] = 0;
}
bool L = report(ans);
if (L==0)
T = 0;
}
}
else
{
prob = P;
while (T--)
{
answer_clear();
if (P < 0.005)
work(1000);
else if (P < 0.01)
work(200);
else if (P < 0.02)
work(100);
else if (P < 0.03)
work(18);
else if (P < 0.05)
work(13);
else if (P < 0.10)
work(8);
else if (P < 0.15)
work(4);
else if (P < 0.19)
work(4);
else
work(2);
bool L = report(answer);
if (L==0)
T = 0;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
0 ms |
344 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
55 ms |
344 KB |
Output is correct |
2 |
Correct |
51 ms |
344 KB |
Output is correct |
3 |
Correct |
47 ms |
344 KB |
Output is correct |
4 |
Correct |
33 ms |
344 KB |
Output is correct |
5 |
Correct |
53 ms |
344 KB |
Output is correct |
6 |
Correct |
37 ms |
344 KB |
Output is correct |
7 |
Correct |
33 ms |
344 KB |
Output is correct |
8 |
Correct |
41 ms |
344 KB |
Output is correct |
9 |
Correct |
32 ms |
344 KB |
Output is correct |
10 |
Correct |
35 ms |
344 KB |
Output is correct |
11 |
Correct |
57 ms |
344 KB |
Output is correct |
12 |
Correct |
37 ms |
344 KB |
Output is correct |
13 |
Correct |
34 ms |
340 KB |
Output is correct |
14 |
Correct |
33 ms |
344 KB |
Output is correct |
15 |
Correct |
33 ms |
344 KB |
Output is correct |
16 |
Correct |
34 ms |
344 KB |
Output is correct |
17 |
Correct |
33 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
117 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=13.9) -> 90.00 points |
2 |
Correct |
405 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=59.9) -> 53.29 points |
3 |
Correct |
773 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=114.1) -> 49.74 points |
4 |
Correct |
1511 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=227.7) -> 51.25 points |
5 |
Correct |
2040 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=293.6) -> 50.90 points |
6 |
Correct |
2782 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=407.2) -> 62.16 points |
7 |
Correct |
3631 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=541.0) -> 63.67 points |
8 |
Correct |
4506 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=671.0) -> 75.02 points |
9 |
Correct |
5383 ms |
344 KB |
Output is correct (P=0.2, F=731.4, Q=781.6) -> 70.61 points |