代码

#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
#define pb push_back

using namespace std;

const int N = 1<<27;

struct foo {
    unsigned v, i;
    bool operator <(const foo& rhs)const {
        return v < rhs.v;
    }
} a[N];

unsigned b[N], c[N];

void sort(unsigned *dst, int n) {
    const int K = 1 << 18;
    int p = 0;
    For(i, 0, K) rep(j, 0, 254) b[p++] = j;
    For(i, 255 * K, N) b[i] = 255;
    For(i, 0, N) a[i].i = i;
    For(i, 0, N) c[a[i].i] |= b[i], a[i].v = b[i];
    stable_sort(a, a + N);
    For(i, 0, N) c[a[i].i] |= b[i] << 8, a[i].v = b[i];
    stable_sort(a, a + N);
    For(i, 0, N) c[a[i].i] |= b[i] << 8, a[i].v = b[i];
    stable_sort(a, a + N);
    For(i, 0, N) c[a[i].i] |= b[i] << 16, a[i].v = b[i];
    stable_sort(a, a + N);
    For(i, 0, N) c[a[i].i] |= b[i] << 24, a[i].v = b[i];
    ios::sync_with_stdio(0);

    sort(c, c + N);
    For(i, 0, N) *dst++ = c[i];
}
// Let's try if generator is modified

评测结果