Submission #286911

#	Time	Username	Problem	Language	Result	Execution time	Memory
286911		crossing0ver	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<bits/stdc++.h>
#include <sstream>
#define vi vector<int>
#define all(x) x.begin(),x.end()

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;
}
string suf;
int m;
string guess(int n, int s) {
	for (int i = 1; i <= n; i++) {
		int len = suf.size();
		char LAST = 'a';
		string pref,P;
		for (int z = 1; z + len <= n; z++) {
			int cur = len;
		for (char c = 'a'; c < 'a' + s; c++) {
			P = pref + c;
			P += suf;
			if (query(P) > cur) {
				LAST = c;
				pref += c;
			}
		}
		reverse(all(suf));
		suf+=LAST;
		reverse(all(suf));
	}
	}
	return suf;
}

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)

/tmp/ccAWeo6p.o: In function `query(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)':
grader.cpp:(.text+0x0): multiple definition of `query(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)'
/tmp/ccXH5rHP.o:password.cpp:(.text+0x80): first defined here
/tmp/ccAWeo6p.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccXH5rHP.o:password.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status