#include "make.h"
std::string MakeWord(int N, int M, std::vector<std::string> Dict) {
int x = 0, y = 0;
for (int i = 0; i < N; i++) {
bool b[102] = {};
for (int j = 0; j < M; j++) {
for (int k = 0; k < N; k++) {
if (Dict[k][j] != Dict[i][j] + 1) b[k] = 1;
}
}
int c = 0;
for (int j = 0; j < N; j++) c += b[j];
if (c > x) x = c, y = i;
}
for (int i = 0; i < M; i++) Dict[y][i]++;
return Dict[y];
}
#include "guess.h"
std::string GuessWord(int M, std::string YH){
for (int i = 0; i < M; i++) YH[i]++;
return YH;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
10 ms |
544 KB |
Output isn't correct |
2 |
Incorrect |
11 ms |
1052 KB |
Output isn't correct |
3 |
Incorrect |
11 ms |
1052 KB |
Output isn't correct |
4 |
Incorrect |
11 ms |
1052 KB |
Output isn't correct |
5 |
Correct |
11 ms |
1056 KB |
Output is correct |
6 |
Correct |
10 ms |
540 KB |
Output is correct |
7 |
Incorrect |
10 ms |
536 KB |
Output isn't correct |
8 |
Incorrect |
11 ms |
1056 KB |
Output isn't correct |
9 |
Incorrect |
11 ms |
1308 KB |
Output isn't correct |
10 |
Incorrect |
10 ms |
1052 KB |
Output isn't correct |
11 |
Incorrect |
10 ms |
1056 KB |
Output isn't correct |
12 |
Incorrect |
11 ms |
1048 KB |
Output isn't correct |
13 |
Incorrect |
10 ms |
548 KB |
Output isn't correct |
14 |
Incorrect |
11 ms |
1048 KB |
Output isn't correct |