제출 #1279398

#제출 시각아이디문제언어결과실행 시간메모리
1279398darele앵무새 (IOI11_parrots)C++20
0 / 100
2 ms836 KiB
#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[])
{
  // Subtarea 1 y 2

  // for (int i = 0; i < N; i++) {
  //   send(M[i] + 256 * i);
  // }

  // Subtarea 1, 2 y 3
  for(int i = 0; i < N; i++) {
    for (int j = 0; j < i + 1; j++) {
      send((M[i] + i + 1) % 256);
    }
  }
}
#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
#include <vector>
#include <iostream> // for debugging

using namespace std;

void decode(int N, int L, int X[])
{
    // Subtarea 1 y 2
    // sort(X, X + L);
    // for (int i = 0; i < N; i++) {
    //     output(X[i] % 256);
    // }

    // Subtarea 1, 2 y 3
    vector<int> ans(N + 1);
    vector<int> rep(256, 0);
    for (int i = 0; i < L; i++) {
        rep[X[i]]++;
    }
    for (int i = 0; i < 256; i++) {
        if (rep[i] == 0) continue;
        ans[rep[i]] = (i - rep[i] + 256) % 256;
    }
    for (int i = 1; i < ans.size(); i++) {
        // cout << ans[i] << " ";
        output(ans[i]);
    }
    // cout << endl;
}
#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...