제출 #870791

#제출 시각아이디문제언어결과실행 시간메모리
87079112345678앵무새 (IOI11_parrots)C++17
52 / 100
1 ms1568 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>

using namespace std;

void encode(int N, int M[])
{
  for(int i=0; i<N; i++) 
  {
    for (int j=0; j<4; j++)
    {
        bitset<8> b;
        int tmp=16*i;
        //b=tmp;
        //cout<<b<<'\n';
        tmp+=j*4;
        //b=tmp;
        //cout<<b<<'\n';
        tmp+=(M[i]&((1<<(2*j))+(1<<(2*j+1))))>>(2*j);
        //b=tmp;
        //cout<<b<<'\n';
        send(tmp);
        
    }
  }
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>

using namespace std;

void decode(int N, int L, int X[])
{
    vector<int> ans(N);
    for (int i=0; i<L; i++)
    {
        int id=X[i]/16, k=(X[i]/4)%4;
        //cout<<id<<' '<<k<<' '<<(X[i]/2)%2<<' '<<X[i]%2<<'\n';
        ans[id]+=(X[i]%2)<<(2*k);
        ans[id]+=((X[i]/2)%2)<<(2*k+1);
    }
    for (int i=0; i<N; i++) output(ans[i]);
}
/*
10
1 1 2 1 2 3 1 7 10 9
*/
#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...