oj.uz

Submission #577936

# Submission time Handle Problem Language Result Execution time Memory
577936 2022-06-15T13:35:20 Z MohamedFaresNebili Cluedo (IOI10_cluedo) C++14
100 / 100
 14 ms 208 KB 
#include <bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
        using namespace std;
 
        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<int>;
 
        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) (x).begin(), (x).end()
        #define lb lower_bound
        /// #define int ll
 
        const int oo = 1e9 + 7;
 
        /// int Theory(int M, int L, int W);
        void Solve() {
            bool M[20], L[20], W[20]; int calc = 0;
            memset(M, 0, sizeof M);
            memset(L, 0, sizeof L);
            memset(W, 0, sizeof W);
            for(int l = 1; l <= 6; l++) {
                for(int i = 1; i <= 10; i++) {
                    for(int j = 1; j <= 6; j++) {
                        if(M[l] || L[i] || W[j]) continue;
                        int r = Theory(l, i, j);
                        if(r == 0)
                            return;
                        if(r == 1) M[l] = 1;
                        if(r == 2) L[i] = 1;
                        if(r == 3) W[j] = 1;
                        calc++;
                    }
                }
            }
        }

Subtask #1
50.0 / 50.0

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

Subtask #2
50.0 / 50.0

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