This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int f[26];
int query(string s);
string guess(int n,int c)
{
for (char a='a';a<'a'+c;a++)
f[a-'a']=query(string(n,a));
string ans="";
for (char a='a';a<'a'+c;a++)
{
string tmp=ans;
for (int i=0;i<f[a-'a'];i++)
{
int st=0,en=ans.size();
while (st!=en)
{
int mid=(st+en+1)/2;
if (query(ans.substr(0,mid)+string(i+1,a))>mid+i)
st=mid;
else
en=mid-1;
}
tmp.insert(tmp.begin()+st,a);
}
ans=tmp;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |