oj.uz

Submission #217756

# Submission time Handle Problem Language Result Execution time Memory
217756 2020-03-30T16:26:38 Z aloo123 Cluedo (IOI10_cluedo) C++14
100 / 100
 16 ms 384 KB 
#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.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 384 KB Output is correct
2 Correct 12 ms 384 KB Output is correct
3 Correct 13 ms 256 KB Output is correct
4 Correct 14 ms 256 KB Output is correct
5 Correct 14 ms 384 KB Output is correct
6 Correct 14 ms 256 KB Output is correct
7 Correct 15 ms 256 KB Output is correct
8 Correct 12 ms 256 KB Output is correct
9 Correct 15 ms 384 KB Output is correct
10 Correct 13 ms 256 KB Output is correct
11 Correct 14 ms 256 KB Output is correct
12 Correct 13 ms 256 KB Output is correct
13 Correct 11 ms 256 KB Output is correct
14 Correct 16 ms 384 KB Output is correct
15 Correct 14 ms 256 KB Output is correct
16 Correct 11 ms 384 KB Output is correct
17 Correct 14 ms 256 KB Output is correct
18 Correct 13 ms 384 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 384 KB Output is correct
2 Correct 10 ms 256 KB Output is correct
3 Correct 12 ms 256 KB Output is correct
4 Correct 12 ms 384 KB Output is correct
5 Correct 13 ms 256 KB Output is correct
6 Correct 10 ms 384 KB Output is correct
7 Correct 9 ms 256 KB Output is correct
8 Correct 11 ms 256 KB Output is correct
9 Correct 13 ms 256 KB Output is correct
10 Correct 15 ms 256 KB Output is correct
11 Correct 12 ms 256 KB Output is correct
12 Correct 15 ms 256 KB Output is correct
13 Correct 14 ms 384 KB Output is correct
14 Correct 14 ms 256 KB Output is correct
15 Correct 13 ms 384 KB Output is correct
16 Correct 14 ms 256 KB Output is correct
17 Correct 14 ms 384 KB Output is correct
18 Correct 9 ms 256 KB Output is correct