Submission #36352

#TimeUsernameProblemLanguageResultExecution timeMemory
36352funcsrParrots (IOI11_parrots)C++14
52 / 100
7 ms2104 KiB
#include <iostream> #include <vector> #include <queue> #include "encoder.h" #include "encoderlib.h" using namespace std; #define INF 1145141919 #define rep(i, n) for (int i=0; i<(n); i++) #define pb push_back #define all(x) x.begin(), x.end() #define _1 first #define _2 second typedef pair<int, int> P; void encode(int N, int A[]) { rep(i, N) rep(j, 8) send((i<<4) | (j<<1) | ((A[i]>>j)&1)); }
#include <iostream> #include <vector> #include <queue> #include "decoder.h" #include "decoderlib.h" using namespace std; #define INF 1145141919 #define rep(i, n) for (int i=0; i<(n); i++) #define pb push_back #define all(x) x.begin(), x.end() #define _1 first #define _2 second typedef pair<int, int> P; int A[64]; void decode(int N, int L, int X[]) { rep(i, N) A[i] = 0; rep(i, L) { int data = X[i]&1; int offset = ((X[i]>>1) & 0b111); int pos = X[i]>>4; A[pos] |= data<<offset; } rep(i, N) output(A[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...