提交记录 9408


用户 题目 状态 得分 用时 内存 语言 代码长度
liuxinyuanxy 1001. 测测你的排序 Memory Limit Exceeded 0 0 ns 0 KB C++ 814 B
提交时间 评测时间
2019-05-06 17:16:08 2020-08-01 01:37:49
#include <iostream>
#include <cstdio>
#define MAX 100000005
using namespace std;
const int INF = 0xffff + 1;
int aa[MAX], bb[MAX], cc[MAX];
int x[MAX], y[MAX], t[INF];
void sort(unsigned *a, int n) {
    int i;
    for (i = 1; i <= n; ++i)
    {
        cc[i] = a[i];
        bb[i] = cc[i] / INF;
        aa[i] = cc[i] % INF;
    }
    for (i = 0; i < INF; ++i)
        t[i] = 0;
    for (i = 1; i <= n; ++i)
        ++t[aa[i]];
    for (i = 1; i < INF; ++i)
        t[i] += t[i - 1];
    for (i = n; i >= 1; --i)
        x[t[aa[i]]--] = i;
    for (i = 0; i < INF; ++i)
        t[i] = 0;
    for (i = 1; i <= n; ++i)
        ++t[bb[x[i]]];
    for (i = 1; i < INF; ++i)
        t[i] += t[i - 1];
    for (i = n; i >= 1; --i)
        y[t[bb[x[i]]]--] = x[i];
    for (i = 1; i <= n; ++i)
        a[i] = cc[y[i]];
}

CompilationN/AN/ACompile OKScore: N/A

Testcase #10 ns0 KBMemory Limit ExceededScore: 0


Judge Duck Online | 评测鸭在线
Server Time: 2026-04-04 08:14:57 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠