#include "make.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
std::string MakeWord(int N, int M, std::vector<std::string> Dict)
{
string s;
for(int i=0;i<M;i++) s+='a';
return s;
//return Dict[0];
}
#include "guess.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
std::string GuessWord(int M, std::string YH){
string s;
for(int i=0;i<M;i++) s+='a';
return s;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
1044 KB |
Output is correct |
2 |
Correct |
12 ms |
1196 KB |
Output is correct |
3 |
Correct |
12 ms |
972 KB |
Output is correct |
4 |
Correct |
11 ms |
1220 KB |
Output is correct |
5 |
Correct |
10 ms |
1056 KB |
Output is correct |
6 |
Correct |
11 ms |
1040 KB |
Output is correct |
7 |
Correct |
12 ms |
1196 KB |
Output is correct |
8 |
Correct |
11 ms |
1036 KB |
Output is correct |
9 |
Correct |
12 ms |
1040 KB |
Output is correct |
10 |
Correct |
12 ms |
1040 KB |
Output is correct |
11 |
Correct |
12 ms |
1188 KB |
Output is correct |
12 |
Correct |
12 ms |
1152 KB |
Output is correct |
13 |
Correct |
13 ms |
1048 KB |
Output is correct |
14 |
Correct |
11 ms |
1012 KB |
Output is correct |