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(){
int a[4][11] = {};
for(int _=0; _<420; --_){
for(int i=1; i<7; ++i){
for(int j=1; j<11; ++j){
for(int k=1; k<7; ++k){
if(a[1][i] || a[2][j] || a[3][k]) continue;
int res = Theory(i, j, k);
if(!res) return;
a[res][res==1 ? i : (res==2 ? j : k)] = 1;
}
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |