제출 #500555

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500555		PoPularPlusPlus	앵무새 (IOI11_parrots)	C++17	81 / 100	3 ms	1048 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void encode(int n, int arr[]){
	for(int i = 0; i < n; i++){
		for(int j = 0; j < 8; j++){
			if(((1 << j) & arr[i]) > 0){
				send(i * 8 + j);
			}
		}
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void decode(int n, int l, int arr[]){
	int ans[n];
	memset(ans,0,sizeof ans);
	for(int i = 0; i < l; i++){
		int pos = arr[i]/8;
		int bit = arr[i] % 8;
		ans[pos] += (1 << bit);
	}
	for(int i = 0; i < n; i++)output(ans[i]);
}	

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