#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(){
int MX1 = 6, MX2 = 10, MX3 = 6;
vector<bool> ok1(MX1, true), ok2(MX2, true), ok3(MX3, true);
for (int i = 1; i <= MX1; i++) if (ok1[i]) {
for (int j = 1; j <= MX2; j++) if (ok1[i] && ok2[j]) {
for (int k = 1; k <= MX3; k++) if (ok1[i] && ok2[j] && ok3[k]) {
int o = Theory(i, j, k);
if (o == 1) ok1[i] = false;
if (o == 2) ok2[j] = false;
if (o == 3) ok3[k] = false;
if (o == 0) return;
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
364 KB |
Output is correct |
2 |
Correct |
10 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
12 ms |
364 KB |
Output is correct |
5 |
Correct |
11 ms |
364 KB |
Output is correct |
6 |
Correct |
10 ms |
364 KB |
Output is correct |
7 |
Correct |
10 ms |
364 KB |
Output is correct |
8 |
Correct |
6 ms |
364 KB |
Output is correct |
9 |
Correct |
9 ms |
364 KB |
Output is correct |
10 |
Correct |
9 ms |
364 KB |
Output is correct |
11 |
Correct |
9 ms |
364 KB |
Output is correct |
12 |
Correct |
9 ms |
364 KB |
Output is correct |
13 |
Correct |
10 ms |
364 KB |
Output is correct |
14 |
Correct |
10 ms |
364 KB |
Output is correct |
15 |
Correct |
12 ms |
364 KB |
Output is correct |
16 |
Correct |
11 ms |
364 KB |
Output is correct |
17 |
Correct |
12 ms |
364 KB |
Output is correct |
18 |
Correct |
13 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
364 KB |
Output is correct |
2 |
Correct |
11 ms |
364 KB |
Output is correct |
3 |
Correct |
10 ms |
364 KB |
Output is correct |
4 |
Correct |
9 ms |
364 KB |
Output is correct |
5 |
Correct |
10 ms |
364 KB |
Output is correct |
6 |
Correct |
10 ms |
364 KB |
Output is correct |
7 |
Correct |
10 ms |
364 KB |
Output is correct |
8 |
Correct |
15 ms |
364 KB |
Output is correct |
9 |
Correct |
11 ms |
364 KB |
Output is correct |
10 |
Correct |
11 ms |
364 KB |
Output is correct |
11 |
Correct |
10 ms |
364 KB |
Output is correct |
12 |
Correct |
8 ms |
364 KB |
Output is correct |
13 |
Correct |
8 ms |
364 KB |
Output is correct |
14 |
Correct |
9 ms |
364 KB |
Output is correct |
15 |
Correct |
9 ms |
364 KB |
Output is correct |
16 |
Correct |
11 ms |
364 KB |
Output is correct |
17 |
Correct |
10 ms |
364 KB |
Output is correct |
18 |
Correct |
9 ms |
364 KB |
Output is correct |