Submission #230371

#	Time	Username	Problem	Language	Result	Execution time	Memory
230371		Bruteforceman	Parrots (IOI11_parrots)	C++11	98 / 100	19 ms	2048 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include "bits/stdc++.h"
using namespace std;
namespace {
vector <vector <int>> can;
vector <int> v;
int cnt;

void backtrack(int cur, int last) {
  if(can.size() > 256) return ;
  if(cur == 0) {
    can.push_back(v);
    ++cnt;
    return ;
  }
  for(int i = last; i < 4; i++) {
    v.push_back(i);
    backtrack(cur - 1, i);
    v.pop_back();
  }
}
}
void encode(int N, int M[])
{
  for(int i = 1; i <= 7; i++) {
    backtrack(i, 0);
  }
  int i;
  for(i=0; i<N; i++) {
    vector <int> v = can[M[i]];
    for(int j : v) {
      send(4 * i + j);
    }
  }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include "bits/stdc++.h"
using namespace std;
namespace {
vector <vector <int>> can;
vector <int> v;
int cnt;

void backtrack(int cur, int last) {
  if(can.size() > 256) return ;
  if(cur == 0) {
    can.push_back(v);
    ++cnt;
    return ;
  }
  for(int i = last; i < 4; i++) {
    v.push_back(i);
    backtrack(cur - 1, i);
    v.pop_back();
  }
}
}
void decode(int N, int L, int X[])
{
  for(int i = 1; i <= 7; i++) {
    backtrack(i, 0);
  }
  vector <int> v[N + 1];
  for(int i = 0; i < L; i++) {
    v[X[i] / 4].push_back(X[i] % 4);
  }
  for(int i = 0; i < N; i++) {
    sort(v[i].begin(), v[i].end());
    for(int j = 0; j < can.size(); j++) {
      if(can[j] == v[i]) {
        output(j);
        break;
      }
    }
  }
}

Compilation message (stderr)

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:35:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j = 0; j < can.size(); j++) {
                    ~~^~~~~~~~~~~~

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