제출 #1140379

#제출 시각아이디문제언어결과실행 시간메모리
1140379hyl_kibou앵무새 (IOI11_parrots)C++17
34 / 100
0 ms836 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]) { int sum = 0; for(int i=0; i<N; i++){ //printf("%d ", sum+M[i]); send(sum+M[i]); sum+=M[i]; } }
#include "decoder.h" #include "decoderlib.h" #include <algorithm> void decode(int N, int L, int X[]) { std::sort(X, X+L); int sum = 0; for(int i=0; i<L; i++) { //printf("%d ", X[i]-sum); output(X[i]-sum); sum+=X[i]-sum; } }
#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...