oj.uz

답안 #595462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595462 2022-07-13T18:43:55 Z Blagojce Flight to the Ford (BOI22_communication) C++17
0 / 100
 893 ms 1832 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"
 
vector<int> V = {1,1,0,0,1,0,0,0,0,0,1,1,1,1,1,1,1,0,1,0,1,0,0,1,0,0,1,0,0,1,1,0,1,0,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,0,1,0,0,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0,0,0,0,0,0,1,0,0,1,0,1,1,0,0,0,1,1};


//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 < 30){
		int bit = 0;
		if(X & (1<<pos)) bit = 1;
		
		int c = rand() + pos;
		int nxt = V[c%100];
		
		
		if(c % 4){
			int r = send(nxt);
		
			if(r != nxt){
				send(bit);
				++pos;
			}
		}
		else{
			int r1 = send(bit);
			int r2 = send(bit);
			int r3 = send(bit);
			int r4 = send(bit);
		
			if(r1 == r2 || r2 == r3 || r3 == r4){
				++pos;
			}
		}
	}
}
 
 
std::pair<int, int> decode(int N){
	srand(N);
	int pos = 0;
	
	int X = 0;
	
	while(pos < 30){
		int c = rand() + pos;
		int nxt = V[c%100];
		
		
		if(c % 4){
			int r = receive();
		
			if(r != nxt){
				int bit = receive();
				if(bit == 1) X |= (1<<pos);
				++pos;
			}
		}
		else{
			int r1 = receive();
			int r2 = receive();
			int r3 = receive();
			int r4 = receive();
		
			if(r1 == r2){
				if(r1 == 1) X |= (1<<pos);
				++pos;
			}
			else if(r2 == r3){
				if(r2 == 1) X |= (1<<pos);
				++pos;
			}
			else if(r3 == r4){
				if(r3 == 1) X |= (1<<pos);
				++pos;
			}
		}
	}
	
	return {X, 1};
		
}/*
int main(){
	encode(10, 1);
	decode(10);
}
*/

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 1784 KB Output is correct
2 Correct 127 ms 1832 KB Output is correct
3 Correct 212 ms 1672 KB Output is correct
4 Correct 155 ms 1684 KB Output is correct
5 Correct 167 ms 1692 KB Output is correct
6 Incorrect 5 ms 220 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #2
0.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 782 ms 1772 KB Output is partially correct
2 Partially correct 493 ms 1668 KB Output is partially correct
3 Partially correct 393 ms 1736 KB Output is partially correct
4 Partially correct 709 ms 1700 KB Output is partially correct
5 Partially correct 855 ms 1664 KB Output is partially correct
6 Partially correct 893 ms 1744 KB Output is partially correct
7 Incorrect 4 ms 328 KB Not correct
8 Halted 0 ms 0 KB -