제출 #300954

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

encoder

#include "encoder.h"
#include "encoderlib.h"

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

void encode(int n, int arr[]){
	vector<int> bits;
	
	rep(x,0,n){
		int curr=arr[x];
		rep(y,0,8){
			bits.push_back(curr&1);
			curr>>=1;	
		}	
	}
	
	rep(x,0,n*8){
		send(x<<1|bits[x]);
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

void decode(int n, int l, int arr[]){
	vector<int> bits(l);
	
	rep(x,0,l){
		bits[arr[x]>>1]=arr[x]&1;	
	}
	
	reverse(all(bits));
	rep(x,0,n){
		int curr=0;
		rep(y,0,8){
			curr|=bits.back()<<y;
			bits.pop_back();	
		}
		
		output(curr);
	}
}

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