# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
940305 | HappyCapybara | Cluedo (IOI10_cluedo) | C++17 | 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<vector>
using namespace std;
void Solve(){
vector<bool> m(6, true), l(10, true), w(6, true)
while (true){
int M=0, L=0, W=0;
while (!m[M]) m++;
while (!l[L]) l++;
while (!w[W]) w++;
int x = theory(M+1, L+1, W+1);
if (x == 0) return;
if (x == 1) m[M] = false;
if (x == 2) l[L] = false;
if (x == 3) w[W] = false;
}
}