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 "bits/stdc++.h"
#include "grader.h"
#include "cluedo.h"
void Solve(){
bool m[7],l[11],w[7];
memset(m,false,sizeof m);
memset(l,false,sizeof l);
memset(w,false,sizeof w);
for(int i=1;i<=6;i++){
if(m[i]) continue;
for(int j=1;j<=10;j++){
if(l[j]) continue;
for(int k=1;k<=6;k++){
if(w[k]) continue;
int n=Theory(i,j,k);
if(n==0) return;
else if(n==1) m[i]=true;
else if(n==2) l[j]=true;
else if(n==3) w[k]=true;
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |