Submission #1316014

#TimeUsernameProblemLanguageResultExecution timeMemory
1316014tsetsenbilegParrots (IOI11_parrots)C++20
17 / 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 t = (i << 4) | (j << 1) | (M[i] & (1 << j));
      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), part = 0;
    for (int j = 1; j < 4; j++) {
      if ((1 << j) & b) part |= (1 << (j));
    }
    part >>= 1;
    if (b & 1) 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...