Submission #62168

#TimeUsernameProblemLanguageResultExecution timeMemory
62168aomeParrots (IOI11_parrots)C++17
81 / 100
11 ms2176 KiB
#include "encoder.h" #include "encoderlib.h" #include <bits/stdc++.h> using namespace std; void encode(int N, int M[]) { if (N > 32) return; for (int i = 0; i < N; ++i) { for (int j = 0; j < 8; ++j) { if (M[i] >> j & 1) send(i * 8 + j); } } }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; bool in[256]; void decode(int N, int L, int X[]) { if (N > 32) return; memset(in, 0, sizeof in); for (int i = 0; i < L; ++i) in[X[i]] = 1; for (int i = 0; i < N; ++i) { int tmp = 0; for (int j = 0; j < 8; ++j) { if (in[i * 8 + j]) tmp += 1 << j; } output(tmp); } }
#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...