# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305147 | bigDuck | Password (RMI18_password) | C++14 | 47 ms | 376 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;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
//#define int ll
int t, n, m, k, a[300010], q, l, r;
int cnt[300];
int query(string str);
string guess(int n, int s){
for(char c='a'; c<=('a'+s-1); c++){
string s;
for(int i=1; i<=n; i++){
s+="a"; s[s.length()-1]+=(c-'a');
}
cnt[c]=query(s);
}
string res;
for(int i=1; i<=n; i++){
for(char c1='a'; c1<='z'; c1++){
if(cnt[c1]==0){continue;}
bool v=true;
for(char c2='a'; (c2<='z') && (v==true) ; c2++){
if( (cnt[c2]==0) || c2==c1){
continue;
}string s2="a"; s2[0]+=(c1-'a');
for(int j=i+1; j<=n; j++){
s2+="a"; s2[s2.length()-1]+=(c2-'a');
}
int ac=query(res+s2);
if(ac<cnt[c2]){
v=false;
}
}
if(!v){continue;}
res+="a"; res[res.length()-1]+=(c1-'a');
cnt[c1]--;
}
}
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... |