제출 #246266

#제출 시각아이디문제언어결과실행 시간메모리
246266kevleePassword (RMI18_password)C++17
50 / 100
608 ms632 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mod 1000000007 #define h1 7897897897897897 #define h2 7897466719774591 #define b1 98762051 #define b2 98765431 #define inf 1000000000 #define pi 3.1415926535897932384626 #define LMAX 9223372036854775807 #define ll long long #define fi first #define se second #define pii pair<int, int> #define pll pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vp vector<pii> #define SET(a, b) memset(a, b, sizeof(a)); #define all(x) (x).begin(), (x).end() #define flush fflush(stdout) #define debug printf("Hello\n") #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define FORD(i, a, b) for (int i = (a); i >= (b); i--) //priority_queue <int, vector <int>, greater <int> > pq; int query(string str); int freq[30]; string guess(int n, int s) { string ret; FOR(i, 0, s-1) { char c = 'a' + i; string q(n, c); freq[i] = query(q); } int st = 0; FOR(i, 0, s-1) { if (freq[i] > 0) { char c = i + 'a'; FOR(j, 1, freq[i]) { ret += c; } st = i + 1; break; } } int curlen = ret.length(); FOR(i, st, s-1) { char c = i + 'a'; string ch; ch += c; int pos = -1; //insert new letter just after position pos string q; while (true) { if (freq[i] == 0) break; if (pos == -1) { q = ch + ret; } else { q = ret.substr(0, pos+1) + ch; q += ret.substr(pos+1, curlen - pos - 1); } if (query(q) == curlen + 1) { ret = q; curlen++; pos++; freq[i]--; } else { pos++; } if (pos >= curlen) break; } } return ret; }
#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...