oj.uz

Submission #262269

# Submission time Handle Problem Language Result Execution time Memory
262269 2020-08-12T15:03:47 Z nandonathaniel Parrots (IOI11_parrots) C++14
81 / 100
 4 ms 1536 KB 
#include "encoder.h"
#include "encoderlib.h"
#include "bits/stdc++.h"
using namespace std;
void encode(int N, int M[])
{
	int satu=0,nol=0;
	for(int i=0;i<N;i++){
		for(int j=0;j<8;j++){
			if((1<<j) & M[i])satu++;
			else nol++;
		}
	}
	if(satu<nol){
		for(int i=0;i<N;i++){
			for(int j=0;j<8;j++){
				if((1<<j) & M[i])send(j*N+i);
			}
		}
	}
	else{
		send(0);send(0);
		for(int i=0;i<N;i++){
			for(int j=0;j<8;j++){
				if(!((1<<j) & M[i]))send(j*N+i);
			}
		}
	}
}
#include "decoder.h"
#include "decoderlib.h"
#include "bits/stdc++.h"
using namespace std;
int ans[64],byk[256];
void decode(int N, int L, int X[])
{
	memset(byk,0,sizeof(byk));
	for(int i=0;i<L;i++)byk[X[i]]++;
	memset(ans,0,sizeof(ans));
	if(byk[0]>1){
		//kita masukkinnya yang mati
		if(byk[0]==3)ans[0]++;
		for(int i=1;i<256;i++){
			if(byk[i])ans[i%N]+=(1<<(i/N));
		}
		for(int i=0;i<N;i++)ans[i]=255-ans[i];
	}
	else{
		for(int i=0;i<256;i++){
			if(byk[i])ans[i%N]+=(1<<(i/N));
		}
	}
	for(int i=0;i<N;i++)output(ans[i]);
}

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1536 KB Output is correct
2 Correct 3 ms 1536 KB Output is correct
3 Correct 3 ms 1536 KB Output is correct
4 Correct 3 ms 1536 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 3 ms 1536 KB Output is correct
4 Correct 2 ms 1536 KB Output is correct

Subtask #4
29.0 / 29.0

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

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1536 KB Output is correct - P = 4.125000
2 Correct 3 ms 1536 KB Output is correct - P = 4.062500
3 Incorrect 1 ms 900 KB Error : Bad encoded integer
4 Incorrect 0 ms 772 KB Error : Bad encoded integer
5 Incorrect 1 ms 900 KB Error : Bad encoded integer
6 Incorrect 2 ms 900 KB Error : Bad encoded integer
7 Incorrect 1 ms 984 KB Error : Bad encoded integer