제출 #859818

#제출 시각아이디문제언어결과실행 시간메모리
859818Andrei_CalotaPassword (RMI18_password)C++14
10 / 100
95 ms508 KiB
#include <bits/stdc++.h> using namespace std; const int N_MAX = 5e3; const int SIGMA_MAX = 26; /**int query (string candidate) { cout << candidate << "\n"; int ret; cin >> ret; return ret; }**/ int query (string str); string getCopy (int letter, int f) { string ret = ""; for (int i = 0; i < f; i ++) ret = ret + char (letter + 'a'); return ret; } int freq[SIGMA_MAX]; string guess (int n, int s) { int present = 0; int N = n, SIGMA = s; string aux; for (int letter = 0; letter < SIGMA; letter ++) { aux = getCopy (letter, N); freq[letter] = query (aux); if (freq[letter] > 0) present ++; } string done = ""; for (int pos = N - 1; pos >= 0 && present > 1; pos --) { int left = 0, right = 1; while (right < SIGMA) { if (freq[left] == 0) { left ++; right = max (right, left + 1); continue; } if (freq[right] == 0) { right ++; continue; } aux = getCopy (left, freq[left]); aux = aux + char (right + 'a'); aux = aux + done; int len = query (aux); if (len == freq[left]) right ++; else { left ++; right = max (left + 1, right); } } done = char (left + 'a') + done; ///cout << "pana acum done este egal cu " << done << "\n"; freq[left] --; if (freq[left] == 0) present --; } int missing = 0; while (missing < SIGMA && freq[missing] == 0) missing ++; done = getCopy (missing, freq[missing]) + done; return done; }
#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...