oj.uz

Submission #229269

# Submission time Handle Problem Language Result Execution time Memory
229269 2020-05-04T02:38:02 Z super_j6 Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
100 / 100
 3896 ms 48208 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int maxn = 920;
int a[maxn];

int encode(int n, int x, int y){
    x--, y--;
    if(!a[0]) for(int i = 0, j = 0; i < n; i++, j++){
        while(__builtin_popcount(j) != 6) j++;
        a[i] = j;
    }
    return __lg(a[x] & (a[x] ^ a[y])) + 1;
}
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int maxn = 920;
int a[maxn];

int decode(int n, int x, int y){
    x--, y--;
    if(!a[0]) for(int i = 0, j = 0; i < n; i++, j++){
        while(__builtin_popcount(j) != 6) j++;
        a[i] = j;
    }
    return (a[x] >> y) & 1;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3849 ms 48208 KB Output is correct - maxh = 12
2 Correct 3896 ms 48112 KB Output is correct - maxh = 12