제출 #1297925

#제출 시각아이디문제언어결과실행 시간메모리
1297925bangchan앵무새 (IOI11_parrots)C++20
0 / 100
2 ms580 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int n, int m[]) { int i; for(i=0; i<n; i++) if(m[i]) send(i); }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; void decode(int n, int l, int x[]){ sort(x, x + 1); for(int i=0; i<l; i++) { if(x[i] % 2 == 1) output(1); else output(0); } }
#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...