Submission #1000057

# Submission time Handle Problem Language Result Execution time Memory
1000057 2024-06-16T14:24:54 Z NintsiChkhaidze Parrots (IOI11_parrots) C++17
34 / 100
1 ms 3096 KB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#include "encoder.h"
#include "encoderlib.h"
//#include "parrotslib.h"
 
using namespace std;
const int MN = 3e5 + 5;
int xx[300005];
 
int get(int b,int idx){
	int x = b;
	if (idx < 10) x = x*10 + idx;
	else x = x*100 + idx;
	return x;
}
 
void encode(int N, int M[]){
	int id = -1;
	for (int i = 0; i < N; i++){
		int x = M[i];
		
		for (int j = 8; j >= 0; j--){
			if (((x >> j) & 1)){
				xx[++id] = get(j + 1,i);
			}
		}
	}
	
	send(0);
	for (int i=0;i<=id;i++)
		send(xx[i]);
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
#define ll long long
#define pb push_back
//#include "parrotslib.h"
 
using namespace std;
//const int MN = 3e5 + 5;
int yy[300005];
 
void decode(int N, int L, int X[]){
	
	for (int i=0;i<N;i++)
		yy[i] = 0;
		
	for (int i = 0; i < L; i++){
		int x = X[i];
		int A = 0,B = 0;
		if (x < 100) A = x/10,B = x%10;
		else A = x/100,B = x - A*100;
		
		if (A == 0) continue;
		yy[B] |= (1<<(A - 1));
	}
	
	for (int i=0;i<N;i++)
		output(yy[i]);
}
 
# Verdict Execution time Memory Grader output
1 Correct 1 ms 3096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2848 KB Output is correct
2 Correct 1 ms 2848 KB Output is correct
3 Correct 1 ms 2852 KB Output is correct
4 Correct 1 ms 2860 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2844 KB Output is correct
2 Incorrect 1 ms 2832 KB Error : Bad encoded integer
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2840 KB Output is correct
2 Incorrect 1 ms 2836 KB Error : Bad encoded integer
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3084 KB Error : Bad encoded integer
2 Halted 0 ms 0 KB -