#include <bits/stdc++.h>
using namespace std;
int query(string str);
// string password;
// int query(string q) {
// int len = q.size();
// int i = 0, j = 0, plen = password.size();
// while (i < plen && j < len) {
// while ((i < plen) && (password[i] != q[j])) {
// i++;
// }
// if (i < plen) {
// i++;
// j++;
// }
// }
// return j;
// }
int rem[30][30][5005];
int tot = 50000;
int myquery(string &s){
assert(tot--);
return query(s);
}
int ask(int a,int b,int c,int d){
if(rem[a][b][c] != -1)return rem[a][b][c];
string tmp = "";
for(int i = 0;i<c;i++)
tmp += (char)(a + 'a');
for(int i = 0;i<d;i++)
tmp += (char)(b + 'a');
return rem[a][b][c] = myquery(tmp);
}
mt19937 rng(58);
string guess(int n, int s){
for(int i = 0;i<30;i++){
for(int j = 0;j<30;j++){
for(int c = 0;c<5005;c++){
rem[i][j][c] = -1;
}
}
}
vector<int> v;
for(int i = 0;i<s;i++){
v.push_back(i);
}
shuffle(v.begin(),v.end(),rng);
vector<int> cnt(s);
vector<int> used(s);
for(int i = 0;i<s;i++){
cnt[v[i]] = ask(v[i],0,n,0);
}
string res = "";
for(int x = n-1;x>=0;x--){
int val = 0;
while(cnt[v[val]] == 0)
val++;
for(int i = val+1;i<s;i++){
if(cnt[v[i]] == 0)continue;
if(ask(v[val],v[i],cnt[v[val]],n-cnt[v[val]]) >= cnt[v[val]] + used[v[i]] + 1){
val = i;
}
}
res += (char)(v[val] + 'a');
used[v[val]]++;
cnt[v[val]]--;
vector<int> tmp;
for(int i = 0;i<val;i++){
tmp.push_back(v[i]);
}
for(int i = val+1;i<v.size();i++){
tmp.push_back(v[i]);
}
tmp.push_back(v[val]);
v = tmp;
//cout << val << endl;
//cout << res << endl;
}
reverse(res.begin(),res.end());
return res;
}
// int main(){
// #ifdef Local
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
// #endif
// int n,s;
// cin >> n >> s;
// cin >> password;
// guess(n,s);
// }
Compilation message
password.cpp: In function 'std::string guess(int, int)':
password.cpp:71:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
71 | for(int i = val+1;i<v.size();i++){
| ~^~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
17872 KB |
Guessed the password with 76 queries. |
2 |
Runtime error |
9 ms |
17940 KB |
Execution killed with signal 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
17872 KB |
Guessed the password with 22 queries. |
2 |
Correct |
8 ms |
17868 KB |
Guessed the password with 47 queries. |
3 |
Runtime error |
8 ms |
17936 KB |
Execution killed with signal 13 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
35 ms |
17840 KB |
Guessed the password with 2155 queries. |
2 |
Correct |
74 ms |
17924 KB |
Guessed the password with 3372 queries. |
3 |
Correct |
108 ms |
17920 KB |
Guessed the password with 4941 queries. |
4 |
Correct |
243 ms |
17936 KB |
Guessed the password with 10806 queries. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
17872 KB |
Guessed the password with 76 queries. |
2 |
Runtime error |
9 ms |
17940 KB |
Execution killed with signal 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
17872 KB |
Guessed the password with 76 queries. |
2 |
Runtime error |
9 ms |
17940 KB |
Execution killed with signal 13 |
3 |
Halted |
0 ms |
0 KB |
- |