Submission #536341

#	Time	Username	Problem	Language	Result	Execution time	Memory
536341		skittles1412	Parrots (IOI11_parrots)	C++17	Compilation error	0 ms	0 KiB

encoder

#include "bits/extc++.h"
 
using namespace std;
 
#define long uint64_t
#define sz(x) int((x).size())
 
struct Int {
	bool o = false;
	long x = 0;
};
 
constexpr Int operator+(Int a, Int b) {
	constexpr long mask = long(1) << 63;
	return {a.o || b.o || (!!(a.x & mask) && !!(b.x & mask)), a.x + b.x};
}
 
bool operator>(Int a, long b) {
	if(a.o) {
		return false;
	}
	return a.x > b;
}
 
const int maxn = 40;
 
static constexpr struct Helper {
	Int dp[maxn + 1][32];
 
	constexpr Helper(): dp {} {
		for(int i = 0; i < 32; i++) {
			dp[0][i].x = 1;
		}
		for(int i = 1; i <= maxn; i++) {
			for(int j = 0; j < 32; j++) {
				for(int k = j; k < 32; k++) {
					dp[i][j] = dp[i][j] + dp[i - 1][k];
				}
			}
		}
	}
} pcomp;
 
vector<int> ans;
 
void gen(int n, long x) {
	if(n) {
		int prev = sz(ans) ? ans.back() : 0;
		for(int j = prev; j < 32; j++) {
			if(pcomp.dp[n - 1][j] > x) {
				ans.push_back(j);
				gen(n - 1, x);
				return;
			}
			x = x - pcomp.dp[n - 1][j].x;
		}
	}
}
 
vector<int> gen(long x) {
	ans.clear();
	gen(maxn, x);
	return ans;
}
 
long from(const vector<int> &arr) {
	assert(sz(arr) == maxn);
	long ans = 0;
	for(int i = 0; i < maxn; i++) {
		for(int j = i ? arr[i - 1] : 0; j < arr[i]; j++) {
			ans = ans + pcomp.dp[maxn - i - 1][j].x;
		}
	}
	return ans;
}
 
void encode(int n, int arr[]) {
	for(int i = 0; i < n; i += 8) {
		long chash = 0;
		for(int j = i; j < min(n, i + 8); j++) {
			if(j < n) {
				chash |= long(arr[j]) << ((j - i) << 3);
			}
		}
		auto cur = gen(chash);
		int iters = 5 * (min(n, i + 8) - i);
		for(int j = maxn - iters; j < maxn; j++) {
			send(((i >> 3) << 5) | cur[j]);
		}
	}
}

decoder

#include "bits/extc++.h"
 
using namespace std;
 
#define long uint64_t
#define sz(x) int((x).size())
 
struct Int {
	bool o = false;
	long x = 0;
};
 
constexpr Int operator+(Int a, Int b) {
	constexpr long mask = long(1) << 63;
	return {a.o || b.o || (!!(a.x & mask) && !!(b.x & mask)), a.x + b.x};
}
 
bool operator>(Int a, long b) {
	if(a.o) {
		return false;
	}
	return a.x > b;
}
 
const int maxn = 40;
 
static constexpr struct Helper {
	Int dp[maxn + 1][32];
 
	constexpr Helper(): dp {} {
		for(int i = 0; i < 32; i++) {
			dp[0][i].x = 1;
		}
		for(int i = 1; i <= maxn; i++) {
			for(int j = 0; j < 32; j++) {
				for(int k = j; k < 32; k++) {
					dp[i][j] = dp[i][j] + dp[i - 1][k];
				}
			}
		}
	}
} pcomp;
 
vector<int> ans;
 
void gen(int n, long x) {
	if(n) {
		int prev = sz(ans) ? ans.back() : 0;
		for(int j = prev; j < 32; j++) {
			if(pcomp.dp[n - 1][j] > x) {
				ans.push_back(j);
				gen(n - 1, x);
				return;
			}
			x = x - pcomp.dp[n - 1][j].x;
		}
	}
}
 
vector<int> gen(long x) {
	ans.clear();
	gen(maxn, x);
	return ans;
}
 
long from(const vector<int> &arr) {
	assert(sz(arr) == maxn);
	long ans = 0;
	for(int i = 0; i < maxn; i++) {
		for(int j = i ? arr[i - 1] : 0; j < arr[i]; j++) {
			ans = ans + pcomp.dp[maxn - i - 1][j].x;
		}
	}
	return ans;
}

void decode(int n, int m, int arr[]) {
	vector<int> message[n];
	for(int i = 0; i < m; i++) {
		message[arr[i] >> 5].push_back(arr[i] & 31);
	}
	for(int i = 0; i < n; i += 8) {
		auto &cm = message[i / 8];
		while(sz(cm) < maxn) {
			cm.insert(cm.begin(), 0);
		}
		sort(begin(cm), end(cm));
		long cur = from(cm);
		for(int j = i; j < min(n, i + 8); j++) {
			output(cur & 255);
			cur >>= 8;
		}
	}
}

Compilation message (stderr)

encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:88:4: error: 'send' was not declared in this scope
   88 |    send(((i >> 3) << 5) | cur[j]);
      |    ^~~~

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:90:4: error: 'output' was not declared in this scope
   90 |    output(cur & 255);
      |    ^~~~~~