# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634907 | danikoynov | Password (RMI18_password) | C++14 | 3 ms | 368 KiB |
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;
const int maxs = 26;
int N, S, used[maxs];
int query(string s);
string guess(int n, int s)
{
N = n;
S = s;
string ans = "";
for (int i = 0; i < s; i ++)
{
string cur = "";
for (int j = 0; j < n; j ++)
cur = cur + (char)(i + 'a');
if (query(cur) == 1)
ans = ans + (char)(i + 'a'), used[i] = 1;
}
int len = query(ans);
for (int j = 0; j < s; j ++)
{
if (!used[j])
continue;
int id = 0;
string wt = "";
for (int i = 0; i < n; i ++)
{
if (ans[i] != (char)(j + 'a'))
wt = wt + ans[i];
}
string best = "";
for (int i = 0; i < n; i ++)
{
string cur = wt, new_cur = "";
for (int k = 0; k < n; k ++)
{
if (i == k)
new_cur = new_cur + (char)(j + 'a');
if (k != n - 1)
new_cur = new_cur + cur[k];
}
int sm = query(new_cur);
if (sm > len)
{
len = sm;
best = new_cur;
}
}
if (!best.empty())
ans = best;
}
return ans;
}
Compilation message (stderr)
# | 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... |