Submission #69428

#TimeUsernameProblemLanguageResultExecution timeMemory
69428bnahmad15Parrots (IOI11_parrots)C++17
0 / 100
9 ms2040 KiB
#include "encoder.h" #include "encoderlib.h" //#include "grader.h" #include <bits/stdc++.h> using namespace std; void encode(int N, int M[]){ int tmp = 7; while (tmp > 0){ cout<<tmp%2; tmp/=2; } cout<<endl; for(int i = 0;i < N;i++){ for(int j = 0;j<8;j++){ if(M[i] & (1<<j)){ int tmp = i; tmp = (tmp<<3) | j; send(tmp); } } } }
#include "decoder.h" #include "decoderlib.h" //#include "grader.h" #include <bits/stdc++.h> using namespace std; int ar[100]; void decode(int N, int L, int X[]){ for(int i = 0;i<N;i++){ ar[i] = 0; } for(int i = 0;i<L;i++){ int p = X[i]; p = (p>>3); int pos = 0; for(int j = 0;j<3;j++){ if(X[i] & (1<<j)) pos |= (1<<j); } ar[p] |= (1<<pos); } for(int i = 0;i<N;i++){ output(ar[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...