Submission #788204

#	Time	Username	Problem	Language	Result	Execution time	Memory
788204		horiiseun	Parrots (IOI11_parrots)	C++17	81 / 100	4 ms	1072 KiB

encoder

#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;

void encode(int N, int M[]) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= 7; j++) {
			if (M[i] & (1 << j)) {
				send(i * 8 + j);
			}
		}
	}
}

decoder

#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;

void decode(int N, int L, int X[]) {
	vector<int> ans(N, 0);
	for (int i = 0; i < L; i++) {
		ans[X[i] / 8] |= (1 << (X[i] % 8));
	}
	for (int i = 0; i < N; i++) {
		output(ans[i]);
	}
}

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