제출 #71126

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
71126		AlphaRazra	앵무새 (IOI11_parrots)	C++14	88 / 100	18 ms	3072 KiB

encoder

#include<bits/stdc++.h>
#define mp make_pair
#define fs first
#define sc second
#define pb push_back
#define debug(x) cout<<#x<<" = "<<(x)<<endl
#define mod 998244353
#define INF 1e18
#include "encoder.h"
#include "encoderlib.h"

using namespace std;


void encode(int N, int M[]){

	for(int i = 0; i < N; i++){
		for(int j = 0; j < 8; j++){
			int now = (1 << j);
			int idx = 8 * i + j;
			if(i >= 32){
				idx = 8 * (i - 32) + j;
			}
			if((now & M[i]) > 0){
				if(i < 32){
					send(idx);
				}else{
					send(idx);
					send(idx);
				}
			}
		}
	}

}

decoder

#include<bits/stdc++.h>
#define mp make_pair
#define fs first
#define sc second
#define pb push_back
#define debug(x) cout<<#x<<" = "<<(x)<<endl
#define mod 998244353
#define INF 1e18
#include "decoder.h"
#include "decoderlib.h"
using namespace std;



void decode(int N, int L, int X[]){
	int ans[65];
	int nyak[300];
	memset(ans, 0, sizeof(ans));
	memset(nyak, 0, sizeof(nyak));

	for(int i = 0; i < L; i++){
		nyak[X[i]]++;
	}

	for(int i = 0; i < 256; i++){
		if(nyak[i] == 0){
			continue;
		}else if(nyak[i] == 1){
			int pos = i / 8;
			int idx = i % 8;
			ans[pos] = ans[pos] + (1 << idx);
		}else if(nyak[i] == 2){
			int pos = (i / 8) + 32;
			int idx = i % 8;
			ans[pos] = ans[pos] + (1 << idx);
		}else{
			int pos = i / 8;
			int idx = i % 8;
			ans[pos] = ans[pos] + (1 << idx);

			pos = (i / 8) + 32;
			idx = i % 8;
			ans[pos] = ans[pos] + (1 << idx);
		}
	}

	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: 7 / 19