oj.uz

답안 #351984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
351984 2021-01-20T10:26:54 Z kylych03 앵무새 (IOI11_parrots) C++14
99 / 100
 47 ms 1676 KB 
#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);
  	
}
#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(i=0; i<256; i++){
  		cnt[i]=0;
  		res[i]=0;
	  	f[i]=0;
  	}
  	for(int i = 0; i < L; i++){
  		cnt[X[i]]++;	
  	}
	for(i=0; i<256; i++){ 
	  	
		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++)
		res[i]^=xrr;
	for(i=0; i<N; i++) { 
		//cout << (res[i] ) << " ";
	    output(res[i] );
	}

}
/*
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
*/

Compilation message

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:31:9: warning: 'xrr' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |   res[i]^=xrr;
      |   ~~~~~~^~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 932 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1132 KB Output is correct
2 Correct 9 ms 1264 KB Output is correct
3 Correct 12 ms 1324 KB Output is correct
4 Correct 12 ms 1320 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1260 KB Output is correct
2 Correct 9 ms 1336 KB Output is correct
3 Correct 13 ms 1268 KB Output is correct
4 Correct 12 ms 1320 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1260 KB Output is correct
2 Correct 13 ms 1364 KB Output is correct
3 Correct 15 ms 1144 KB Output is correct
4 Correct 21 ms 1256 KB Output is correct
5 Correct 23 ms 1152 KB Output is correct
6 Correct 23 ms 1316 KB Output is correct

Subtask #5
18.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 12 ms 1320 KB Output is partially correct - P = 5.750000
2 Partially correct 22 ms 1156 KB Output is partially correct - P = 5.718750
3 Partially correct 24 ms 1308 KB Output is partially correct - P = 5.696970
4 Partially correct 36 ms 1676 KB Output is partially correct - P = 5.920000
5 Partially correct 41 ms 1444 KB Output is partially correct - P = 5.750000
6 Partially correct 47 ms 1536 KB Output is partially correct - P = 5.841270
7 Partially correct 44 ms 1448 KB Output is partially correct - P = 5.906250