#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> x[4];
inline void init() {
for (int i = 1; i <= 3; ++i) {
x[i].clear();
for (int j = 1; j <= 10; ++j) {
if (j > 6 && i != 2) break;
x[i].push_back(j);
}
}
}
void Solve(){
srand(time(NULL));
init();
int g[4];
g[1] = 1 + (rand() % 6), g[2] = 1 + (rand() % 10), g[3] = 1 + (rand() % 6);
while (true) {
int y = Theory(g[1], g[2], g[3]);
if (y == 0) break;
x[y].erase(find(x[y].begin(), x[y].end(), g[y]));
g[y] = x[y][rand() % (x[y].size())];
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
256 KB |
Output is correct |
2 |
Correct |
12 ms |
256 KB |
Output is correct |
3 |
Correct |
11 ms |
256 KB |
Output is correct |
4 |
Correct |
9 ms |
256 KB |
Output is correct |
5 |
Correct |
9 ms |
256 KB |
Output is correct |
6 |
Correct |
8 ms |
256 KB |
Output is correct |
7 |
Correct |
10 ms |
256 KB |
Output is correct |
8 |
Correct |
10 ms |
256 KB |
Output is correct |
9 |
Correct |
10 ms |
256 KB |
Output is correct |
10 |
Correct |
6 ms |
256 KB |
Output is correct |
11 |
Correct |
6 ms |
256 KB |
Output is correct |
12 |
Correct |
11 ms |
256 KB |
Output is correct |
13 |
Correct |
13 ms |
256 KB |
Output is correct |
14 |
Correct |
10 ms |
256 KB |
Output is correct |
15 |
Correct |
11 ms |
256 KB |
Output is correct |
16 |
Correct |
10 ms |
256 KB |
Output is correct |
17 |
Correct |
8 ms |
256 KB |
Output is correct |
18 |
Correct |
9 ms |
256 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
256 KB |
Output is correct |
2 |
Correct |
11 ms |
256 KB |
Output is correct |
3 |
Correct |
12 ms |
384 KB |
Output is correct |
4 |
Correct |
9 ms |
256 KB |
Output is correct |
5 |
Correct |
9 ms |
256 KB |
Output is correct |
6 |
Correct |
10 ms |
256 KB |
Output is correct |
7 |
Correct |
9 ms |
256 KB |
Output is correct |
8 |
Correct |
10 ms |
256 KB |
Output is correct |
9 |
Correct |
6 ms |
256 KB |
Output is correct |
10 |
Correct |
10 ms |
256 KB |
Output is correct |
11 |
Correct |
10 ms |
256 KB |
Output is correct |
12 |
Correct |
10 ms |
256 KB |
Output is correct |
13 |
Correct |
10 ms |
256 KB |
Output is correct |
14 |
Correct |
10 ms |
256 KB |
Output is correct |
15 |
Correct |
10 ms |
256 KB |
Output is correct |
16 |
Correct |
9 ms |
256 KB |
Output is correct |
17 |
Correct |
11 ms |
256 KB |
Output is correct |
18 |
Correct |
11 ms |
256 KB |
Output is correct |