제출 #559345

#제출 시각아이디문제언어결과실행 시간메모리
559345Mahmudul_Kabir앵무새 (IOI11_parrots)C++14
52 / 100
5 ms1084 KiB
#include "encoder.h" #include "encoderlib.h" #include "bits/stdc++.h" using namespace std; #define all(x) x.begin(), x.end() #define pii pair<int,int> #define pb push_back void encode(int N, int M[]) { int i; for(i = 0; i < N; i++){ int x = M[i], bi = 0; vector<int> bin; int d = x; while(d){ bin.pb(d % 4); d /= 4; } for(int r: bin){ int mao = i; mao |= (r << 6); mao |= (bi<< 4); bi++; send(mao); } } }
#include "decoder.h" #include "decoderlib.h" #include "bits/stdc++.h" using namespace std; #define all(x) x.begin(), x.end() #define pii pair<int,int> #define pb push_back void decode(int N, int L, int X[]) { int fin[N]; memset(fin,0,sizeof(fin)); for(int i = 0; i < L; i++){ int r = X[i]; int ind = (1<<4) - 1; ind &= r; r >>= 4; int bin = (1<<2) - 1; bin &= r; r >>= 2; bin *= 2; fin[ind] |= (r<<bin); } for(int r: fin) output(r); }
#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...