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 <stdio.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int query(string str);
string guess(int n, int s){
string ans = "";
for (int i = 0; i < s; ++i){
char ch = 'a';
ch += i;
int len = (int)ans.size();
string nans = "";
for (int j = 0; j <= len; ++j){
string add = "";
int is = 1;
while (1){
add += ch;
string q = "";
for (int k = 0; k < j; ++k){
q += ans[k];
}
q += add;
for (int k = j; k < len; ++k){
q += ans[k];
}
if ((int)q.size() > n)
break;
int kek = query(q);
if (kek == len + is){
is += 1;
nans += ch;
}
else{
break;
}
}
if (j < len){
nans += ans[j];
}
}
ans = nans;
}
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... |