Submission #645245

#	Time	Username	Problem	Language	Result	Execution time	Memory
645245		alexdd	Password (RMI18_password)	C++17	Compilation error	0 ms	0 KiB

password

// Sample grader for contestants' use.
//
// Usage: place your input data in the file password.in in the format
//
// line 1: N S
// line 2: hidden_password
//
// Then compile this grader together with your implementation.
// Run the binary to see your guessing strategy at work!
// Set DEBUG to 1 to print all queries.
#include <fstream>
#include <iostream>
#include <sstream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#include<unordered_map>

using namespace std;

#define DEBUG 0
#define MAX_QUERIES 50000
#define MAX_N 5000
#define MAX_SIGMA 26

static string password;
static int n, s, numQueries;
static stringstream msg;

static void end(int success) {
  cout << (success ? "SUCCESS! " : "ERROR: ") << msg.str() << endl;
  exit(0);
}

int query(string q) {
  if (++numQueries > MAX_QUERIES) {
    msg << "Could not guess the password with " << MAX_QUERIES << " questions.";
    end(0);
  }

  int len = q.size();

  // validation
  if (len < 1 || len > n) {
    msg << "Query '" << q << "' should have length between 1 and "
        << n << " characters.";
    end(0);
  }

  for (int i = 0; i < len; i++) {
    if (q[i] < 'a' || q[i] >= 'a' + s) {
      msg << "Illegal character '" << q[i] << "' found.";
      end(0);
    }
  }

  // while possible, advance one character in q and find its next
  // occurrence in password
  int i = 0, j = 0, plen = password.size();
  while (i < plen && j < len) {
    while ((i < plen) && (password[i] != q[j])) {
      i++;
    }
    if (i < plen) { /* found a match */
      i++;
      j++;
    }
  }

  if (DEBUG) {
    cout << "Question #" << numQueries << " [" << q << "] answer " << j << endl;
  }
  return j;
}

    unordered_map<string,int> umap;
string tochar(int ch)
{
    char ceva=ch+'a';
    string nush="";
    nush=nush+ceva;
    return nush;
}
int intreaba(string str)
{
    if(str=="")
        return 0;
    if(umap.count(str)==0)
        umap[str]=query(str);
    return umap[str];
}
string guess(int n, int s)
{
    umap.clear();
    string rez="";
    for(int i=1;i<n;i++)
    {
        for(int ch=0;ch<s;ch++)
        {
            if(intreaba(rez+tochar(ch))==intreaba(rez))
                continue;
            bool bl=0;
            for(int bd=0;bd<s;bd++)
            {
                if(bd==ch)
                    continue;
                if(intreaba(rez+tochar(ch))<intreaba(rez+tochar(bd)+tochar(ch)))
                {
                    bl=1;
                    break;
                }
            }
            if(bl==0)
            {
                rez=rez+tochar(ch);
                break;
            }
        }
    }
    for(int ch=0;ch<s;ch++)
    {
        if(intreaba(rez+tochar(ch))==n)
        {
            return rez+tochar(ch);
        }
    }
}


int main() {

  ifstream f("password.in");
  f >> n >> s >> password;
  f.close();
  assert(n && s && !password.empty());

  string answer = guess(n, s);
  if (DEBUG) {
    cout << "Your answer: [" << answer << "]\n";
  }

  if (answer.compare(password)) {
    msg << "Your answer was [" << answer
        << "] which does not match the password [" << password << "].";
    end(0);
  } else {
    msg << "You guessed the password with " << numQueries << " queries.";
    end(1);
  }

	return 0;
}

Compilation message (stderr)

password.cpp: In function 'std::string guess(int, int)':
password.cpp:95:16: warning: control reaches end of non-void function [-Wreturn-type]
   95 |     string rez="";
      |                ^~
/usr/bin/ld: /tmp/ccMCls7M.o: in function `query(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)':
grader.cpp:(.text+0x80): multiple definition of `query(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)'; /tmp/ccu66FNM.o:password.cpp:(.text+0x270): first defined here
/usr/bin/ld: /tmp/ccMCls7M.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccu66FNM.o:password.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status