제출 #1091925

#제출 시각아이디문제언어결과실행 시간메모리
1091925BarbarBrick앵무새 (IOI11_parrots)C++14
34 / 100
1 ms1316 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int N, int M[])
{
    for (int i = 0; i < N; i++)
    {
        int message = (i << 8) + M[i];
        send(message);
    }
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void decode(int N, int L, int X[])
{
  vector<int> vec;
  int mask = (1 << 8) - 1;
  for (int i = 0; i < L; i++)
  {
    int b = X[i];
    vec.push_back(b);
  }
  sort(vec.begin(), vec.end());
  for (int i = 0; i < L; i++)
  {
    output(vec[i] & mask);
  }
}
#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...