# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
662522 | esomer | 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<bits/stdc++.h>
#include "cluedo.h"
using namespace std;
#define ll long long
#define endl "\n"
const int MOD = 998244353;
void Solve(){
vector<vector<bool>> bad(3, vector<bool>(11, 0));
for(int i = 1; i <= 6; i++){
for(int j = 1; j <= 10; j++){
for(int z = 1; z <= 6; z++){
if(bad[0][i] == 1 || bad[1][j] == 1 || bad[2][z] == 1) continue;
int r = Theory(i, j, z);
if(r == 0) return;
else if(r == 1) bad[0][i] = 1;
else if(r == 2) bad[1][j] = 1;
else bad[2][z] = 1;
}
}
}
}