제출 #351977

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

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
  	int i, xr, rs = 1e9;
  	for(int t = 0 ; t < 256; t++){
  		int cnt = 0;
		  for(i = 0 ; i < N; i++){
			int f = (M[i] ^ t);
			for(int j= 0 ; j < 8 ;j++){
				if(( f>>j )& 1){ 
					if(j%2==1)
						cnt++;
					cnt++;	
				}
			}
		}
		if(cnt  < rs){
			rs =  cnt;
			xr = t;	
		}
  	}
  	
	send(xr);
	send(xr);
	send(xr);
	send(xr);	
   	
	for(i = 0 ; i < N; i++)
  		M[i]=( M[i] ^ xr);
  	
  	for(i=0; i<N; i++){
			int packet=(i<<2);
			for(int j= 0 ; j < 8 ;j++){
				  if(( M[i]>>j )&1){
				  	if(j%2==1)
					send(packet+j/2);
					send(packet+j/2);
				}	
			}
		
  	}
  	
	//cout << endl<<" encoder - "<<xr << endl;
  	for(i = 0 ; i < N; i++)
  		M[i]=( M[i] ^ xr);
  	
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int res[256], f[256], cnt[256];
void decode(int N, int L, int X[])
{
  	int i, xrr;
  	for(int i = 0; i < L; i++){
  		cnt[X[i]]++;	
  	}
	for(i=0; i<256; i++){ 
	  	res[i]=0;
	  	f[i]=0;
		if(cnt[i] > 3){
			xrr = i;
			cnt[i] -= 4;
			break;	
		}
	}
	for(i=0; i < L; i++){
		if(!cnt[X[i]]) continue;
		cnt[X[i]]--;
		res[X[i]>>2]+=( 1<<((X[i]&3)*2));
	}
	
	for(i=0; i<N; i++) { 

	    output(res[i] ^ xrr);
	}

}
/*
50
171 119 223 130 116 138 204 99 236 198 56 135 116 106 66 64 204 242 114 11 194 251 213 251 67 145 200 57 90 108 90 61 86 69 158 229 11 141 37 7 248 77 5 85 144 17 53 159 54 7
*/

컴파일 시 표준 에러 (stderr) 메시지

encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:48:17: warning: 'xr' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |     M[i]=( M[i] ^ xr);
      |          ~~~~~~~^~~~~

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:29:12: warning: 'xrr' may be used uninitialized in this function [-Wmaybe-uninitialized]
   29 |      output(res[i] ^ xrr);
      |      ~~~~~~^~~~~~~~~~~~~~

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