Submission #662523

#	Time	Username	Problem	Language	Result	Execution time	Memory
662523		esomer	Cluedo (IOI10_cluedo)	C++17	100 / 100	14 ms	292 KiB

cluedo

#include<bits/stdc++.h>
#include "cluedo.h"
#include "grader.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;
            }
        }
    }
}

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50