Submission #896489

#TimeUsernameProblemLanguageResultExecution timeMemory
896489antonParrots (IOI11_parrots)C++17
24 / 100
8 ms1388 KiB
#include "encoder.h" #include "encoderlib.h" #include<bits/stdc++.h> using namespace std; #define ll long long void encode(int N, int M[]) { int id = 0; for(int i=0; i<N; i++){ for(int j = 0; j<8; j+=2){ int oc = (M[i] & (3<<j))>>j; for(int k = 0; k<oc; k++){ send(id); } id++; } } }
#include "decoder.h" #include "decoderlib.h" #include<bits/stdc++.h> using namespace std; void decode(int N, int L, int X[]) { ////cout<<"L "<<L<<endl; vector<int> v(L); for(int i = 0; i<L; i++){ v[i] = X[i]; } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); vector<int> res(N); for(int pos = 0; pos<N*4; pos++){ int oc= 0; while(v.size()>0 && v.back() == pos){ oc++; v.pop_back(); } //cout<<bitset<8>(oc<<((2*pos)%8)); res[pos/4] ^= (oc<<((2*pos)%8)); } for(auto e: res){ output(e); } }
#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...