#include "grader.h"
#include "cluedo.h"
void Solve()
{
int r, i, j, k, a[11], b[11], c[11];
for(i = 1; i <= 10; i++)
a[i] = 0, b[i] = 0, c[i] = 0;
for(i = 1; i < 7; i++)
{
if(a[i]) continue;
for(j = 1; j < 11; j++)
{
if(b[j]) continue;
for(k = 1; k < 7; k++)
{
if(c[k]) continue;
r = Theory(i, j, k);
if(r == 1) a[i]++;
if(r == 2) b[j]++;
if(r == 3) c[k]++;
if (!r) return;
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
320 KB |
Output is correct |
2 |
Correct |
16 ms |
208 KB |
Output is correct |
3 |
Correct |
34 ms |
208 KB |
Output is correct |
4 |
Correct |
34 ms |
208 KB |
Output is correct |
5 |
Correct |
40 ms |
208 KB |
Output is correct |
6 |
Correct |
32 ms |
208 KB |
Output is correct |
7 |
Correct |
41 ms |
208 KB |
Output is correct |
8 |
Correct |
32 ms |
208 KB |
Output is correct |
9 |
Correct |
45 ms |
208 KB |
Output is correct |
10 |
Correct |
41 ms |
208 KB |
Output is correct |
11 |
Correct |
45 ms |
208 KB |
Output is correct |
12 |
Correct |
24 ms |
208 KB |
Output is correct |
13 |
Correct |
41 ms |
208 KB |
Output is correct |
14 |
Correct |
33 ms |
208 KB |
Output is correct |
15 |
Correct |
46 ms |
208 KB |
Output is correct |
16 |
Correct |
44 ms |
208 KB |
Output is correct |
17 |
Correct |
40 ms |
208 KB |
Output is correct |
18 |
Correct |
38 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
38 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |