oj.uz

Submission #796296

# Submission time Handle Problem Language Result Execution time Memory
796296 2023-07-28T09:00:08 Z khshg Parrots (IOI11_parrots) C++14
0 / 100
 1194 ms 26816 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

const int BASE = 3333;
int LEN;

struct BIGNUM {
	vector<int> d;
}dp[5 * 64][256];

BIGNUM add(const BIGNUM& A, const BIGNUM& B) {
	BIGNUM res;
	int C = 0;
	for(int i = 0; i < max((int)A.d.size(), (int)B.d.size()) || C; ++i) {
		int cur = C;
		if(i < (int)A.d.size()) cur += A.d[i];
		if(i < (int)B.d.size()) cur += B.d[i];
		C = cur >= BASE;
		if(C) cur -= BASE;
		res.d.push_back(cur);
	}
	return res;
}

BIGNUM sub(BIGNUM A, const BIGNUM& B) {
	int C = 0;
	for(int i = 0; i < (int)B.d.size() || C; ++i) {
		A.d[i] -= C + (i < (int)B.d.size() ? B.d[i] : 0);
		C = A.d[i] < 0;
		if(C) A.d[i] += BASE;
	}
	while((int)A.d.size() && A.d.back() == 0) A.d.pop_back();
	return A;
}

BIGNUM mul(const int& A, const BIGNUM& B) {
	BIGNUM res;
	int C = 0;
	for(int i = 0; i < (int)B.d.size() || C; ++i) {
		int cur = C;
		if(i < (int)B.d.size()) cur += A * B.d[i];
		C = cur / BASE;
		res.d.push_back(cur - C * BASE);
	}
	return res;
}

bool cmp(const BIGNUM& A, const BIGNUM& B) {
	if((int)A.d.size() != (int)B.d.size()) return (int)A.d.size() < (int)B.d.size();
	for(int i = (int)A.d.size(); i >= 0; ++i) {
		if(A.d[i] != B.d[i]) return A.d[i] < B.d[i];
	}
	return 0;
}
 
void encode(int N, int M[]) {
	LEN = 5 * N;
	for(int i = 0; i < 256; ++i) dp[0][i].d = {1};// ONE
	for(int i = 1; i < LEN; ++i) dp[i][0].d = {1};// ONE
	for(int i = 1; i < LEN; ++i) {
		for(int j = 1; j < 256; ++j) {
			dp[i][j] = add(dp[i][j - 1], dp[i - 1][j]);
		}
	}
	BIGNUM val, pwi;
	pwi.d = {1};
	for(int i = 0; i < N; ++i) {
		val = add(val, mul(M[i], pwi));
		if(i + 1 < N) pwi = mul(256, pwi);
	}
	for(int i = LEN - 1; i >= 0; --i) {
		int L = 0, R = 255;
		while(L < R) {
			int M = (L + R) / 2;
			if(cmp(dp[i][M], val)) {
				L = M + 1;
			} else {
				R = M;
			}
		}
		send(L);
		if(L) val = sub(val, dp[i][L - 1]);
	}
}

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

const int BASE = 3333;
int LEN;

struct BIGNUM {
	vector<int> d;
}dp[5 * 64][256];

BIGNUM add(const BIGNUM& A, const BIGNUM& B) {
	BIGNUM res;
	int C = 0;
	for(int i = 0; i < max((int)A.d.size(), (int)B.d.size()) || C; ++i) {
		int cur = C;
		if(i < (int)A.d.size()) cur += A.d[i];
		if(i < (int)B.d.size()) cur += B.d[i];
		C = cur >= BASE;
		if(C) cur -= BASE;
		res.d.push_back(cur);
	}
	return res;
}

BIGNUM sub(BIGNUM A, const BIGNUM& B) {
	int C = 0;
	for(int i = 0; i < (int)B.d.size() || C; ++i) {
		A.d[i] -= C + (i < (int)B.d.size() ? B.d[i] : 0);
		C = A.d[i] < 0;
		if(C) A.d[i] += BASE;
	}
	while((int)A.d.size() && A.d.back() == 0) A.d.pop_back();
	return A;
}

BIGNUM mul(const int& A, const BIGNUM& B) {
	BIGNUM res;
	int C = 0;
	for(int i = 0; i < (int)B.d.size() || C; ++i) {
		int cur = C;
		if(i < (int)B.d.size()) cur += A * B.d[i];
		C = cur / BASE;
		res.d.push_back(cur - C * BASE);
	}
	return res;
}

bool cmp(const BIGNUM& A, const BIGNUM& B) {
	if((int)A.d.size() != (int)B.d.size()) return (int)A.d.size() < (int)B.d.size();
	for(int i = (int)A.d.size(); i >= 0; ++i) {
		if(A.d[i] != B.d[i]) return A.d[i] < B.d[i];
	}
	return 0;
}
 
void decode(int N, int L, int X[]) {
	LEN = 5 * N;
	sort(X, X + L);
	for(int i = 0; i < 256; ++i) dp[0][i].d = {1};// ONE
	for(int i = 1; i < LEN; ++i) dp[i][0].d = {1};// ONE
	for(int i = 1; i < LEN; ++i) {
		for(int j = 1; j < 256; ++j) {
			dp[i][j] = add(dp[i][j - 1], dp[i - 1][j]);
		}
	}
	BIGNUM val;
	for(int i = LEN - 1; i >= 0; --i) {
		for(int j = 0; j < X[i]; ++j) val = add(val, dp[i][j]);
	}
	vector<BIGNUM> p(N);
	p[0].d = {1};
	for(int i = 1; i < N; ++i) {
		p[i] = mul(256, p[i - 1]);
	}
	vector<int> ans;
	for(int i = N - 1; i >= 0; --i) {
		int L = 0, R = 255;
		while(L < R) {
			int M = (L + R + 1) / 2;
			if(cmp(val, mul(M, p[i]))) {
				R = M - 1;
			} else {
				L = M;
			}
		}
		ans.push_back(L);
		val = sub(val, mul(L, p[i]));
	}
	for(int i = 0; i < N; ++i) {
		cout << ans[N - 1 - i] << '\n';
	}
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 5460 KB Hacked
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 5460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 5460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 5460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 59 ms 7504 KB Execution killed with signal 11
2 Runtime error 17 ms 12116 KB Execution killed with signal 6
3 Runtime error 18 ms 12536 KB Execution killed with signal 6
4 Runtime error 49 ms 19740 KB Execution killed with signal 11
5 Runtime error 160 ms 24588 KB Execution killed with signal 6
6 Runtime error 710 ms 26580 KB Execution killed with signal 6
7 Incorrect 1194 ms 26816 KB Hacked