제출 #497280

#제출 시각아이디문제언어결과실행 시간메모리
497280FerThugGato12500앵무새 (IOI11_parrots)C++98
0 / 100
8 ms1216 KiB
#include<bits/stdc++.h>
using namespace std;
#include "encoder.h"
#include "encoderlib.h"

void haz(int x, int pos){
 //   cout<<x<<" : "<<pos<<"->"<<(x<<6)+pos<< "\n";
    send((x<<6)+pos);
}

void encode(int N, int M[])
{
    for(int i = 0; i < N; i++){
        int x = M[i];
        for(int h = 0; (1<<h)<=x; h++){
            if((x>>h)&1){
                int r=0;
                if((h>>2)&1){
                    r=4;
                    haz(h-r,i);
                }
                haz(h-r,i);
            }
        }
    }
    return;
}
#include<bits/stdc++.h>
using namespace std;
#include "decoder.h"
#include "decoderlib.h"

int num[10][200];
void decode(int N, int L, int X[])
{
  for(int i=0; i<L; i++) {
    int x = X[i];
   // cout<< x <<" -> "<<(x>>6)<<" : "<<((x|192)^192)<<"\n";
    num[(x>>6)][((x|192)^192)]++;
  }
 // cout<<"\n";
  for(int i = 0; i < N; i++){
    int x = 0;
    for(int h = 0; h < 8; h++){
        if(num[h][i]&1){
            x+=(1<<h);
        }
        //cout<<x<<" ";
        if(num[h][i]>1){
            x+=(1<<(h+4));
        }
        //cout<<x<<"\n";
    }
 //   cout<<x<<" ";
    output(x);
  }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...