# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1099337 | Zflop | Cluedo (IOI10_cluedo) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
void Solve(){
vector<bool>K(11,1),J(10,1);
for (int i = 1; i <= 6;++i) {
bool ok1 = true;
for (int j = 1; j <= 6;++j) {
bool ok3 = J[j];
for (int k = 1; k <= 10 && ok1 && ok3;++k) {
if(K[k] == false) continue;
int r = Theory(i,k,j);
if(r == 1) ok1 = false;
if(r == 3) ok3 = J[j] = false;
if(r == 2) {
K[k] = false;
continue;
}
if(r == 0)
return;
}
}
}
}