#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pair<int, int>, null_type, less<pair<int, int>>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vdd vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////
void init(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 1e6+9;
const int LOG = 25;
const ll inf = 1e18;
const ll mod = 1e9+7;
int freq[30];
string pass;
bool subsequence(string a, string b){
int ind = 0;
for(int i = 0; i < b.size();i++){
if(b[i] == a[ind]){
ind++;
if(ind == a.size())return 1;
}
}
return 0;
}
int query(string str);
string guess(int n, int s){
for(int i = 0; i < s;i++){
freq[i] = 0;
}
for(int i = 0; i < s;i++){
char x = i+'a';
string c = string(1, x);
while(c.size() <= n){
int res = query(c);
if(res == c.size())freq[i] = c.size();
else break;
c += x;
}
}
string c = "";
for(int i = 0; i < s;i++){
char x = i+'a';
if(freq[i] != 0){
int k = freq[i];
while(k--){
c += x;
}
freq[i] = 0;
break;
}
}
for(int j = 0; j < s;j++){
if(freq[j] == 0)continue;
string x = string(1, char(j + 'a'));
string temp = "";
vi v;
while(freq[j]--){
temp += x;
string mat = "";
bool ok = 0;
for(int i = 0; i < c.size();i++){
mat += c[i];
string one = mat + temp;
if(query(one) != one.size()){
v.pb(i-1);
ok = 1;
break;
}
}
if(!ok){
v.pb(c.size()-1);
}
}
//cout << x << " " << c << endl;
int cnt = 0;
sort(all(v));
for(int y : v){
//cout << y << " ";
c.insert(y+cnt+1,x);
cnt++;
}
//cout << endl;
}
return c;
}
/*string guess(int n, int s){
string c = "";
for(int i = 0; i < s;i++){
char x = i + 'a';
if(query(c + x) != 0){
c = x;
break;
}
}
for(int i = 0;c.size() < n && i < s;i++){
char x = i + 'a';
//cout << x << endl;
while(c.size() < n){
bool ok = 0;
for(int j = 0;j <= c.size();j++){
string temp = c;
temp.insert(j, string(1, x));
if(query(temp) == temp.size()){
c = temp;
ok = 1;
break;
}
}
if(!ok){
break;
}
}
}
return c;
}*/
/*
void run_case(){
pass = "aeafeddbadcab";
string s = guess(13, 6);
cout << s << endl;
cout << (s == pass ? "YES" : "NO") << endl;
}
int main(){
init();
speed;
int t;
//cin >> t;
t = 1;
while(t--){
run_case();
}
}*/
/*
NEVER GIVE UP!
DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
Your Guide when stuck:
- Continue keyword only after reading the whole input
- Don't use memset with testcases
- Check for corner cases(n=1, n=0)
- Check where you declare n(Be careful of declaring it globally and in main)
*/
Compilation message
password.cpp: In function 'bool subsequence(std::string, std::string)':
password.cpp:52:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for(int i = 0; i < b.size();i++){
| ~~^~~~~~~~~~
password.cpp:55:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | if(ind == a.size())return 1;
| ~~~~^~~~~~~~~~~
password.cpp: In function 'std::string guess(int, int)':
password.cpp:70:24: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
70 | while(c.size() <= n){
| ~~~~~~~~~^~~~
password.cpp:72:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
72 | if(res == c.size())freq[i] = c.size();
| ~~~~^~~~~~~~~~~
password.cpp:98:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
98 | for(int i = 0; i < c.size();i++){
| ~~^~~~~~~~~~
password.cpp:101:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | if(query(one) != one.size()){
| ~~~~~~~~~~~^~~~~~~~~~~~~
password.cpp: In function 'void init()':
password.cpp:35:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
password.cpp:37:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
208 KB |
Guessed the password with 90 queries. |
| 2 |
Correct |
3 ms |
208 KB |
Guessed the password with 208 queries. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Guessed the password with 217 queries. |
| 2 |
Correct |
5 ms |
208 KB |
Guessed the password with 658 queries. |
| 3 |
Correct |
2 ms |
208 KB |
Guessed the password with 192 queries. |
| 4 |
Correct |
24 ms |
208 KB |
Guessed the password with 1747 queries. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
545 ms |
428 KB |
Could not guess the password with 50000 queries. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
208 KB |
Guessed the password with 90 queries. |
| 2 |
Correct |
3 ms |
208 KB |
Guessed the password with 208 queries. |
| 3 |
Correct |
1 ms |
208 KB |
Guessed the password with 217 queries. |
| 4 |
Correct |
5 ms |
208 KB |
Guessed the password with 658 queries. |
| 5 |
Correct |
2 ms |
208 KB |
Guessed the password with 192 queries. |
| 6 |
Correct |
24 ms |
208 KB |
Guessed the password with 1747 queries. |
| 7 |
Incorrect |
545 ms |
428 KB |
Could not guess the password with 50000 queries. |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
208 KB |
Guessed the password with 90 queries. |
| 2 |
Correct |
3 ms |
208 KB |
Guessed the password with 208 queries. |
| 3 |
Correct |
1 ms |
208 KB |
Guessed the password with 217 queries. |
| 4 |
Correct |
5 ms |
208 KB |
Guessed the password with 658 queries. |
| 5 |
Correct |
2 ms |
208 KB |
Guessed the password with 192 queries. |
| 6 |
Correct |
24 ms |
208 KB |
Guessed the password with 1747 queries. |
| 7 |
Incorrect |
545 ms |
428 KB |
Could not guess the password with 50000 queries. |
| 8 |
Halted |
0 ms |
0 KB |
- |
