Submission #18355

#	Time	Username	Problem	Language	Result	Execution time	Memory
18355		suhgyuho_william	Parrots (IOI11_parrots)	C++98	17 / 100	6 ms	2600 KiB

encoder

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

void encode(int N, int M[]){
	int i,j,t;
	int tmp[100];

	for(i=0; i<N; i++) tmp[i] = M[i];
	for(i=0; i<N; i++){
		j = -1;
		while(M[i] != 0){
			t = M[i] % 2;
			M[i] /= 2;
			j++;
			if(t == 0) continue;
			send(8*i+j);
		}
	}
	for(i=0; i<N; i++) M[i] = tmp[i];
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
#include <stdio.h>
using namespace std;

int cnt;
long long d[1000][1000];
int ans[1000];

void Init(){
	int i,j,k;
	long long t,sum;

	for(i=0; i<=255; i++) d[1][i] = 256-i;
	for(i=2; i<=10; i++) for(j=0; j<=255; j++) for(k=j; k<=255; k++) d[i][j] += d[i-1][k];

	t = 1; int tt = 7;
	sum = 0;
	for(i=1; i<=tt; i++) t *= 256;
	for(i=0; i<=255; i++) sum += d[tt][i];
	printf("%lld %lld\n",t,sum);
	double ra;
	ra = (double)t / (double)sum;
	printf("%lf\n",ra);
}

void decode(int N, int L, int X[]){
	int i;
	int t1,t2;

	for(i=L; i>=1; i--) X[i] = X[i-1];
    cnt++;
    for(i=0; i<N; i++) ans[i] = 0;
    for(i=1; i<=L; i++){
		t1 = X[i] / 8;
		t2 = X[i] % 8;
		ans[t1] += (1 << t2);
    }
    for(i=0; i<N; i++){
		output(ans[i]);
    }
}

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