Submission #284777

#TimeUsernameProblemLanguageResultExecution timeMemory
284777TMJNParrots (IOI11_parrots)C++17
0 / 100
2 ms1016 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll c[26][26];

ll comb(int n,int r){
	if(n<r)return 0;
	return c[n-r][r];
}

vector<int>F(ll t){
	vector<int>v(16,0);
	int s=20;
	for(int i=0;i<16;i++){
		ll k=0;
		for(int j=0;j<=s-1;j++){
			k+=comb(14-i+j,j);
		}
		if(t>k){
			t-=k+1;
			v[i]++;
			s--;
			i--;
		}
	}
	return v;
}

void encode(int N, int M[]){
	c[0][0]=1;
	for(int i=0;i<=25;i++){
		for(int j=0;j<=25;j++){
			if(i)c[i][j]+=c[i-1][j];
			if(j)c[i][j]+=c[i][j-1];
		}
	}
	for(int i=0;i*4<N;i++){
		ll t=0;
		for(int j=i*4;j<i*4+4;j++){
			t*=256;
			t+=M[j];
		}
		vector<int>v=F(t);
		for(int j=0;j<20;j++){
			for(int k=0;k<v[j];k++){
				send(i*16+j);
			}
		}
	}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int C[256],res[64];


ll c[26][26];

ll comb(int n,int r){
	if(n<r)return 0;
	return c[n-r][r];
}


ll f(vector<int>v){
	ll t=0;
	int s=20;
	for(int i=0;i<16;i++){
		if(v[i]){
			v[i]--;
			t++;
			for(int j=0;j<=s-1;j++){
				t+=comb(14-i+j,j);
			}
			s--;
			i--;
		}
	}
	return t;
}

void decode(int N, int L, int X[]){
	c[0][0]=1;
	for(int i=0;i<=25;i++){
		for(int j=0;j<=25;j++){
			if(i)c[i][j]+=c[i-1][j];
			if(j)c[i][j]+=c[i][j-1];
		}
	}
	for(int i=0;i<L;i++){
		C[X[i]]++;
	}
	for(int i=0;i<16;i++){
		vector<int>v(16,0);
		for(int j=0;j<16;j++){
			v[j]=C[i*16+j];
		}
		ll t=f(v);
		for(int j=3;j>=0;j--){
			res[i*4+j]=t%256;
			t/=256;
		}
	}
	for(int i=0;i<N;i++){
		output(res[i]);
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...