Submission #859826

#	Time	Username	Problem	Language	Result	Execution time	Memory
859826		Andrei_Calota	Password (RMI18_password)	C++14	30 / 100	397 ms	1264 KiB

password

#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 steps = 0;

    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);
       steps ++;
       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);
          steps ++;

          if (len != N && len != (int) aux.size ())
            right ++;
          else if (len != N){
            left ++;
            right = max (left + 1, right);
          }
          else
            return aux;
       }
       done = char (left + 'a') + done;
       ///cout << "pana acum done este egal cu " << done << "\n";
       freq[left] --;
       if (freq[left] == 0)
         present --;
    }

    ///cout << "am termina in " << steps << "\n";

    int missing = 0;
    while (missing < SIGMA && freq[missing] == 0)
       missing ++;
    done = getCopy (missing, freq[missing]) + done;
    return done;

}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 30
• Subtask 5: 0 / 20