oj.uz

Submission #984047

# Submission time Handle Problem Language Result Execution time Memory
984047 2024-05-16T09:34:10 Z sleepntsheep Parrots (IOI11_parrots) C
100 / 100
 519 ms 23488 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <string.h>
 
#define N	64
#define M	(N / 4)
#define A	256
#define B	4294967296
#define K	(N * 5)
 
long long dp_[A + 1][K + 1][M];
 
void add(long long *aa, long long *bb, long long *cc) {
	int i;
 
	for (i = 0; i < M; i++)
		cc[i] = aa[i] + bb[i];
	for (i = 0; i < M; i++)
		if (cc[i] >= B) {
			if (i + 1 == M)
				cc[i] = B;
			else
				cc[i] -= B, cc[i + 1]++;
		}
}
 
void sub(long long *aa, long long *bb) {
	int i;
 
	for (i = 0; i < M; i++)
		aa[i] -= bb[i];
	for (i = 0; i < M; i++)
		if (aa[i] < 0)
			aa[i] += B, aa[i + 1]--;
}
 
void init() {
	int a, k;
 
	for (a = 0; a <= A; a++)
		for (k = 0; k <= K; k++)
			if (a == 0 || k == 0)
				memset(dp_[a][k], 0, M * sizeof *dp_[a][k]), dp_[a][k][0] = 1;
			else
				add(dp_[a - 1][k], dp_[a][k - 1], dp_[a][k]);
}
 
int lt(long long *aa, long long *bb) {
	int i;
 
	for (i = M - 1; i >= 0; i--)
		if (aa[i] != bb[i])
			return aa[i] < bb[i];
	return 0;
}
 
void encode(int n, int *aa_) {
	static long long aa[M];
	int i, a, k;
 
	init();
	memset(aa, 0, M * sizeof *aa);
	for (i = 0; i < n; i++)
		aa[i / 4] |= (long long) aa_[i] << i % 4 * 8;
	a = A, k = K;
	while (a > 0 || k > 0)
		if (k > 0 && lt(aa, dp_[a][k - 1])) {
			if (a < A)
				send(a);
			k--;
		} else {
			if (k > 0)
				sub(aa, dp_[a][k - 1]);
			a--;
		}
}


#include "decoder.h"
#include "decoderlib.h"

#include <string.h>

#define A 256
#define K 320
#define N 64
#define M N / 4
#define B 4294967296ll

long long dp[A+1][K+1][M];

void add_(long long *a, long long *b, long long *c) {
    for (int i = 0; i < M; ++i)
        c[i] = a[i] + b[i];
    for (int i = 0; i < M; ++i)
        if (c[i] >= B) {
            if (i + 1 == M)
                c[i] = B;
            else
                c[i] -= B, ++c[i+1];
        }
}

int lt_(long long *a, long long *b) {
    for (int i = M - 1; i >= 0; --i)
        if (a[i] != b[i])
            return a[i] < b[i];
    return 0;
}

void init_() {
    for (int i = 0; i <= A; ++i)
        for (int j = 0; j <= K; ++j)
            if (i == 0 || j == 0)
                memset(dp[i][j], 0, sizeof **dp), dp[i][j][0] = 1;
            else
                add_(dp[i-1][j], dp[i][j-1], dp[i][j]);
}


void decode(int n, int L, int X[])
{
    init_();

    static int ff[A], f;
    static long long aa[M];

    f = 0;
    memset(ff, 0, sizeof ff);
    memset(aa, 0, sizeof aa);

    for (int i = 0; i < L; ++i) ++ff[X[i]];

    for (int a = 0; a < A; ++a) {
        f += ff[a];
        if (f > 0)
            add_(aa, dp[a + 1][f - 1], aa);
    }

    for (int i = 0; i < n; ++i)
        output((aa[i / 4] >> (8 * (i & 3))) & 255);
}

Compilation message

grader_decoder.c: In function 'main':
grader_decoder.c:86:2: warning: implicit declaration of function 'fcloseall'; did you mean 'fclose'? [-Wimplicit-function-declaration]
   86 |  fcloseall();
      |  ^~~~~~~~~
      |  fclose

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 22200 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 512 ms 22484 KB Output is correct
2 Correct 488 ms 22636 KB Output is correct
3 Correct 490 ms 22888 KB Output is correct
4 Correct 496 ms 22456 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 507 ms 22548 KB Output is correct
2 Correct 493 ms 22704 KB Output is correct
3 Correct 512 ms 23488 KB Output is correct
4 Correct 495 ms 22608 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 519 ms 22696 KB Output is correct
2 Correct 489 ms 22732 KB Output is correct
3 Correct 486 ms 22716 KB Output is correct
4 Correct 493 ms 22952 KB Output is correct
5 Correct 486 ms 22436 KB Output is correct
6 Correct 495 ms 22616 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 22692 KB Output is correct
2 Correct 492 ms 22464 KB Output is correct
3 Correct 496 ms 22572 KB Output is correct
4 Correct 513 ms 22904 KB Output is correct
5 Correct 495 ms 22680 KB Output is correct
6 Correct 497 ms 22912 KB Output is correct
7 Correct 492 ms 22688 KB Output is correct