Submission #351521

#	Time	Username	Problem	Language	Result	Execution time	Memory
351521		amunduzbaev	Parrots (IOI11_parrots)	C++14	52 / 100	7 ms	1424 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"

#ifndef EVAL
#include "grader.cpp" 
#endif

#include <bits/stdc++.h>
using namespace std;


void encode(int N, int M[]){
	vector<int> ans(N*8);
	for(int i=0;i<N;i++){
		for(int j=0;j<8;j++){
			ans[i*8 + j] = (M[i]>>j & 1);
		}
	}
	
	for(int i=0;i<8*N;i++){
		if(i) ans[i] += ans[i-1];
	}
	//for(int i=0;i<8*N;i++){
		//cout<<ans[i]<<" ";
	//}cout<<"\n";
	for(int i=0;i<8*N;i++){
		send(ans[i]);
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"

#ifndef EVAL
#include "grader.cpp" 
#endif

#include <bits/stdc++.h>
using namespace std;

void decode(int n, int l, int ans[]){
	sort(ans, ans+l);
	
	for(int i=0;i<l;){
		int tmp = 0;
		for(int j=0;j<8; i++, j++){
			int xx = ans[i];
			if(i) xx -= ans[i-1];
			if(xx) tmp |= (1<<j);
		}
		//cout<<tmp<<" ";
		output(tmp);
	}
}

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