제출 #61079

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
61079		mhnd	앵무새 (IOI11_parrots)	C++14	81 / 100	13 ms	3064 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;
 
void encode(int N, int M[]) {
	if(N<=32){
		for(int i=0;i<N;i++)
			for(int k=0;k<8;k++)
				if((M[i]>>k)&1)send(N*k+i);
	}else{
		for(int i=0;i<32;i++){
			for(int k=0;k<8;k++){
				if(i+32<N){
					if((M[i]>>k)&1 && (M[i+32]>>k)){
						send(32*k+i);
						send(32*k+i);
					}else if((M[i+32]>>k)&1){
						send(32*k+i);
						send(32*k+i);
						send(32*k+i);
					}else if((M[i]>>k)&1)send(32*k+i);
				}else if((M[i]>>k)&1)send(32*k+i);
			}
		}
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;
 
int num[65],f[256];
void decode(int N, int L, int X[]){
	memset(num,0,sizeof(num));
	memset(f,0,sizeof(f));
	if(N<=32){
		for(int i=0;i<L;i++)num[X[i]%N] += (1<<(X[i]/N));
	}else{
		for(int i=0;i<L;i++)f[X[i]]++;
		for(int i=0;i<L;i++){
			if(f[X[i]]==3){
				num[X[i]%32+32] |= (1<<(X[i]/32));
			}else if(f[X[i]]=2){
				num[X[i]%32] |= (1<<(X[i]/32));
				num[X[i]%32+32] |= (1<<(X[i]/32));
			}else num[X[i]%32] |= (1<<(X[i]/32));
		}
	}
	for(int i=0;i<N;i++)output(num[i]);
}

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

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:24:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    }else if(f[X[i]]=2){
             ~~~~~~~^~

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