| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 261069 | handlename | Password (RMI18_password) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
//#include "pandagames.h"
using namespace std;
#define pb push_back
#define mp make_pair
// 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.
#define DEBUG 1
#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;
}
int num[26];
string guess(int n,int s){
set<pair<int,string> > process;
for (int i=0;i<s;i++){
string cur;
for (int j=0;j<n;j++) cur.pb('a'+i);
num[i]=query(cur);
cur.clear();
for (int j=0;j<num[i];j++){
cur.pb('a'+i);
}
process.insert(mp(num[i],cur));
}
while (process.size()>1){
string one=(*(process.begin())).second;
process.erase(process.begin());
string two=(*(process.begin())).second;
process.erase(process.begin());
string res=two;
int id=0; //idth guy not fixed
for (int i=0;i<one.size();i++){
string cur=res;
while (true){
string lol;
for (int j=0;j<id;j++){
lol.pb(cur[j]);
}
lol.pb(one[i]);
for (int j=id;j<cur.size();j++){
lol.pb(cur[j]);
}
if (query(lol)==lol.size()){
cur=lol;
break;
}
id++;
}
id++;
res=cur;
}
process.insert(mp(res.size(),res));
}
return (*(process.begin())).second;
}
int main() {
fstream 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;
}