oj.uz

Submission #993661

# Submission time Handle Problem Language Result Execution time Memory
993661 2024-06-06T09:39:49 Z MarwenElarbi Flight to the Ford (BOI22_communication) C++17
0 / 100
 161 ms 332 KB 
#include"communication.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
void encode(int N, int X){
    int tab[30];
    for (int i = 0; i < 30; ++i)
    {
        if((1<<i)&X) tab[i]=1;
        else tab[i]=0;
    }
    for (int i = 0; i < 30; ++i)
    {
        send(tab[i]);
        send(tab[i]);
    }
    return;
}
std::pair<int, int> decode(int N){
    int tab[30];
    for (int i = 0; i < 30; ++i)
    {
        int a=receive();
        int b=receive();
        tab[i]=(a|b);
    }
    int ans=0;
    for (int i = 0; i < 30; ++i)
    {
        ans+=((tab[i]&1)<<i);
    }
    return {ans,ans};
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 332 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 85.0

# Verdict Execution time Memory Grader output
1 Incorrect 161 ms 332 KB Not correct
2 Halted 0 ms 0 KB -