Submission #1316016

#TimeUsernameProblemLanguageResultExecution timeMemory
1316016tsetsenbilegParrots (IOI11_parrots)C++20
52 / 100
2 ms824 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pr = pair<int, int>;
#define pb push_back
const int INF = 1e9+7;

void encode(int N, int M[])
{
  int i;
  for(i=0; i<N; i++) {
    // int res = 0;
    // res |= i;
    // res <<= 4;
    for (int j = 0; j < 8; j++) {
      int bit = (M[i] >> j) & 1;
      int t = (i << 4) | (j << 1) | bit;
      send(t);
    }
  }
}
  #include "decoder.h"
  #include "decoderlib.h"
  #include <bits/stdc++.h>
  using namespace std;
  using ll = long long;
  using pr = pair<int, int>;
  #define pb push_back
  const int INF = 1e9+7;

  void decode(int N, int L, int X[])
  {
    int i, b;
    vector<int> res(N);
    for(i=0; i<L; i++) {
      b = X[i];
      int ind = (b >> 4);
      int part = (b >> 1) & 7;
      int bit = b & 1;
      if (bit) res[ind] |= (1 << part);
    }
    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...