| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1117171 | allin27x | Password (RMI18_password) | C++17 | 1026 ms | 1480 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;
 
int query(string str);
 
string guess(int n, int s){
    mt19937 rng(time(nullptr));
    string res;
    vector<int> nc(s, 0);
    vector<int> to(s, -1);
    for (int i=0; i<s; i++) nc[i] = query(string(n,'a'+i));
    int last = -1;
    while (res.size()<n){
        string rev = res; reverse(rev.begin(), rev.end());
        vector<int> rel;
        for (int i=0; i<s; i++) 
            if (nc[i] && (i==last || to[i] == last)) rel.push_back(i);
        int mx = rel[0];
        for (int i: rel){
            if (i== rel[0]) continue;
            if (!nc[i] || (i!=last && to[i]!=last)) continue;
            if (query(string(nc[i], 'a'+i) + string(1,'a'+mx) + rev) != nc[i] + 1 + res.size()) {
                to[mx] = i;
                mx = i;
            } else {
                to[i] = mx;
            }
        }
        nc[mx] --; res += 'a' + mx;
        last = mx;
    }
    reverse(res.begin(), res.end());
    return res;
}
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... | ||||
