답안 #961985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961985 2024-04-13T01:30:06 Z shoryu386 앵무새 (IOI11_parrots) C++17
81 / 100
3 ms 1488 KB
#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]);
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 780 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1312 KB Output is correct
2 Correct 1 ms 1488 KB Output is correct
3 Correct 1 ms 1304 KB Output is correct
4 Correct 1 ms 1312 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1312 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 2 ms 1316 KB Output is correct
4 Correct 1 ms 1308 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1312 KB Output is correct
2 Correct 2 ms 1320 KB Output is correct
3 Correct 2 ms 1316 KB Output is correct
4 Correct 2 ms 1320 KB Output is correct
5 Correct 3 ms 1332 KB Output is correct
6 Correct 3 ms 1332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 1320 KB partially correct P=8.000000
2 Partially correct 3 ms 1328 KB partially correct P=8.000000
3 Incorrect 0 ms 796 KB Error : Bad encoded integer
4 Halted 0 ms 0 KB -