Submission #595970

#TimeUsernameProblemLanguageResultExecution timeMemory
595970fuad27Parrots (IOI11_parrots)C++17
88 / 100
13 ms1424 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++) { for(int j = 0;j<8;j++) { if(M[i]&(1ll<<j)) { if(i < 32) { long long num = i*(1ll<<3)+j; send(num); } else { long long i_=i-32; long long num = i_*(1ll<<3)+j; send(num); send(num); } } } } }
#include "decoder.h" #include "decoderlib.h" #include<bits/stdc++.h> using namespace std; void decode(int N, int L, int X[]) { int ans[N]; for(int i = 0;i<N;i++)ans[i]=0; map<int,int> cnt; for(int i = 0;i<L;i++)cnt[X[i]]++; for(int i = 0;i<L;i++) { if(cnt[X[i]]==1) { ans[X[i]/8]|=(1ll<<(X[i]%8)); } else if(cnt[X[i]]==2) { ans[X[i]/8+32]|=(1ll<<(X[i]%8)); } else if(cnt[X[i]]==3){ ans[X[i]/8+32]|=(1ll<<(X[i]%8)); ans[X[i]/8]|=(1ll<<(X[i]%8)); } } 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...