제출 #1334367

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1334367		QuocSensei	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++20	0 / 100	0 ms	344 KiB

encoder

#include <bits/stdc++.h>

#define ll long long 
#define el cout << endl
#define bit(mask, i) (((mask) >> (i)) & 1)
#define BIT(n) (1ll << (n))

using namespace std;

namespace SUBTASK_12
{
    const int maxlog = 9;

    namespace personA
    {
        int encode(int N, int x, int y)
        {
            for (int i = 0; i < maxlog; i++)
                if (bit(x, i) ^ bit(y, i))
                    return i * 2 + bit(x, i);
            return -1;
        }
    }
    
    namespace personB
    {
        int decode(int N, int q, int h)
        {
            return bit(q, h / 2) == h % 2;
        }
    }
}

int encode(int N, int x, int y)
{
    return SUBTASK_12::personA::encode(N, x, y);
}
int decode(int N, int q, int h)
{
    return SUBTASK_12::personB::decode(N, q, h);
}

decoder

#include <bits/stdc++.h>

#define ll long long 
#define el cout << endl
#define bit(mask, i) (((mask) >> (i)) & 1)
#define BIT(n) (1ll << (n))

using namespace std;

namespace SUBTASK_12
{
    const int maxlog = 9;

    namespace personA
    {
        int encode(int N, int x, int y)
        {
            for (int i = 0; i < maxlog; i++)
                if (bit(x, i) ^ bit(y, i))
                    return i * 2 + bit(x, i);
            return -1;
        }
    }
    
    namespace personB
    {
        int decode(int N, int q, int h)
        {
            return bit(q, h / 2) == h % 2;
        }
    }
}

int encode(int N, int x, int y)
{
    return SUBTASK_12::personA::encode(N, x, y);
}
int decode(int N, int q, int h)
{
    return SUBTASK_12::personB::decode(N, q, h);
}

• Subtask 1: 0 / 100