Submission #124370

#	Time	Username	Problem	Language	Result	Execution time	Memory
124370		nxteru	Parrots (IOI11_parrots)	C++14	17 / 100	9 ms	1872 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
void encode(int n, int m[]){
	ull dp[40][32],rs=0;
	for(int i=0;i<32;i++)dp[0][i]=1;
	for(int i=0;i<40;i++){
		for(int j=0;j<32;j++){
			if(i)dp[i][j]=dp[i-1][j];
			if(j)dp[i][j]+=dp[i][j-1];
		}
	}
	for(int i=0;i<n;i+=8){
		ull s=0,p=0;
		for(int j=i;j<n&&j<i+8;j++,p++){
			s*=256ULL;
			s+=ull(m[j]);
		}
		p*=5;
		s++;
		for(int j=p-1;j>=0;j--){
			for(int k=0;k<min(256-rs,32ULL);k++){
				if(dp[j][k]>=s){
					send(rs+k);
					if(k>0)s-=dp[j][k-1];
					break;
				}
			}
		}
		rs+=32;
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ull;
void decode(int n, int l, int x[]){
	ull dp[40][32],rs=0,xs=0;
	sort(x,x+l);
	for(int i=0;i<32;i++)dp[0][i]=1;
	for(int i=0;i<40;i++){
		for(int j=0;j<32;j++){
			if(i)dp[i][j]=dp[i-1][j];
			if(j)dp[i][j]+=dp[i][j-1];;
		}
	}
	for(int i=0;i<n;i+=8){
		ull s=0,p=0;
		for(int j=i;j<n&&j<i+8;j++,p++);
		p*=5;
		for(int j=p-1;j>=0;j--)if(x[xs+j]-rs>0)s+=dp[j][x[xs+j]-rs-1];
		xs+=p;
		rs+=32;
		p/=5;
		for(int i=p-1;i>=0;i--)output((s>>(i*8))&255ULL);
	}
}

Compilation message (stderr)

encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:24:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int k=0;k<min(256-rs,32ULL);k++){
                ~^~~~~~~~~~~~~~~~~~

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