제출 #961985

#제출 시각아이디문제언어결과실행 시간메모리
961985shoryu386앵무새 (IOI11_parrots)C++17
81 / 100
3 ms1488 KiB
#include <bits/stdc++.h>
using namespace std;


#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[]){
	bool bs[N*8];
	memset(bs, 0, sizeof(bs));
	for (int x = 0; x < N; x++){
		for (int z = 0; z < 8; z++){
			bs[x*8 + z] = ((M[x] & (1<<z)) != 0);
		}
	}
	
	for (int x = 0; x < N; x++){
		for (int z = 0; z < 8; z++){
			if (bs[x*8+z]) send(x*8+z);
		}
	}
}
#include <bits/stdc++.h>
using namespace std;

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

void decode(int N, int L, int X[]){
	bool bs[N*8];
	memset(bs, 0, sizeof(bs));
	
	for (int x = 0; x < L; x++){
		bs[X[x]] = 1;
	}
	
	int res[N]; memset(res, 0, sizeof(res));
	
	for (int x = 0; x < N; x++){
		for (int z = 0; z < 8; z++){
			res[x] += bs[8*x+z] * (1<<z);
		}
	}
	
	for (int x = 0; x < N; x++){
		output(res[x]);
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...