제출 #67389

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

encoder

#include "encoder.h"
#include "encoderlib.h"
#include "bits/stdc++.h"
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 

typedef pair<int,int>  pii;

const int MAX=1e5;

void encode(int N,int M[])
{
	int arr[1000];
	vector<pii> vec;
	for(int A=0;A<N;A++)
	{
		send(M[A]);
		send(M[A]);
		send(M[A]);
		vec.pb(mp(M[A],A));
	}	
	sort(vec.begin(),vec.end());
	for(int A=0;A<vec.size();A++)
		arr[vec[A].second]=A;
	for(int A=0;A<N;A++)
	{
      	assert(arr[A]<16);
		int res=A;
		for(int B=0;B<4;B++)
		{
			if(arr[A]&(1<<B))
				res+=1<<(B+4);
		}	
		send(res);
	}
	return ;
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include "bits/stdc++.h"
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 

typedef pair<int,int>  pii;

const int MAX=1e5;

void decode(int N, int L, int X[])
{
	vector<int> vec;
	map<int,int> maps;
	int res[1000]={0};
  	for(int A=0;A<L;A++)
  		maps[X[A]]++;
  	for(auto A:maps)
  		if(A.second>=3)
  			vec.pb(A.first);
  	sort(vec.begin(),vec.end());
  	for(auto A:maps)
  	{
  		assert(A.second==1 or A.second==2 or A.second==3 or A.second==4);
  	//	assert(A.second!=5);
      if(A.second==3)
  			continue;
  		int ind=0,num=0;
  		for(int B=0;B<4;B++)
  			if(A.first&(1<<B))
  				ind+=(1<<B);
  		for(int B=0;B<4;B++)
  			if(A.first&(1<<(B+4)))
  				num+=(1<<B);
//  		assert(res[ind]==0);
  		res[ind]=num;
  	}
  	for(int A=0;A<N;A++)
  		output(vec[res[A]]);
  	return ;
}

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

encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:27:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int A=0;A<vec.size();A++)
              ~^~~~~~~~~~~

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