oj.uz

Submission #14787

# Submission time Handle Problem Language Result Execution time Memory
14787 2015-06-24T06:11:30 Z gs14004 Parrots (IOI11_parrots) C++14
17 / 100
 2000 ms 142424 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <cstring>
using namespace std;

struct bignum{
    short arr[100];
    void init(char i){
        memset(arr,0,sizeof(arr));
        arr[0] = i;
    }
};

bignum operator+(bignum a, bignum b){
    for (int i=0; i<100; i++) {
        a.arr[i] += b.arr[i];
        if(a.arr[i] >= 256) {
            a.arr[i] -= 256;
            a.arr[i+1] ++;
        }
    }
    return a;
}

bool operator<(bignum a, bignum b){
    for (int i=99; i>=0; i--) {
        if(a.arr[i] < b.arr[i]) return 1;
        if(a.arr[i] > b.arr[i]) return 0;
    }
    return 0;
}

bignum bino[600][600];

void encode(int N, int* M){
    for (int i=0; i<600; i++) {
        bino[i][0].init(1);
        for (int j=1; j<=i; j++) {
            bino[i][j].init(0);
            bino[i][j] = bino[i-1][j] + bino[i-1][j-1];
        }
        for (int j=i+1; j<600; j++) {
            bino[i][j].init(0);
        }
    }
    bignum t, base;
    t.init(0);
    for (int i=0; i<N; i++) {
        t.arr[i] = M[i];
    }
    base.init(2);
    t = t + base;
    base.init(0);
    int cnt = 0;
    int length= 5 * N;
    for(int i=0; i<5*N; i++){
        while (bino[length+1][5 * N - cnt] + base < t) {
            length++;
        }
        send(5 * N + 255 - length - cnt);
        base = base + bino[length - 1][5 * N - cnt];
        cnt++;
        length--;
    }
}

#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
#include <cstring>
using namespace std;

struct bignum{
    short arr[100];
    void init(char i){
        memset(arr,0,sizeof(arr));
        arr[0] = i;
    }
};

bignum operator+(bignum a, bignum b){
    for (int i=0; i<100; i++) {
        a.arr[i] += b.arr[i];
        if(a.arr[i] >= 256) {
            a.arr[i] -= 256;
            a.arr[i+1] ++;
        }
    }
    return a;
}

bool operator<(bignum a, bignum b){
    for (int i=99; i>=0; i--) {
        if(a.arr[i] < b.arr[i]) return 1;
        if(a.arr[i] > b.arr[i]) return 0;
    }
    return 0;
}

bignum bino[600][600];

void decode(int N, int L, int X[])
{
    for (int i=0; i<600; i++) {
        bino[i][0].init(1);
        for (int j=1; j<=i; j++) {
            bino[i][j].init(0);
            bino[i][j] = bino[i-1][j] + bino[i-1][j-1];
        }
        for (int j=i+1; j<600; j++) {
            bino[i][j].init(0);
        }
    }
    sort(X,X+L);
    reverse(X,X+L);
    bignum ret;
    ret.init(0);
    for (int i=0; i<L; i++) {
        ret = ret + bino[5 * N + 255 - X[i] - i-1][5 * N - i];
    }
    for (int i=0; i<N; i++) {
        output(ret.arr[i]);
    }
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1557 ms 142064 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2062 ms 71196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2078 ms 71196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 71212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 185 ms 142424 KB Error : Bad encoded integer
2 Incorrect 185 ms 142424 KB Error : Bad encoded integer
3 Incorrect 183 ms 142424 KB Error : Bad encoded integer
4 Incorrect 186 ms 142424 KB Error : Bad encoded integer
5 Incorrect 184 ms 142424 KB Error : Bad encoded integer
6 Incorrect 188 ms 142424 KB Error : Bad encoded integer
7 Incorrect 186 ms 142424 KB Error : Bad encoded integer