| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 383830 |
2021-03-30T20:54:37 Z |
MODDI |
Cluedo (IOI10_cluedo) |
C++14 |
|
58 ms |
364 KB |
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
void Solve(){
bool killer[6], locations[10], weapon[6];
memset(killer, true,sizeof(killer));
memset(locations, true, sizeof(locations));
memset(weapon, true, sizeof(weapon));
for(int i = 1; i <= 6; i++){
if(!killer[i-1])
continue;
for(int j = 1; j <= 10; j++){
if(!locations[j-1]) continue;
for(int k = 1; k <= 6; k++){
if(!weapon[k-1]) continue;
int call = Theory(i, j, k);
if(call == 0)
return ;
if(call == 1)
killer[i-1] = false;
if(call == 2)
locations[j-1] = false;
if(call == 3)
weapon[k-1] = false;
}
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
364 KB |
Output is correct |
| 2 |
Correct |
27 ms |
364 KB |
Output is correct |
| 3 |
Correct |
42 ms |
364 KB |
Output is correct |
| 4 |
Correct |
40 ms |
364 KB |
Output is correct |
| 5 |
Correct |
25 ms |
364 KB |
Output is correct |
| 6 |
Correct |
40 ms |
364 KB |
Output is correct |
| 7 |
Correct |
56 ms |
364 KB |
Output is correct |
| 8 |
Correct |
39 ms |
364 KB |
Output is correct |
| 9 |
Correct |
34 ms |
364 KB |
Output is correct |
| 10 |
Correct |
39 ms |
364 KB |
Output is correct |
| 11 |
Correct |
43 ms |
364 KB |
Output is correct |
| 12 |
Correct |
25 ms |
364 KB |
Output is correct |
| 13 |
Correct |
55 ms |
364 KB |
Output is correct |
| 14 |
Correct |
39 ms |
364 KB |
Output is correct |
| 15 |
Correct |
50 ms |
364 KB |
Output is correct |
| 16 |
Correct |
32 ms |
364 KB |
Output is correct |
| 17 |
Correct |
58 ms |
364 KB |
Output is correct |
| 18 |
Correct |
45 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
22 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
