oj.uz

Submission #24727

# Submission time Handle Problem Language Result Execution time Memory
24727 2017-06-12T13:33:23 Z mohammad_kilani Parrots (IOI11_parrots) C++14
17 / 100
 5 ms 2056 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int N, int M[])
{
	int n = (((256+N-1) / N)+1)/2;
	for(int i=0;i<N;i++){
		int idx = i*n + M[i] % n;
		send(idx); 
	} 
	for(int i=0;i<N;i++){
		int num = M[i] / n ;
		int idx = i*n + N*n ;
		int all = 0;
		for(int j=0;j<2;j++){
			int cur = ((num >> i) & 1);
			all |= cur;
		}
		idx+=all;
		num = (num >> 2);
		for(int j=0;j<num;j++)
			send(idx);
	}
}

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;


void decode(int N, int L, int X[])
{

	int n = (((256+N-1) / N)+1)/2;
	vector<int> mod(N);
	vector<int> mul(N);
	vector<int> frq(N);
	for(int i=0;i<L;i++){
		if(X[i] >= n*N){
			int cur = X[i] - n*N;
			int idx = cur / n ;
			int b = cur % n;
			mul[idx] = b;
			frq[idx]++;
		}
		else{
			int idx = X[i] / n ;
			int b = X[i] % n;
			mod[idx] = b;
		}
	}
	for(int i=0;i<N;i++){
		frq[i] = (frq[i] << 2);
		mul[i]+=frq[i];
		int ans = n * mul[i] + mod[i];
		output(ans);
	}
  
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2000 KB Error : Output is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2000 KB Error : Output is wrong
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 2000 KB Error : Output is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 2056 KB Error : Output is wrong
2 Incorrect 4 ms 2056 KB Error : Encoded message too long
3 Incorrect 4 ms 2056 KB Error : Encoded message too long
4 Incorrect 4 ms 2056 KB Error : Encoded message too long
5 Incorrect 4 ms 2056 KB Error : Bad encoded integer
6 Incorrect 4 ms 2056 KB Error : Bad encoded integer
7 Incorrect 4 ms 2056 KB Error : Encoded message too long