Submission #411548

#	Time	Username	Problem	Language	Result	Execution time	Memory
411548		LouayFarah	Parrots (IOI11_parrots)	C++14	34 / 100	4 ms	1032 KiB

encoder

#include "bits/stdc++.h"
#include "encoder.h"
using namespace std;

#define pb push_back

vector<int> primes;
void send(int a);

void init_primes()
{
  	primes.resize(0);
  	int nb = 2;
    while((int)primes.size()<32)
    {
        if(nb==2)
            primes.pb(nb);
        else
        {
            bool flag = true;
            for(int i = 2; i*i<=nb; i++)
            {
                if(nb%i==0)
                {
                    flag = false;
                    break;
                }
            }
            if(flag)
                primes.pb(nb);
        }
        nb++;
    }
}

void encode(int n, int m[])
{
   	init_primes();

    for(int i = 0; i<n; i++)
    {
        if(m[i]==0)
        {
            send(65535-i);
            continue;
        }
        string nb = bitset<8>(m[i]).to_string();
        for(int pos = 1; pos<=8; pos++)
        {
            if(nb[8-pos]=='1')
            {
                send(primes[8+i]*(primes[pos-1]));
            }
        }
    }
}

decoder

#include "bits/stdc++.h"
#include "decoder.h"
using namespace std;

#define pb push_back

vector<int> primes;
void output(int b);

void init_primes()
{
  	primes.resize(0);
  	int nb = 2;
    while((int)primes.size()<32)
    {
        if(nb==2)
            primes.pb(nb);
        else
        {
            bool flag = true;
            for(int i = 2; i*i<=nb; i++)
            {
                if(nb%i==0)
                {
                    flag = false;
                    break;
                }
            }
            if(flag)
                primes.pb(nb);
        }
        nb++;
    }
}

void decode(int n, int l, int x[])
{
  	init_primes();
    for(int i = 0; i<n; i++)
    {
        int elt = 0;
        for(int j = 0; j<l; j++)
        {
            if(x[j]%primes[8+i]==0)
            {
                for(int k = 0; k<8; k++)
                {
                    if(primes[k] == x[j]/primes[8+i])
                    {
                        int cnt = k;
                        int temp = 1;
                        while(cnt--)
                            temp*=2;
                        elt+=temp;
                    }
                }
            }
        }
        output(elt);
    }
}

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