华容道高性能计算引擎
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

160 lines
4.4 KiB

#include <iostream>
#include <algorithm>
#include <unordered_map>
#include "all_cases.h"
#include "mark.h"
// TODO: try to remove: `0` `O` `I` `l`
const uint32_t ALL_CASES_NUMBER = 29334498;
const uint32_t ALL_CASES_INDEX[16] = {
2942906, 2260392, 2942906, 0,
2322050, 1876945, 2322050, 0,
2322050, 1876945, 2322050, 0,
2942906, 2260392, 2942906, 0,
};
const uint32_t ALL_CASES_OFFSET[16] = {
0, 2942906, 5203298, 8146204,
8146204, 10468254, 12345199, 14667249,
14667249, 16989299, 18866244, 21188294,
21188294, 24131200, 26391592, 29334498,
};
std::string code_to_string(uint32_t short_code) {
if (short_code >= ALL_CASES_NUMBER) {
throw std::range_error("short code out of range");
}
std::string result(5, '\0'); // short code length 5
for (int i = 0; i < 5; ++i) {
uint8_t bit = short_code % 36;
short_code = (short_code - bit) / 36;
if (bit < 10) {
result[4 - i] = char(bit + 48); // 0 ~ 9
} else {
result[4 - i] = char(bit + 55); // A ~ Z
}
}
return result;
}
uint32_t code_from_string(const std::string &short_code) {
if (short_code.length() != 5) {
throw std::runtime_error("invalid short code");
}
uint32_t result = 0;
for (auto &bit : short_code) {
result *= 36;
if (bit >= '0' && bit <= '9') {
result += bit - 48; // 0 ~ 9
} else if (bit >= 'A' && bit <= 'Z') {
result += bit - 55; // A ~ Z
} else if (bit >= 'a' && bit <= 'z') {
result += bit - 87; // a ~ z
} else {
throw std::runtime_error("invalid short code");
}
}
if (result >= ALL_CASES_NUMBER) {
throw std::range_error("short code out of range");
}
return result;
}
uint64_t unzip_short_code(uint32_t short_code) {
auto a = AllCases(); // load basic ranges
std::cout << "short code: " << short_code << std::endl;
uint32_t head = 0;
for (; head < 16; ++head) {
if (short_code < ALL_CASES_INDEX[head]) {
break;
}
short_code -= ALL_CASES_INDEX[head];
}
std::cout << "head: " << head << std::endl;
std::cout << "short code: " << short_code << std::endl;
uint32_t prefix = 0;
for (; prefix < 256; ++prefix) {
if (short_code < SHORT_CODE_MARK[head][prefix]) {
break;
}
short_code -= SHORT_CODE_MARK[head][prefix];
}
std::cout << "prefix: " << prefix << std::endl;
std::cout << "short code: " << short_code << std::endl;
uint32_t range;
for (int i = 0; i < BASIC_RANGES_INDEX[prefix]; ++i) {
range = a.basic_ranges[i + BASIC_RANGES_OFFSET[prefix]];
if (AllCases::check_case(head, range)) {
if (short_code == 0) {
break;
}
--short_code;
}
}
return (uint64_t)head << 32 | AllCases::binary_reverse(range);
}
int main() {
// auto ret_code = unzip_short_code(14323231);
// printf("result -> %08lX\n", ret_code);
// return 0;
auto a = AllCases();
// a.find_all_cases();
// std::vector<uint64_t> all_cases;
// for (int n = 0; n < 16; ++n) {
// uint64_t prefix = (uint64_t)n << 32;
// for (auto &code : a.all_cases[n]) {
// all_cases.emplace_back(prefix | code);
// }
// }
//
// std::unordered_map<uint64_t, uint32_t> all_cases_dict;
// for (int i = 0; i < all_cases.size(); ++i) {
// all_cases_dict[all_cases[i]] = i;
// }
// uint32_t short_code = 14323231;
// printf("%09lX\n", all_cases[0]);
// printf("%09lX\n", all_cases[short_code]);
// printf("%09lX\n", all_cases[ALL_CASES_NUMBER - 1]);
// std::cout << code_to_string(all_cases_dict[0x6EC0F8800]) << std::endl;
// std::cout << code_to_string(all_cases_dict[0x1A9BF0C00]) << std::endl;
// std::cout << code_to_string(all_cases_dict[0x4FEA13400]) << std::endl;
// std::cout << code_to_string(14323231) << std::endl;
// std::cout << code_from_string("8IzVj") << std::endl;
// zip short code
// valid code -> short code
// head -> offset_1
// prefix -> offset_2
// uint64_t code = 0x4FEA13400;
// head_offset = code >> 32;
uint32_t offset[16];
uint32_t sum = 0;
for (int i = 0; i < 16; ++i) {
offset[i] = sum;
sum += ALL_CASES_INDEX[i];
}
for (int i = 0; i < 16; ++i) {
std::cout << offset[i] << ", ";
}
return 0;
}