提交记录 20487
| 用户 | 题目 | 状态 | 得分 | 用时 | 内存 | 语言 | 代码长度 |
|---|---|---|---|---|---|---|---|
| konjaklaf | 1001. 测测你的排序 | Compile Error | 0 | 0 ns | 0 KB | C++ | 600 B |
| 提交时间 | 评测时间 |
|---|---|
| 2023-10-30 21:43:41 | 2023-10-30 21:43:41 |
int t0[ful + 1], t1[ful + 1], t2[ful + 1], t3[ful + 1];
unsigned *b = new unsigned[100000000];
void sort(unsigned *a, int n) {
int i;
for (i = 0; i < n; i++) ++t0[a[i] & ful], ++t1[a[i] >> 8 & ful], ++t2[a[i] >> 16 & ful], ++t3[a[i] >> 24];
for (i = 1; i <= ful; i++) t0[i] += t0[i - 1], t1[i] += t1[i - 1], t2[i] += t2[i - 1], t3[i] += t3[i - 1];
for (i = n - 1; ~i; i--) b[--t0[a[i] & ful]] = a[i];
for (i = n - 1; ~i; i--) a[--t1[b[i] >> 8 & ful]] = b[i];
for (i = n - 1; ~i; i--) b[--t2[a[i] >> 16 & ful]] = a[i];
for (i = n - 1; ~i; i--) a[--t3[b[i] >> 24]] = b[i];
}
| Compilation | N/A | N/A | Compile Error | Score: N/A | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-03-12 22:42:57 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠