Submission #851549

#TimeUsernameProblemLanguageResultExecution timeMemory
851549MilosMilutinovicPassword (RMI18_password)C++14
50 / 100
254 ms1204 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++) #define per(i,a,n) for (int i=n-1;i>=a;i--) #define pb push_back #define eb emplace_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se second #define SZ(x) ((int)(x).size()) typedef vector<int> VI; typedef basic_string<int> B; typedef long long ll; typedef pair<int,int> PII; typedef double db; mt19937 mrand(random_device{}()); const ll mod=1000000007; int rnd(int x) { return mrand() % x;} ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;} // head int cnt[30]; int query(string s); string guess(int n,int s) { rep(i,0,s) { cnt[i]=query(string(n,(char)('a'+i))); } string res=""; rep(i,0,n) { VI f; rep(j,0,26) if (cnt[j]>0) f.pb(j); int c=f[0]; rep(j,1,SZ(f)) { string str=res; str+=(char)('a'+c); rep(k,0,cnt[f[j]]) str+=(char)('a'+f[j]); int qv=query(str); if (qv!=cnt[f[j]]+SZ(res)+1) { c=f[j]; } } res+=(char)('a'+c); cnt[c]-=1; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...