Submission #346508

#	Time	Username	Problem	Language	Result	Execution time	Memory
346508		daniel920712	Parrots (IOI11_parrots)	C++14	21 / 100	32 ms	1936 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <vector>
#include <algorithm>
using namespace std; 

void encode(int N, int M[])
{
	vector < pair < int , int > > all2;
    int i,t=0,j,k;
    for(i=0; i<N; i++)
    {
    	send(M[i]);
    	send(M[i]);
    	send(M[i]);
    	send(M[i]);
    	
		send(M[i]);
    	send(M[i]);
    	send(M[i]);
    	send(M[i]);
    	all2.push_back(make_pair(M[i],i));
	}
	sort(all2.begin(),all2.end());
	for(i=0;i<N;i++) 
	{
		t=i;
		for(j=0;j<3;j++)
		{
			for(k=0;k<(1<<(j));k++) 
			{
				if(t%4)
				{
					//printf("%d %d\n",t%4*64+i,i);
					send(t%4*64+all2[i].second);
				}
			} 
			
			t/=4;
		}
		
	}
    
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <map>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

void decode(int N, int L, int X[])
{
    vector < int > all;
    map < int , int > con;
    int ans[305];
    int where[305];
    int i,j, b;
    for(i=0; i<L; i++)
    {
    	//printf("%d ",X[i]);
        con[X[i]]++;
    }

    for(auto i:con)
    {
        for(j=0;j<i.second/8;j++)
		{
			//printf("%d\n",i.first);
			all.push_back(i.first);
		}
    }
    sort(all.begin(),all.end());
    
    for(i=0;i<N;i++) 
	{
		where[i]=0;
	}

    for(auto i:con)
    {
        for(j=0;j<3;j++)
        {
        	if(i.second&(1<<j))
        	{
        		where[i.first%64]+=(i.first/64)*(1<<(2*j));
			}
		}
    }
    for(i=0; i<N; i++) 
	{
		//printf("%d %d\n",where[i],all[where[i]]);
		output(all[where[i]]);
		
	}
}

Compilation message (stderr)

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:13:9: warning: unused variable 'ans' [-Wunused-variable]
   13 |     int ans[305];
      |         ^~~
decoder.cpp:15:14: warning: unused variable 'b' [-Wunused-variable]
   15 |     int i,j, b;
      |              ^

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