Submission #1168782

#TimeUsernameProblemLanguageResultExecution timeMemory
11687828pete8Parrots (IOI11_parrots)C++20
81 / 100
2 ms840 KiB
#include "encoder.h"
#include "encoderlib.h"
#include<iostream>
using namespace std;
void print(int x){
  for(int i=0;i<10;i++){
    if(x&(1LL<<i))cout<<1;
    else cout<<0;
  }
  cout<<'\n';
}
void encode(int N, int M[]){
  int c=0;
  for(int i=0; i<N; i++){
    for(int j=0;j<8;j++){
      if(M[i]&(1LL<<j))send((i*8)+j);
    }
  }
}
/*
=0->255
0 0 0 0 0 0 0
bit =32x8


*/
#include "decoder.h"
#include "decoderlib.h"
#include<iostream>
#include<vector>
using namespace std;
#define all(x) x.begin(),x.end()
#define pb push_back
void printS(int x){
  for(int i=0;i<10;i++){
    if(x&(1LL<<i))cout<<1;
    else cout<<0;
  }
  cout<<'\n';
}
void decode(int N, int L, int X[]){
  vector<int>v;
  for(int i=0;i<L;i++)v.pb(X[i]);
  sort(all(v));
  vector<int>ans(N,0);
  for(int i=0;i<L;i++){
    ans[v[i]/8]+=(1LL<<(v[i]%8));
  }
  for(int i=0;i<N;i++)output(ans[i]);
}
/*
=0->255
0 0 0 0 0 0 0
bit =32x8=
*/
#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...