#include "make.h"
#include <bits/stdc++.h>
using namespace std;
#define Fi first
#define Se second
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<(n);i++)
typedef tuple<int, int, int> t3;
std::string MakeWord(int N, int M, std::vector<std::string> Dict) {
string res; rep(i, M) res += "x";
return res;
}
#include <bits/stdc++.h>
#include "guess.h"
using namespace std;
#define Fi first
#define Se second
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<(n);i++)
typedef tuple<int, int, int> t3;
std::string GuessWord(int M, std::string YH){
string res; rep(i, M) res += "x";
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
1036 KB |
Output is correct |
2 |
Correct |
12 ms |
1116 KB |
Output is correct |
3 |
Correct |
10 ms |
1032 KB |
Output is correct |
4 |
Correct |
12 ms |
972 KB |
Output is correct |
5 |
Correct |
12 ms |
1096 KB |
Output is correct |
6 |
Correct |
12 ms |
1048 KB |
Output is correct |
7 |
Correct |
11 ms |
1012 KB |
Output is correct |
8 |
Correct |
11 ms |
1032 KB |
Output is correct |
9 |
Correct |
11 ms |
1048 KB |
Output is correct |
10 |
Correct |
12 ms |
1036 KB |
Output is correct |
11 |
Correct |
11 ms |
972 KB |
Output is correct |
12 |
Correct |
11 ms |
1188 KB |
Output is correct |
13 |
Correct |
12 ms |
976 KB |
Output is correct |
14 |
Correct |
11 ms |
972 KB |
Output is correct |