제출 #60672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60672		mhnd	앵무새 (IOI11_parrots)	C++14	0 / 100	6 ms	1384 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;

void encode(int N, int M[]) {
	for(int i=0;i<N;i++)
		for(int j=0;j<M[i];j++)send(M[i]);
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;

pair<int,int> num[256];
void decode(int N, int L, int X[]){
	for(int i=0;i<L;i++)num[X[i]].first++;
	for(int i=0;i<256;i++)num[i].second = i;
	sort(num,num+256);
	for(int i=0;i<256;i++){
		if(!num[i].first)continue;
		output(num[i].second);
	}
}

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