#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <stack>
typedef long long ll;
using namespace std;
const int N = 2e5 + 10;
int n, t;
long double p;
bool ch(int l, int r) {
string s = string(n, '0');
for (int i = l - 1; i < r; i++) {
s[i] = '1';
}
cout << "Q " << s << endl;
char x;
cin >> x;
if (x == 'P') return true;
return false;
}
int main() {
cin >> n >> p >> t;
if (t == 1) {
string ans = string(n, '0');
for (int i = 1; i <= n; i++) {
cout << "Q ";
string s = string(n, '0');
s[i - 1] = '1';
cout << s << endl;
char x;
cin >> x;
if (x == 'P') ans[i - 1] = '1';
}
cout << "A " << ans << endl;
char x;
cin >> x;
return 0;
}
while (t--) {
string answ = string(n, '0');
int last = 0;
while (1) {
if (!ch(last + 1, n)) {
break;
}
int l = last + 1, r = n - 1, ans = last;
while (l <= r) {
int mid = (l + r) / 2;
if (!ch(last + 1, mid)) {
ans = mid;
l = mid + 1;
}
else r = mid - 1;
}
answ[ans] = '1';
last = ans + 1;
}
cout << "A " << answ << endl;
char x;
cin >> x;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Output is correct |
2 |
Correct |
5 ms |
344 KB |
Output is correct |
3 |
Correct |
5 ms |
344 KB |
Output is correct |
4 |
Correct |
3 ms |
344 KB |
Output is correct |
5 |
Correct |
4 ms |
344 KB |
Output is correct |
6 |
Correct |
4 ms |
344 KB |
Output is correct |
7 |
Correct |
4 ms |
344 KB |
Output is correct |
8 |
Correct |
4 ms |
344 KB |
Output is correct |
9 |
Correct |
2 ms |
344 KB |
Output is correct |
10 |
Correct |
4 ms |
344 KB |
Output is correct |
11 |
Correct |
4 ms |
344 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
5 ms |
344 KB |
Output is correct |
14 |
Correct |
4 ms |
344 KB |
Output is correct |
15 |
Correct |
5 ms |
344 KB |
Output is correct |
16 |
Correct |
3 ms |
344 KB |
Output is correct |
17 |
Correct |
4 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points |
2 |
Correct |
85 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=52.9) -> 78.89 points |
3 |
Correct |
162 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=114.3) -> 49.51 points |
4 |
Correct |
449 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=277.6) -> 32.16 points |
5 |
Correct |
617 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=388.7) -> 27.17 points |
6 |
Correct |
1133 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=663.5) -> 21.19 points |
7 |
Correct |
1655 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=1002.6) -> 17.38 points |
8 |
Correct |
2420 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=1497.8) -> 14.12 points |
9 |
Correct |
3040 ms |
344 KB |
Output is correct (P=0.2, F=731.4, Q=1898.6) -> 12.19 points |