#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 5e3;
const int SIGMA_MAX = 26;
/**int query (string candidate) {
cout << candidate << "\n";
int ret; cin >> ret;
return ret;
}**/
int query (string str);
string getCopy (int letter, int f) {
string ret = "";
for (int i = 0; i < f; i ++)
ret = ret + char (letter + 'a');
return ret;
}
int freq[SIGMA_MAX];
string guess (int n, int s) {
int steps = 0;
int present = 0;
int N = n, SIGMA = s;
string aux;
for (int letter = 0; letter < SIGMA; letter ++) {
aux = getCopy (letter, N);
freq[letter] = query (aux);
steps ++;
if (freq[letter] > 0)
present ++;
}
string done = "";
for (int pos = N - 1; pos >= 0 && present > 1; pos --) {
int left = 0, right = 1;
while (right < SIGMA) {
if (freq[left] == 0) {
left ++;
right = max (right, left + 1);
continue;
}
if (freq[right] == 0) {
right ++;
continue;
}
aux = getCopy (left, freq[left]);
aux = aux + char (right + 'a');
aux = aux + done;
int len = query (aux);
steps ++;
if (len != N && len != (int) aux.size ())
right ++;
else if (len != N){
left ++;
right = max (left + 1, right);
}
else
return aux;
}
done = char (left + 'a') + done;
///cout << "pana acum done este egal cu " << done << "\n";
freq[left] --;
if (freq[left] == 0)
present --;
}
///cout << "am termina in " << steps << "\n";
int missing = 0;
while (missing < SIGMA && freq[missing] == 0)
missing ++;
done = getCopy (missing, freq[missing]) + done;
return done;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Guessed the password with 144 queries. |
2 |
Correct |
2 ms |
344 KB |
Guessed the password with 370 queries. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Guessed the password with 48 queries. |
2 |
Correct |
1 ms |
436 KB |
Guessed the password with 149 queries. |
3 |
Correct |
1 ms |
344 KB |
Guessed the password with 18 queries. |
4 |
Correct |
2 ms |
344 KB |
Guessed the password with 319 queries. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
94 ms |
756 KB |
Guessed the password with 12176 queries. |
2 |
Correct |
143 ms |
1004 KB |
Guessed the password with 23017 queries. |
3 |
Correct |
296 ms |
1264 KB |
Guessed the password with 28217 queries. |
4 |
Incorrect |
397 ms |
768 KB |
Could not guess the password with 50000 queries. |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Guessed the password with 144 queries. |
2 |
Correct |
2 ms |
344 KB |
Guessed the password with 370 queries. |
3 |
Correct |
0 ms |
344 KB |
Guessed the password with 48 queries. |
4 |
Correct |
1 ms |
436 KB |
Guessed the password with 149 queries. |
5 |
Correct |
1 ms |
344 KB |
Guessed the password with 18 queries. |
6 |
Correct |
2 ms |
344 KB |
Guessed the password with 319 queries. |
7 |
Correct |
94 ms |
756 KB |
Guessed the password with 12176 queries. |
8 |
Correct |
143 ms |
1004 KB |
Guessed the password with 23017 queries. |
9 |
Correct |
296 ms |
1264 KB |
Guessed the password with 28217 queries. |
10 |
Incorrect |
397 ms |
768 KB |
Could not guess the password with 50000 queries. |
11 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Guessed the password with 144 queries. |
2 |
Correct |
2 ms |
344 KB |
Guessed the password with 370 queries. |
3 |
Correct |
0 ms |
344 KB |
Guessed the password with 48 queries. |
4 |
Correct |
1 ms |
436 KB |
Guessed the password with 149 queries. |
5 |
Correct |
1 ms |
344 KB |
Guessed the password with 18 queries. |
6 |
Correct |
2 ms |
344 KB |
Guessed the password with 319 queries. |
7 |
Correct |
94 ms |
756 KB |
Guessed the password with 12176 queries. |
8 |
Correct |
143 ms |
1004 KB |
Guessed the password with 23017 queries. |
9 |
Correct |
296 ms |
1264 KB |
Guessed the password with 28217 queries. |
10 |
Incorrect |
397 ms |
768 KB |
Could not guess the password with 50000 queries. |
11 |
Halted |
0 ms |
0 KB |
- |