提交记录 16003
| 提交时间 |
评测时间 |
| 2021-03-14 14:25:04 |
2021-03-14 14:25:09 |
#include <cstdint>
#include <cstring>
#define DIGIT(X) (((X) >> shift_bits) & kRadixBitMask)
constexpr uint8_t kRadixBits = 8;
constexpr size_t kMaxN = 1e8, kRadix = 1 << kRadixBits;
constexpr uint32_t kRadixBitMask = kRadix - 1;
uint32_t buffer[kMaxN], cnt[kRadix] = {0};
void sort(unsigned* arr, int n) {
uint32_t *buf_p0 = arr, *buf_p1 = buffer, *buf_pt;
for (uint8_t shift_bits = 0; shift_bits < 32; shift_bits += kRadixBits) {
memset(cnt, 0, sizeof(cnt));
for (uint32_t j = 0; j < n; ++j) ++cnt[DIGIT(buf_p0[j])];
for (uint32_t j = 1; j < kRadix; ++j) cnt[j] += cnt[j - 1];
for (int j = n - 1; j >= 0; --j)
buf_p1[--cnt[DIGIT(buf_p0[j])]] = buf_p0[j];
buf_pt = buf_p0, buf_p0 = buf_p1, buf_p1 = buf_pt;
}
if (buf_p0 != arr) memcpy(arr, buf_p0, n * sizeof(uint32_t));
return;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 979.719 ms | 762 MB + 972 KB | Accepted | Score: 100 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-03-19 22:23:21 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠