제출 #69278

#제출 시각아이디문제언어결과실행 시간메모리
69278bnahmad15앵무새 (IOI11_parrots)C++17
0 / 100
6 ms1904 KiB
#include "encoder.h" #include "encoderlib.h" #include <bits/stdc++.h> using namespace std; void encode(int N, int M[]){ for(int i = 0;i < N;i++){ int tmp = i; for(int j = 4;j<12;j++){ if(M[i] & (1<<(j-4))) tmp |= (1<<j); } /* for(int j = 5;j<11;j++){ if(M[i] & (1<<(j+5))) tmp2 |= (1<<j); } tmp2 |= (1<<15);*/ send(tmp); // send(tmp2); } }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; int ar[20]; void decode(int N, int L, int X[]){ for(int i = 0;i<L;i++){ int p = 0; for(int j = 0;j<4;j++){ if((1<<j) & X[i]) p |= (1<<j); } int numb = 0; /*if(X[i] & (1<<15)){ for(int j = 5;j<11;j++){ if((1<<j) & X[i]) numb |= (1<<j+5); } } else {*/ for(int j = 4;j<12;j++){ if((1<<j) & X[i]) numb |= (1<<(j-4)); } //} ar[p] |= numb; } for(int i = 0;i<N;i++) output(ar[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...