Submission #1000063

#TimeUsernameProblemLanguageResultExecution timeMemory
1000063NintsiChkhaidzeParrots (IOI11_parrots)C++17
81 / 100
3 ms3028 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back #include "encoder.h" #include "encoderlib.h" //#include "parrotslib.h" using namespace std; const int MN = 3e5 + 5; int xx[300005]; int vl[45][15]; int get(int b,int idx){ return vl[idx][b]; // return idx * 10 + b; } void fill(){ int p = 0; for (int i=0;i<32;i++){ for (int j=0;j<8;j++){ vl[i][j] = p++; } } } void encode(int N, int M[]){ fill(); int id = -1; for (int i = 0; i < N; i++){ int x = M[i]; for (int j = 7; j >= 0; j--){ if (((x >> j) & 1)){ xx[++id] = get(j,i); } } } for (int i=0;i<=id;i++) send(xx[i]); }
#include <bits/stdc++.h> #include "decoder.h" #include "decoderlib.h" #define ll long long #define pb push_back //#include "parrotslib.h" using namespace std; //const int MN = 3e5 + 5; int yy[300005],vl2[45][15]; pair <int,int> rev[315]; void fill2(){ int p = 0; for (int i=0;i<32;i++){ for (int j=0;j<8;j++){ vl2[i][j] = p; rev[p] = {i,j}; p++; } } } void decode(int N, int L, int X[]){ fill2(); for (int i=0;i<N;i++) yy[i] = 0; for (int i = 0; i < L; i++){ int x = X[i]; int A = rev[x].second,B = rev[x].first; yy[B] |= (1<<A); } for (int i=0;i<N;i++) output(yy[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...