Submission #345815

#	Time	Username	Problem	Language	Result	Execution time	Memory
345815		casperwang	Parrots (IOI11_parrots)	C++14	98 / 100	10 ms	1700 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
 
void encode(int N, int M[]) {
  int cnt = 0;
  for (int i = 0; i < N; i++)
    cnt += __builtin_popcount(M[i]);
  bool flag = (cnt > 4*N+2);
  if (flag) for (int i = 0; i < 4; i++) send(0);
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 4; j++) {
      int v = ((M[i]&(1<<(j*2)))>0) + 2*((M[i]&(1<<(j*2+1)))>0);
      if (flag) v = 3-v;
      while (v--) send(i*4 + j);
    }
  }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
 
void decode(int N, int L, int X[]) {
  vector <int> cnt(1<<8);
  vector <int> ans(N);
  for (int i = 0; i < L; i++)
    cnt[X[i]]++;
  bool flag = cnt[0] >= 4;
  if (flag) {
    for (int i = 0; i < N; i++)
      ans[i] = (1<<8)-1;
    cnt[0] -= 4;
  }
  for (int i = 0; i < L; i++) {
    if (!cnt[X[i]]) continue;
    cnt[X[i]]--;
    int id = X[i] / 4, k = X[i] % 4;
    if (flag) {
      ans[id] -= (1<<(k*2));
    } else {
      ans[id] += (1<<(k*2));
    }
  }
  for (int i = 0; i < N; i++)
    output(ans[i]);
}

• Subtask 1: 17 / 17
• Subtask 2: 17 / 17
• Subtask 3: 18 / 18
• Subtask 4: 29 / 29
• Subtask 5: 17 / 19