Submission #62170

#TimeUsernameProblemLanguageResultExecution timeMemory
62170aomeParrots (IOI11_parrots)C++17
88 / 100
20 ms2784 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 < min(32, N); ++i) { for (int j = 0; j < 8; ++j) { int x = M[i] >> j & 1; int y = 0; if (i + 32 < N) y = M[i + 32] >> j & 1; int cnt = y * 2 + x; while (cnt--) send(i * 8 + j); } } }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; int res[64]; int cnt[256]; void decode(int N, int L, int X[]) { memset(cnt, 0, sizeof cnt); for (int i = 0; i < L; ++i) cnt[X[i]]++; memset(res, 0, sizeof res); for (int i = 0; i < min(32, N); ++i) { for (int j = 0; j < 8; ++j) { int x = cnt[i * 8 + j] % 2, y = cnt[i * 8 + j] / 2; res[i] += x << j; res[i + 32] += y << j; } } for (int i = 0; i < N; ++i) output(res[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...