제출 #217756

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
217756		aloo123	Cluedo (IOI10_cluedo)	C++14	100 / 100	16 ms	384 KiB

cluedo

#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
using namespace std;
 
const ll N =(2e5+5);
const ll MOD = 998244353;
const ll INF = 1e16;
const ll LOG = 25;


void Solve(){

    bool a[7],b[11],c[7];
    for(int i =1;i<=6;i++)a[i]=false;
    for(int i =1;i<=10;i++)b[i]=false;
    for(int i =1;i<=6;i++)c[i]=false;

    for(ll m = 1;m<=6;m++){
        for(ll l = 1;l<=10;l++){
            for(ll w = 1;w<=6;w++){
                if(a[m] || b[l] || c[w]) continue;
                ll x = Theory(m,l,w);
                if(x == 0) return ;
                if(x == 1) a[m] = true;
                if(x == 2) b[l] = true;
                if(x == 3) c[w] = true;
            }
        }
    }
    // for(ll m = 1;m<=6;m++){
    //     for(ll l = 1;l<=10;l++){
    //         for(ll w = 1;w<=6;w++){
    //             if(a[m] || b[l] || c[w]) continue;
    //             ll x = Theory(m,l,w);
    //             if(x == 0) return ;
    //         }
    //     }
    // }

    


}

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