oj.uz

Submission #1064716

# Submission time Handle Problem Language Result Execution time Memory
1064716 2024-08-18T17:07:53 Z AlgorithmWarrior Password (RMI18_password) C++14
0 / 100
 5 ms 344 KB 
// 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 <queue>

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 str);

class cmp
{
public:
    bool operator()(string a,string b)
    {
        return a.size()>b.size();
    }
};

string guess(int n, int s)
{
    int cnt[300];
    char ch;
    priority_queue<string,vector<string>,cmp>pq;
    for(ch='a';ch<'a'+s;++ch)
    {
        int i;
        string s="";
        for(i=1,s=ch;query(s)==s.size();++i,s+=ch);
        cnt[ch]=i-1;
        s.pop_back();
        if(s.size())
            pq.push(s);
    }
    while(pq.size()>1)
    {
        string s1=pq.top(); pq.pop();
        string s2=pq.top(); pq.pop();
        int i,j=0;
        int siz=s1.size();
        int siz2=s2.size();
        string rez="";
        string* p=&s1;
        for(i=0;i<=siz;++i)
        {
            while(j<siz2 && query(rez+s2[j]+*p)==(rez+s2[j]+*p).size())
                rez+=s2[j++];
            if(i<siz)
            {
                rez+=s1[i];
                ++p;
            }
        }
        pq.push(rez);
    }
    return pq.top();
}

Compilation message

password.cpp: In function 'std::string guess(int, int)':
password.cpp:55:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for(i=1,s=ch;query(s)==s.size();++i,s+=ch);
      |                      ~~~~~~~~^~~~~~~~~~
password.cpp:56:13: warning: array subscript has type 'char' [-Wchar-subscripts]
   56 |         cnt[ch]=i-1;
      |             ^~
password.cpp:72:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             while(j<siz2 && query(rez+s2[j]+*p)==(rez+s2[j]+*p).size())
      |                             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
password.cpp:48:9: warning: variable 'cnt' set but not used [-Wunused-but-set-variable]
   48 |     int cnt[300];
      |         ^~~
password.cpp: At global scope:
password.cpp:30:13: warning: 'void end(int)' defined but not used [-Wunused-function]
   30 | static void end(int success) {
      |             ^~~
password.cpp:27:18: warning: 'numQueries' defined but not used [-Wunused-variable]
   27 | static int n, s, numQueries;
      |                  ^~~~~~~~~~
password.cpp:27:15: warning: 's' defined but not used [-Wunused-variable]
   27 | static int n, s, numQueries;
      |               ^
password.cpp:27:12: warning: 'n' defined but not used [-Wunused-variable]
   27 | static int n, s, numQueries;
      |            ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Returned early from guess() after 57 queries.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 344 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Returned early from guess() after 57 queries.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Returned early from guess() after 57 queries.
2 Halted 0 ms 0 KB -