제출 #69311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69311		bnahmad15	앵무새 (IOI11_parrots)	C++17	52 / 100	10 ms	2696 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
//#include "grader.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int N, int M[]){

	for(int i = 0;i < N;i++){
		int tmp = i,tmp2 = i,tmp3 = i;
		tmp2 |= (1<<7);
		tmp3 |= (1<<7);
		tmp3 |= (1<<6);
		for(int j = 4;j<7;j++){
			if(M[i] & (1<<(j-4)))
				tmp |= (1<<j);
		}
		for(int j = 4;j<6;j++){
			if(M[i] & (1<<(j-1)))
				tmp2 |= (1<<j);
		}
		for(int j = 4;j<6;j++){
			if(M[i] & (1<<(j+1)))
				tmp3 |= (1<<j);
		}
		send(tmp);
		send(tmp2);
		send(tmp3);
		if(M[i] & (1<<7)){
			send(tmp);
			send(tmp2);
			send(tmp3);
		}
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"
//#include "grader.h"
#include <bits/stdc++.h>
using namespace std;

int ar[100],done[500];

void decode(int N, int L, int X[]){

	for(int i = 0;i < N;i++){
		ar[i] = 0;
		done[i] = 0;
	}
	for(int i = 0;i<L;i++){
		int p = 0;
		for(int j = 0;j<4;j++){
			if((1<<j) & X[i])
				p |= (1<<j);
		}
		done[p] += 1;
		int numb = 0;
		if(!(X[i] & (1<<7))){
			for(int j = 4;j<7;j++){
				if(X[i] & (1<<j))
					numb |= (1<<(j-4));
			}
		}else if(!(X[i] & (1<<6))){
			for(int j = 4;j<6;j++){
				if(X[i] & (1<<j))
					numb |= (1<<(j-1));
			}
		}else{
			for(int j = 4;j<6;j++){
				if(X[i] & (1<<j))
					numb |= (1<<(j+1));
			}
		}
		ar[p] |= numb;
	}
	for(int i = 0;i<N;i++){
		if(done[i] >= 4){
			ar[i] += 128;
		}
	}
	for(int i = 0;i<N;i++){
		output(ar[i]);
	}
}

• Subtask 1: 17 / 17
• Subtask 2: 17 / 17
• Subtask 3: 18 / 18
• Subtask 4: 0 / 29
• Subtask 5: 0 / 19