| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1118485 | Ciprian | Password (RMI18_password) | C++14 | 12 ms | 712 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 s);
vector<char>c;
map<char, int>cnt;
char divide(string pref,int l, int r){
    if(l==r){
        char x;
        for(int i=0; i<l; i++){
            if(!cnt[c[i]])continue;
            x=c[i];
        }for(int i=c.size()-1; i>r; i--){
            if(!cnt[c[i]])continue;
            x=c[i];
        }if(query(pref+c[l]+string(cnt[x], x))==pref.size()+cnt[x]+1)return c[l];
        return '1';
    }else{
        int mid=(l+r)/2;
        char w=divide(pref, mid+1, r);
        if(w!='1'){
            return w; 
        }return divide(pref, l, mid);
    }
}
string guess(int n, int s){
    char a='a';
    
    for(int j=1; j<=s; j++){
        cnt[a]=query(string(n, a));
        if (cnt[a]) c.push_back(a);
        a++;
    }
    string w="";
    for(int i=1; i<=n; i++){
        int r=0;
        char x=divide(w, 0, c.size()-1);
        w+=x;
        cnt[x]--;
        
    }
    
    return w;
}
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... | ||||
