제출 #1168568

#제출 시각아이디문제언어결과실행 시간메모리
11685688pete8앵무새 (IOI11_parrots)C++20
52 / 100
3 ms840 KiB
#include "encoder.h" #include "encoderlib.h" #include<iostream> using namespace std; void encode(int N, int M[]) { for(int i=0; i<N; i++){ for(int j=0;j<8;j++)if(!(j%2)){ int x=(i<<4LL)+((j/2)<<2LL)+(!!(M[i]&(1LL<<j)))+((!!(M[i]&(1LL<<(j+1))))<<(1LL)); send(x); } } } /* 0 0 0 0 0 0 0 0 */
#include "decoder.h" #include "decoderlib.h" #include<iostream> #include<vector> using namespace std; #define all(x) x.begin(),x.end() #define pb push_back void decode(int N, int L, int X[]) { vector<int>v; for(int i=0;i<L;i++)v.pb(X[i]); sort(all(v)); vector<int>ans(N,0); for(int i=0;i<L;i++){ ans[i/4]+=(((v[i]&1)+(v[i]&2))<<((i%4)*2LL)); } for(int i=0;i<N;i++) output(ans[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...