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>
#ifdef ALE
#include "grader.cpp"
#endif
using namespace std;
int query(string p);
int v[50];
string sol,t;
bool found;
char possible='a';
int l;
string guess(int a, int b){
for(int q=0;q<a;q++){
for(int k=0;k<b;k++)v[k]=0;
found=false;
possible='a';
v[0]=1;
while(!found){
t=sol;
for(int i=0;i<a-q;i++)t+=possible;
l=query(t);
bool prev=false;
for(int i=0;i<b;i++){
if(v[i])continue;
v[i]=1;
t[sol.size()]='a'+i;
if(query(t)>l){
possible='a'+i;
prev=true;
i=b;
}
}
if(!prev){
sol+=possible;
found=true;
}
}
}
return sol;
}
# | 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... |