#include <bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
using namespace std;
void Solve(){
bool a[7], b[11], c[7];
for(int i= 1;i<=6;i++) a[i] =1;
for(int i= 1;i<=10;i++) b[i] =1;
for(int i= 1;i<=6;i++) c[i] =1;
for(int i= 1;i<=20;i++){
int m = 0, l = 0, w = 0;
for(int j = 1;j<=6;j++){
if(a[j] == 1) {
m = j;
break;
}
}
for(int j = 1;j<=10;j++){
if(b[j] == 1) {
l = j;
break;
}
}
for(int j = 1;j<=6;j++){
if(c[j] == 1) {
w = j;
break;
}
}
int res = Theory(m, l, w);
if(res == 0){
return;
}
if(res == 1){
a[m] = 0;
} else if(res == 2) {
b[l] = 0;
} else {
c[w] = 0;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 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 |
10 ms |
364 KB |
Output is correct |
5 |
Correct |
10 ms |
364 KB |
Output is correct |
6 |
Correct |
6 ms |
492 KB |
Output is correct |
7 |
Correct |
10 ms |
364 KB |
Output is correct |
8 |
Correct |
6 ms |
364 KB |
Output is correct |
9 |
Correct |
11 ms |
364 KB |
Output is correct |
10 |
Correct |
6 ms |
364 KB |
Output is correct |
11 |
Correct |
9 ms |
364 KB |
Output is correct |
12 |
Correct |
12 ms |
364 KB |
Output is correct |
13 |
Correct |
9 ms |
364 KB |
Output is correct |
14 |
Correct |
9 ms |
364 KB |
Output is correct |
15 |
Correct |
12 ms |
364 KB |
Output is correct |
16 |
Correct |
10 ms |
364 KB |
Output is correct |
17 |
Correct |
12 ms |
364 KB |
Output is correct |
18 |
Correct |
12 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
364 KB |
Output is correct |
2 |
Correct |
11 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 |
14 ms |
364 KB |
Output is correct |
6 |
Correct |
14 ms |
364 KB |
Output is correct |
7 |
Correct |
10 ms |
364 KB |
Output is correct |
8 |
Correct |
8 ms |
364 KB |
Output is correct |
9 |
Correct |
6 ms |
364 KB |
Output is correct |
10 |
Correct |
7 ms |
364 KB |
Output is correct |
11 |
Correct |
6 ms |
364 KB |
Output is correct |
12 |
Correct |
10 ms |
364 KB |
Output is correct |
13 |
Correct |
9 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 |
11 ms |
364 KB |
Output is correct |
18 |
Correct |
10 ms |
364 KB |
Output is correct |