Submission #64152

#TimeUsernameProblemLanguageResultExecution timeMemory
64152zubecParrots (IOI11_parrots)C++14
0 / 100
10 ms2456 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 x = M[i]; for (int j = 0; j < 8; j++){ if (x & (1<<j)){ int curmask = i | (j << 5); send(curmask); } } } }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; bool cmp(int fi, int se){ return (fi & ((1<<5)-1)) < (se & ((1<<5)-1)); } void decode(int N, int L, int X[]){ sort(X, X+L, cmp); int ans = 0; for (int i = 0; i < L; i++){ if (i != 0 && (X[i] & ((1<<5)-1)) != (X[i-1] & ((1<<5)-1))){ output(ans); ans = 0; } /*for (int j = 0; j < 8; j++) cout << (X[i] & (1<<j) ? 1 : 0); cout << endl; cout << (X[i]>>5) << endl;*/ ans |= (1<<(X[i]>>5)); } output(ans); }
#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...