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 query(string str);
string str, endChars, build, tmp, nEnd;
string guess(int n, int s) {
endChars="";
vector<int> freq(s);
for (int i = 0; i < s; i++) {
str="";
for (int it = 0; it < n; it++) {
str += (char)(i + 'a');
}
freq[i] = query(str);
}
for (int pos = n - 1; pos >= 0; pos--) {
for (int i = 0; i < s; i++) {
if (freq[i] > 0) {
build="";
for (int it = 0; it < freq[i]; it++) {
build += (char)(i + 'a');
}
bool work = true;
if ((int) build.size() + 1 + (int) endChars.size() <= n) {
for (int j = 0; j < s; j++) {
tmp="";
tmp += build;
tmp += (char)(j + 'a');
tmp += endChars;
if (query(tmp) == (int) tmp.length()) {
work = false;
break;
}
}
}
if (work) {
freq[i] -= 1;
nEnd="";
nEnd += (char)(i + 'a');
nEnd += endChars;
endChars=nEnd;
break;
}
}
}
}
return endChars;
}
# | 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... |