oj.uz

Submission #984050

# Submission time Handle Problem Language Result Execution time Memory
984050 2024-05-16T09:37:03 Z sleepntsheep Parrots (IOI11_parrots) C
100 / 100
 520 ms 23244 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 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 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]);
}
 
void decode(int n, int l, int *bb) {
	static long long aa[M];
	static int kk[A];
	int i, a, k;
 
	init_();
	memset(kk, 0, A * sizeof *kk);
	for (i = 0; i < l; i++)
		kk[bb[i]]++;
	memset(aa, 0, M * sizeof *aa);
	k = 0;
	for (a = 0; a < A; a++) {
		k += kk[a];
		if (k > 0)
			add_(aa, dp_[a + 1][k - 1], aa);
	}
	for (i = 0; i < n; i++)
		output(aa[i / 4] >> i % 4 * 8 & A - 1);
}

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
decoder.c: In function 'decode':
decoder.c:55:33: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   55 |   output(aa[i / 4] >> i % 4 * 8 & A - 1);
      |                                 ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 22356 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 500 ms 22464 KB Output is correct
2 Correct 505 ms 22548 KB Output is correct
3 Correct 495 ms 22484 KB Output is correct
4 Correct 514 ms 22568 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 22604 KB Output is correct
2 Correct 516 ms 22548 KB Output is correct
3 Correct 493 ms 22404 KB Output is correct
4 Correct 490 ms 22656 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 504 ms 22612 KB Output is correct
2 Correct 508 ms 22668 KB Output is correct
3 Correct 491 ms 22584 KB Output is correct
4 Correct 501 ms 22616 KB Output is correct
5 Correct 494 ms 23244 KB Output is correct
6 Correct 508 ms 22852 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 22552 KB Output is correct
2 Correct 497 ms 22628 KB Output is correct
3 Correct 497 ms 22992 KB Output is correct
4 Correct 498 ms 22456 KB Output is correct
5 Correct 492 ms 22728 KB Output is correct
6 Correct 499 ms 22596 KB Output is correct
7 Correct 520 ms 22912 KB Output is correct