oj.uz

Submission #946603

# Submission time Handle Problem Language Result Execution time Memory
946603 2024-03-14T19:34:29 Z StefanSebez Parrots (IOI11_parrots) C++14
52 / 100
 3 ms 1328 KB 
#include<bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int N, int M[])
{
	for(int i=0;i<N;i++){
		int temp=M[i],ct=0;
		while(temp>0){
			int x=i+(1<<4)*ct+(1<<7)*(temp%2);
			//printf("%i %i %i: %i\n",i,ct,temp%2,x);
			send(x);
			ct++;
			temp/=2;
		}
	}
	/*for(int i=0,sum=0;i<N;i++){
		sum+=M[i];
		send(sum);
	}*/
  /*int i;
  for(i=0; i<N; i++)
    send(M[i]);*/
}

#include<bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
#define pb push_back
void decode(int N, int L, int X[])
{
	int res[N+10]={0};
	for(int i=0;i<L;i++){
		int temp=X[i],ct=8;
		vector<int>bits;
		while(ct--){
			bits.pb(temp%2);
			temp/=2;
		}
		int ind=X[i]%(1<<4);
		/*for(int j=0;j<4;j++){
			ind+=(1<<j)*bits[4-j];
		}*/
		int idx=(X[i]/(1<<4))%(1<<3);
		/*for(int j=4;j<=6;j++){
			idx+=(1<<(j-4))*(bits[4+6-j]);
		}*/
		res[ind]+=(1<<idx)*bits.back();
	}
	for(int i=0;i<N;i++){
		output(res[i]);
		//printf("%i ",res[i]);
	}
	//printf("\n");
	/*sort(X,X+L);
	output(X[0]);
	for(int i=1;i<L;i++){
		output(X[i]-X[i-1]);
	}*/
  /*int i, b;
  for(i=0; i<L; i++) {
    b = X[i];
    output(b);
  }*/
}

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
18.0 / 18.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1316 KB Output is correct
2 Correct 2 ms 1320 KB Output is correct
3 Incorrect 0 ms 784 KB Error : Bad encoded integer
4 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 1324 KB partially correct P=8.000000
2 Incorrect 0 ms 780 KB Error : Bad encoded integer
3 Halted 0 ms 0 KB -