# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755968 | vjudge1 | Password (RMI18_password) | C++17 | 821 ms | 428 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <sstream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#include <bits/stdc++.h>
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) {
i++;
j++;
}
}
if (DEBUG) {
cout << "Question #" << numQueries << " [" << q << "] answer " << j << endl;
}
return j;
}*/
int query(string q);
string guess(int n, int s){
string res="";
int sum=0;
int cur=0;
int tab[s];
for (int i = 0; i < s; ++i)
{
string t="";
for (int j = 0; j < n; ++j)
{
char x=char(i+'a');
t.push_back(x);
}
tab[i]=query(t);
}
int check[s];
memset(check,0,sizeof check);
int lst=-1;
while(cur<n)
{
bool test=false;
for (int i = 0; i < s; ++i)
{
if (check[i]==tab[i]) continue;
if (lst!=-1&&i<lst) continue;
string t="";
char x=char(i+'a');
for (int i = 0; i < cur; ++i)
{
t.push_back(res[i]);
}t.push_back(x);
for (int i = cur; i < res.size(); ++i)
{
t.push_back(res[i]);
}
if (t.size()>n) break;
if (query(t)>sum){
sum++;
check[i]++;
test=true;
res="";
lst=i;
for (int i = 0; i < t.size(); ++i)
{
res.push_back(t[i]);
}
break;
}
}
if(!test||lst==s-1){
cur++;
lst=-1;
}
}
//cout<< sum<<endl;
return res;
}
/*int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//ifstream f("password.in");
cin >> 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)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |