oj.uz

Submission #39301

# Submission time Handle Problem Language Result Execution time Memory
39301 2018-01-11T04:34:27 Z tjd229 Parrots (IOI11_parrots) C++11
98 / 100
 17 ms 2384 KB 
#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[])
{
	int i,j;
	int ix = 0;
	int bit8 = 1 << 7;
	int bit;
	int n = N < 32 ? N : 32;
	int M1[15 * 64];
	int M2[15 * 64];
	int p1 = 0;
	int p2 = 0;
	for (i = 0; i < n; i++){
		bit = bit8;
		for (j = 0; j < 8; j++, bit >>= 1, ix++)
			if (bit&M[i])
				M1[p1++] = ix;
			else
				M2[p2++] = ix;
	}
	for (ix=0; i < N; i++){
		bit = bit8;
		for (j = 0; j < 8; j++, bit >>= 1, ix++)
			if (bit&M[i]){
				M1[p1++] = ix;
				M1[p1++] = ix;
			}
			else{
				M2[p2++] = ix;
				M2[p2++] = ix;
			}
	}
	for (i = 0; i < 4;i++)
		M2[p2++]=0;
	if (p2 < p1)
		for (i = 0; i < p2; i++) send(M2[i]);
	else
		for (i = 0; i < p1; i++) send(M1[i]);
}

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

void decode(int N, int L, int X[])
{
	int i,j;
	int cnt[256] = { 0 };
	int recover;
	int n = N < 32 ? N : 32;
	int c = 0;
	for (i = 0; i < L; i++)
		cnt[X[i]]++;
	
	if (cnt[0] & 4)
		c = 255;
	for (i = 0,n*=8; i < n;){
		recover = 0;
		for (j = 0; j < 8; j++, i++){
			recover <<= 1;
			if (cnt[i]&1)
				recover += 1;
		}		
		output(recover^c);
	}
	for (N *= 8; i < N;){
		recover = 0;
		for (j = 0; j < 8; j++, i++){
			recover <<= 1;
			if (cnt[i-256] & 2)
				recover += 1;
			
		}
		output(recover^c);
	}
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 752 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1592 KB Output is correct
2 Correct 5 ms 1592 KB Output is correct
3 Correct 4 ms 1624 KB Output is correct
4 Correct 4 ms 1872 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1872 KB Output is correct
2 Correct 4 ms 1912 KB Output is correct
3 Correct 5 ms 1912 KB Output is correct
4 Correct 5 ms 2032 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2064 KB Output is correct
2 Correct 5 ms 2096 KB Output is correct
3 Correct 6 ms 2096 KB Output is correct
4 Correct 6 ms 2096 KB Output is correct
5 Correct 7 ms 2096 KB Output is correct
6 Correct 5 ms 2096 KB Output is correct

Subtask #5
17.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2096 KB Output is correct - P = 4.125000
2 Correct 7 ms 2096 KB Output is correct - P = 4.062500
3 Correct 7 ms 2168 KB Output is correct - P = 4.181818
4 Partially correct 11 ms 2168 KB Output is partially correct - P = 5.440000
5 Partially correct 17 ms 2176 KB Output is partially correct - P = 5.900000
6 Partially correct 17 ms 2384 KB Output is partially correct - P = 6.000000
7 Partially correct 12 ms 2384 KB Output is partially correct - P = 6.015625