제출 #963702

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963702		Amr	앵무새 (IOI11_parrots)	C++17	52 / 100	2 ms	1564 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz size()
void encode(int N, int M[])
{
    vector<pair<ll,ll> > v;
    for(int i = 0; i < N; i++) v.push_back({M[i],i});
    sort(v.begin(),v.end());
    for(int i = 0; i < N; i++)
    {
        send(M[i]);
        send(M[i]);
    }
    for(int i = 0; i < N; i++)
    {
        send(v[i].second+i*16);
    }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz size()
const int M = 256;
ll ans[M+2];
ll freq[M+2];
void decode(int N, int L, int X[])
{
    //for(int i = 0; i < L; i++) cout << X[i] << " "; cout << endl;
    //return;
    for(int i = 0; i < M; i++) freq[i] = 0;
    for(int i = 0; i < L; i++) freq[X[i]]++;
    vector<ll> v,vv;
    for(int i = 0; i < M; i++){
    for(int j = 0 ; j < freq[i]/2; j++) v.push_back(i);
    if(freq[i]&1) vv.push_back(i);}
  //sort(v.begin(),v.end());

 // cout << v.sz << " " << vv.sz << endl; return;
  ll l = 0;
  for(int i = 0; i < N; i++)
  {
      //cout << vv[l]%16 << " " << v[i]<< endl;
      ans[vv[l++]%16] = v[i];
  }

  for(int i=0; i< N; i++) {
    output(ans[i]);
  }

}

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