oj.uz

Submission #656550

# Submission time Handle Problem Language Result Execution time Memory
656550 2022-11-08T00:37:56 Z definitelynotmee Question (Grader is different from the original contest) (CEOI14_question_grader) C++
0 / 100
 7000 ms 208 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;

int encode (int n, int x, int y) {
    vector<int> v(n+1);
    int val = (1<<6)-1;
    for(int i = 1; i <= n; i++){
        int id = 0;
        while(__builtin_popcount(val) != 6){
            val|=1<<id;
            id++;
        }
        v[i] = val;
        val++;
    }
    for(int i = 0; i < 12; i++){
        if(bool(v[x]&(1<<i)) && !bool(v[y]&(1<<i)))
            return i+1;
    }

}
#include<bits/stdc++.h>
using namespace std;

int decode (int n, int q, int h) {
    h--;
    vector<int> v(n+1);
    int val = (1<<6)-1;
    for(int i = 1; i <= n; i++){
        int id = 0;
        while(__builtin_popcount(val) != 6){
            val|=1<<id;
            id++;
        }
        v[i] = val;
        val++;
    }


	return bool(v[q]&(1<<h));
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:23:22: warning: control reaches end of non-void function [-Wreturn-type]
   23 |     vector<int> v(n+1);
      |                      ^

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Execution timed out 7040 ms 208 KB Time limit exceeded
2 Execution timed out 7043 ms 208 KB Time limit exceeded