oj.uz

답안 #594679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594679 2022-07-12T19:53:12 Z Blagojce Flight to the Ford (BOI22_communication) C++17
0 / 100
 30 ms 236 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define st first
#define nd second
#define pb push_back
#define pq priority_queue
#define all(x) begin(x), end(x)
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;

#include "communication.h"
/*
bool aux[250];


vector<int> v;
int send(int x){
	cout<<x<<" SENDED"<<endl;
	int c;
	cin >> c;
	v.pb(c);
	return c;
}
int P = 0;
int receive(){
	cout<<"SEND ME"<<endl;
	int c;
	return v[P++];
}
*/
void encode(int N, int X) {
	srand(N);
	
	int pos = 0;
	while(pos < 2){
		int r_bit = X&(1<<pos);
		if(r_bit != 0) r_bit = 1;
		
		int nxt = 2;
		if(rand()%2) nxt = 3;
		
		int t = send(1);
		if(t == 1){
			bool ok = true;
			fr(i, 0, nxt){
				int c = send(r_bit);
				ok |= (c == r_bit);
			}
			if(ok) ++pos;
		}
		else{
			send(r_bit);
			fr(i, 0, nxt-1) send(0);
			++pos;
		}
	}
	
}


std::pair<int, int> decode(int N){
	srand(N);
	
	int pos = 0;
	
	int X = 0;
	
	while(pos < 2){
		
		int nxt = 2;
		if(rand()%2) nxt = 3;
		
		
		int t = receive();
		if(t == 1){
			int sum = 0;
			fr(i, 0, nxt){
				sum += receive();
			}
			if(sum == 0) ++pos;
			else if(sum == nxt){
				X |= (1<<pos);
				++pos;
			}
		}
		else{
			if(receive() == 1) X |= (1<<pos);
			++pos;
			fr(i, 0, nxt-1){
				send(0);
			}
			
		}
	}
	
	return {X, X};
	
}/*
int main(){
	encode(10, 3);
	decode(10);
}
*/

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 236 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 200 KB Not correct
2 Halted 0 ms 0 KB -