#include<bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
int i,j,p,q,d,m,k,sz;
int query(string q);
string ans;
pair <int,char> cnt[27];
string guess(int n,int s)
{
sz=0;
for(char c='a';i<='z';c++)
{
if(c-'a'+1>s)break;
string f="";
for(i=1;i<=n;i++)
f.push_back(c);
cnt[++sz]={query(f),c};
}
sort(cnt+1,cnt+sz+1);
for(i=1;i<=cnt[sz].first;i++)
ans.push_back(cnt[sz].second);
for(i=sz-1;i>=1;i--)
{
// cout<<ans<<" ans in the beginning"<<endl;
if(cnt[i].first==0)break;
int tek=ans.size();
string newans="";
string l="",r=ans;
l.push_back(ans[0]);
r.erase(0,1);
// cout<<l<<" nachalni "<<r<<endl;
j=0;
int still=cnt[i].first;
while(j<tek)
{
string f=l;
for(int g=1;g<=still;g++)
f.push_back(cnt[i].second);
f=f+r;
// cout<<f<<" for a query"<<endl;
p=query(f);
k=p-l.size();
if(k<still)
{
for(int g=1;g<=still-k;g++)
newans.push_back(cnt[i].second);
still=k;///stil-(stil-k)
}
newans.push_back(ans[j]);
j++;
l.push_back(ans[j]);
r.erase(0,1);
}
for(int g=1;g<=still;g++)
newans.push_back(cnt[i].second);
ans=newans;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
208 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Guessed the password with 29 queries. |
2 |
Correct |
2 ms |
208 KB |
Guessed the password with 116 queries. |
3 |
Correct |
2 ms |
208 KB |
Guessed the password with 169 queries. |
4 |
Correct |
3 ms |
296 KB |
Guessed the password with 220 queries. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Returned early from guess() after 2 queries. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
208 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
208 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |