제출 #1016254

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

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

void print1(int a){
  cout << bitset<8>(a) << " ";
}

void encode(int N, int M[])
{
  FOR(i,0,N){
    int num = i << 3;
    int val = M[i];
    int arr[3];
    FOR(i,0,3){
      arr[i] = (val%8);
      val = val >> 3;
    }
    FOR(i,0,3){
      FOR(j,0,1<<i){
        // print1(num+arr[i]);
        send(num+arr[i]);
      }
    }
    // cout << endl;
  }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

void print(int a){
  cout << bitset<8>(a) << " ";
}

void decode(int N, int L, int X[])
{
  vvi arr(N,vi(8,0));
  vi ans(N,0);
  // sort(X,X+L);
  // cout<<"############" << endl;
  FOR(i,0,L){
    // print(X[i]);
    // cout << "pos - " << (X[i]>>3) << " val - ";
    // print(X[i]%8);
    // cout << endl;
    arr[X[i]>>3][X[i]%8] ++;
  }
  // cout<<"############" << endl;

  FOR(i,0,N){
    int val = 0;
    // FOR(j,0,8)cout << arr[i][j] << " ";
    // cout << endl;
    for(int j=2;j>-1;j--){
      FOR(k,0,8){
        if(arr[i][k]>= (1<<j)){
          arr[i][k] -= (1<<j);
          val += k<<(3*j);
          break;
        }
      }
    }
    ans[i] = val;
  }

  // FOR(i,0,N)cout << i << " -> " << ans[i] << endl;
  FOR(i,0,N)output(ans[i]);
}

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