提交记录 7263


用户 题目 状态 得分 用时 内存 语言 代码长度
user1 1001. 测测你的排序 Accepted 100 803.147 ms 781264 KB C++ 1.44 KB
提交时间 评测时间
2019-01-20 14:05:17 2020-08-01 01:02:06
// TEST
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")

#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")

 void sort(unsigned *a, int n)  {
#define N 100000000
#define D 256
#define D1 255
#define cal(w,w2,tw,op) p=w2-1;for(i=0;i<D;++i)rs[i]=p,p+=tw[i];for(i=0;i<N;i+=8){	p=w+i;	*++rs[p[0]op]=p[0],	*++rs[p[1]op]=p[1],	*++rs[p[2]op]=p[2],	*++rs[p[3]op]=p[3],	*++rs[p[4]op]=p[4],	*++rs[p[5]op]=p[5],	*++rs[p[6]op]=p[6],	*++rs[p[7]op]=p[7];}
unsigned b[N],*rs[D],t0[D],t1[D],t2[D],t3[D];
unsigned*p,i,x;
for(i=0;i<D;++i){
	t0[i]=0;
	t1[i]=0;
	t2[i]=0;
	t3[i]=0;
}
for(i=0;i<N;){
#define A x=a[i],++t0[x&D1],++t1[x>>8&D1],++t2[x>>16&D1],++t3[x>>24],++i;
A A A A
#undef A
}
cal(a,b,t0,&D1);
cal(b,a,t1,>>8&D1);
cal(a,b,t2,>>16&D1);
cal(b,a,t3,>>24);
}

CompilationN/AN/ACompile OKScore: N/A

Testcase #1803.147 ms762 MB + 976 KBAcceptedScore: 100


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