제출 #722961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722961		Erkinoff_Mohammed	Flight to the Ford (BOI22_communication)	C++17	0 / 100	346 ms	540 KiB

communication

#include "bits/stdc++.h"
#include "communication.h"
using namespace std;
#define INF 2000000000
#define INFLL 3000000000000000000LL
#define ll long long

map<pair<int,pair<long long,long long>>,int>ans1;
map<pair<int,pair<long long,long long>>,int>ans2;

void encode(int n,int x){
    long long num1=0;
    long long num2=0;
    for(int i=0;i<50;i++){
        num1<<=1;
        num1+=send(1);
    }
    for(int i=0;i<50;i++){
        num2<<=1;
        num2+=send(1);
    }
    if(ans1[{n,{num1,num2}}])ans2[{n,{num1,num2}}]=x;
    else ans1[{n,{num1,num2}}]=x;
}

pair<int,int>decode(int n){
    long long num1=0;
    long long num2=0;
    for(int i=0;i<50;i++){
        num1<<=1;
        num1+=receive();
    }
    for(int i=0;i<50;i++){
        num2<<=1;
        num2+=receive();
    }
    return{ans2[{n,{num1,num2}}],ans1[{n,{num1,num2}}] };
    return {ans2[{n,{num1,num2}}],ans1[{n,{num1,num2}}] };
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 85