제출 #123853

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

encoder

#include "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
#define MP make_pair
#define F first
#define S second
#define pb push_back
#define MEM(i,j) memset(i,j,sizeof i)
#define ET cout << "\n"
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void encode(int N, int M[])
{
	for(int i=0;i<N;++i)
	{
		send((M[i]>>6)|12|i<<4);
		send((M[i]>>4&3)|8|i<<4);
		send((M[i]>>2&3)|4|i<<4);
		send((M[i]&3)|i<<4);
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
#define MP make_pair
#define F first
#define S second
#define pb push_back
#define MEM(i,j) memset(i,j,sizeof i)
#define ET cout << "\n"
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void decode(int N, int L, int X[])
{
	int ans[64]={};
	for(int i=0;i<L;++i)
		ans[X[i]>>4]|=(X[i]&3)<<(X[i]>>1&6);
	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