제출 #41112

#제출 시각아이디문제언어결과실행 시간메모리
41112hsb154앵무새 (IOI11_parrots)C++14
81 / 100
9 ms2184 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]) { for (int i = 0; i < N; i++) { int mask = 1; for (int j = 0; j <8; j++) { int temp = 0; temp = temp | (i << 3); temp = temp | (j); if (((M[i] & mask) >> j) != 0) { send(temp); } mask <<= 1; } } }
#include "decoder.h" #include "decoderlib.h" void decode(int N, int L, int X[]) { for (int i = 0; i < N; i++) { int temp = 0; for (int k = 0; k < 8; k++) { for (int j = 0; j < L; j++) { if ((X[j] >> 3) == i && ((X[j]) & 7) == k) { temp = temp | (1 << k); break; } } } output(temp); } }
#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...