Submission #64806

#	Time	Username	Problem	Language	Result	Execution time	Memory
64806		TadijaSebez	Parrots (IOI11_parrots)	C++11	0 / 100	20 ms	8712 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <stdio.h>
const int sz=100;
const int H=575;
struct Number
{
	int a[sz];
	void init(){ for(int i=0;i<sz;i++) a[i]=0;}
	Number(){ init();}
	Number operator + (Number b) const
	{
		Number c;c.init();
		for(int i=0;i<sz;i++)
		{
			c.a[i]+=a[i]+b.a[i];
			if(c.a[i]>255) c.a[i]%=255,c.a[i+1]++;
		}
		return c;
	}
	bool operator < (Number b) const
	{
		int i;
		for(i=sz-1;~i;i--)
		{
			if(a[i]<b.a[i]) return 1;
			if(b.a[i]<a[i]) return 0;
		}
		return 0;
	}
} binom[sz][sz];
void encode(int n, int *m)
{
	int i,j;
	for(i=0;i<H;i++) for(j=0;j<H;j++) binom[i][j].init();
	for(i=1;i<H;i++)
	{
		binom[i][0].a[0]=1;
		for(j=1;j<=i;j++)
		{
			binom[i][j]=binom[i-1][j-1]+binom[i-1][j];
		}
	}
	Number my;my.init();
	for(i=0;i<n;i++) my.a[i]=m[i];
	Number sub;sub.init();
	int go=5*n+255;
	for(i=0;i<n*5;i++)
	{
		while(my<(binom[go][5*n-i]+sub)) go--;
		send(5*n+255-go-1-i);
		sub=sub+binom[go][5*n-i];
		go--;
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <stdio.h>
#include <algorithm>
using namespace std;
const int sz=100;
const int H=575;
struct Number
{
	int a[sz];
	void init(){ for(int i=0;i<sz;i++) a[i]=0;}
	Number(){ init();}
	Number operator + (Number b) const
	{
		Number c;c.init();
		for(int i=0;i<sz;i++)
		{
			c.a[i]+=a[i]+b.a[i];
			if(c.a[i]>255) c.a[i]%=255,c.a[i+1]++;
		}
		return c;
	}
	bool operator < (Number b) const
	{
		int i;
		for(i=sz-1;~i;i--)
		{
			if(a[i]<b.a[i]) return 1;
			if(b.a[i]<a[i]) return 0;
		}
		return 0;
	}
} binom[sz][sz];
void decode(int n, int l, int *m)
{
	int i,j;
	for(i=0;i<H;i++) for(j=0;j<H;j++) binom[i][j].init();
	for(i=1;i<H;i++)
	{
		binom[i][0].a[0]=1;
		for(j=1;j<=i;j++)
		{
			binom[i][j]=binom[i-1][j-1]+binom[i-1][j];
		}
	}
	Number my;my.init();
	sort(m,m+l);
	for(i=0;i<l;i++)
	{
		int x=m[i];
		int go=5*n+255-x-i-1;
		my=my+binom[go][5*n-i];
	}
	for(i=0;i<n;i++) output(my.a[i]);
}

Compilation message (stderr)

encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:38:19: warning: iteration 99 invokes undefined behavior [-Waggressive-loop-optimizations]
   binom[i][0].a[0]=1;
   ~~~~~~~~~~~~~~~~^~
encoder.cpp:36:11: note: within this loop
  for(i=1;i<H;i++)
          ~^~
encoder.cpp:9:41: warning: iteration 100 invokes undefined behavior [-Waggressive-loop-optimizations]
  void init(){ for(int i=0;i<sz;i++) a[i]=0;}
                                     ~~~~^~
encoder.cpp:35:11: note: within this loop
  for(i=0;i<H;i++) for(j=0;j<H;j++) binom[i][j].init();
          ~^~
encoder.cpp:9:41: warning: iteration 100 invokes undefined behavior [-Waggressive-loop-optimizations]
  void init(){ for(int i=0;i<sz;i++) a[i]=0;}
                                     ~~~~^~
encoder.cpp:35:28: note: within this loop
  for(i=0;i<H;i++) for(j=0;j<H;j++) binom[i][j].init();
                           ~^~

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:40:19: warning: iteration 99 invokes undefined behavior [-Waggressive-loop-optimizations]
   binom[i][0].a[0]=1;
   ~~~~~~~~~~~~~~~~^~
decoder.cpp:38:11: note: within this loop
  for(i=1;i<H;i++)
          ~^~
decoder.cpp:11:41: warning: iteration 100 invokes undefined behavior [-Waggressive-loop-optimizations]
  void init(){ for(int i=0;i<sz;i++) a[i]=0;}
                                     ~~~~^~
decoder.cpp:37:11: note: within this loop
  for(i=0;i<H;i++) for(j=0;j<H;j++) binom[i][j].init();
          ~^~
decoder.cpp:11:41: warning: iteration 100 invokes undefined behavior [-Waggressive-loop-optimizations]
  void init(){ for(int i=0;i<sz;i++) a[i]=0;}
                                     ~~~~^~
decoder.cpp:37:28: note: within this loop
  for(i=0;i<H;i++) for(j=0;j<H;j++) binom[i][j].init();
                           ~^~

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