제출 #1112208

#제출 시각아이디문제언어결과실행 시간메모리
1112208enzy앵무새 (IOI11_parrots)C++14
0 / 100
1 ms1456 KiB
#include "encoder.h" #include "encoderlib.h" #include<bits/stdc++.h> using namespace std; void encode(int N, int M[]){ vector<int>mandar; for(int i=0;i<N;i++){ for(int k=0;k<10;k++){ if((1<<k)&M[i]){ int aux=(i<<3)+k; mandar.push_back(aux); } } } for(auto a : mandar) send(a); }
#include "decoder.h" #include "decoderlib.h" void decode(int N, int L, int X[]){ int resp[N+1]; for(int i=0;i<L;i++){ int pos=(X[i]>>3); int val=(1<<(X[i]%(1<<3))); resp[pos]+=val; } for(int i=0;i<N;i++) output(resp[i]); }
#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...