oj.uz

Submission #463435

# Submission time Handle Problem Language Result Execution time Memory
463435 2021-08-11T06:50:32 Z lukadupli Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 7000 ms 4236 KB 
#include <bits/stdc++.h>

using namespace std;

int strat[1000];

int encode(int n, int x, int y){
    int pos = 1;

    for(int mask = 0; mask < (1 << 12); mask++){
        if(__builtin_popcount(mask) == 6){
            strat[pos] = mask;
            pos++;
        }
    }

    for(int h = 0; h <= 11; h++){
        bool xb = strat[x] & (1 << h);
        bool yb = strat[y] & (1 << h);
        if(xb && !yb) return h + 1;
    }
}

#include <bits/stdc++.h>

using namespace std;

int strat[1000];

int decode(int n, int q, int h){
    int pos = 1;

    for(int mask = 0; mask < (1 << 12); mask++){
        if(__builtin_popcount(mask) == 6){
            strat[pos] = mask;
            pos++;
        }
    }

    h--;
    if(strat[q] & (1 << h)) return 1;
    return 0;
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
   22 | }
      | ^

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Execution timed out 7008 ms 4212 KB Time limit exceeded
2 Execution timed out 7044 ms 4236 KB Time limit exceeded