#include <bits/stdc++.h>
// author: aykhn
using namespace std;
typedef long long ll;
#define pb push_back
#define ins insert
#define mpr make_pair
int cnt[30];
priority_queue<pair<int, string>, vector<pair<int, string>>, greater<pair<int, string>>> pq;
int query(string str);
/*void MERGE(string &a, string &b)
{
int prev = query(b);
int i = 0;
for (int j = 0; j <= b.length(); j++)
{
string tmp = b;
b.ins(b.begin() + j, a[i]);
int x = query(b);
if (x <= prev) b = tmp;
else i++;
}
}*/
string guess(int n, int s)
{
string tmp = "";
for (int i = 0; i < n; i++)
{
tmp.pb('a');
}
int prev = 0;
for (int i = 0; i < s; i++)
{
cnt[i] = query(tmp);
pq.push(mpr(cnt[i], tmp.substr(0, cnt[i])));
for (int j = 0; j < n; j++) tmp[j]++;
}
while (pq.size() > 1)
{
string A = pq.top().second;
pq.pop();
string B = pq.top().second;
pq.pop();
//MERGE(A, B);
pq.push(mpr(B.length(), B));
}
return pq.top().second;
}
Compilation message
password.cpp: In function 'std::string guess(int, int)':
password.cpp:40:9: warning: unused variable 'prev' [-Wunused-variable]
40 | int prev = 0;
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Returned early from guess() after 16 queries. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Returned early from guess() after 3 queries. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Returned early from guess() after 13 queries. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Returned early from guess() after 16 queries. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Returned early from guess() after 16 queries. |
2 |
Halted |
0 ms |
0 KB |
- |