Submission #1140387

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140387		Maaxle	앵무새 (IOI11_parrots)	C++20	81 / 100	2 ms	840 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>

#define range(it, a, b) for (int it = a; it < b; it++)
#define invr(it, a, b) for (int it = a; it >= b; it--)
#define all(x) begin(x), end(x)
#define ll long long
#define ull unsigned long long
#define ld long double
#define INF64 ((ll) 1 << 62)
#define INF32 (1 << 30)
#define mset multiset
#define uset unordered_set
#define umap unordered_map 
#define pqueue priority_queue 
#define ptr(A) shared_ptr<A>
#define v(x) vector<x>

using namespace std;

void encode(int N, int M[]) {
  range(i, 0, N) {
    int x = M[i];
    int aux = (i << 3);
    invr(p, 7, 0) {
      while (x >= (1 << p))
        send(aux + p), x -= (1 << p);
    }
  }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>

#define range(it, a, b) for (int it = a; it < b; it++)
#define invr(it, a, b) for (int it = a; it >= b; it--)
#define all(x) begin(x), end(x)
#define ll long long
#define ull unsigned long long
#define ld long double
#define INF64 ((ll) 1 << 62)
#define INF32 (1 << 30)
#define mset multiset
#define uset unordered_set
#define umap unordered_map 
#define pqueue priority_queue 
#define ptr(A) shared_ptr<A>
#define v(x) vector<x>

using namespace std;

void decode(int N, int L, int X[]) {
  v(int) ans (N);

  range(i, 0, L) {
    int ii = (X[i] >> 3);
    int p = X[i] & 7;
    ans[ii] += (1 << p);
  }

  range(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