计数排序-2(排序)

状态	递交者	时间	内存	语言	代码	递交时间
AC	小忙果 (王昱杰)	4ms	7.1 MiB		587 Bytes	2024-1-13 18:02:49
AC	赵沛喆	6ms	256 KiB		409 Bytes	2022-6-30 21:41:32
AC	文硕 (文硕1)	8ms	384 KiB		390 Bytes	2022-2-6 14:15:10
AC	AI创客	8ms	7.3 MiB		442 Bytes	2023-12-30 11:54:28
AC	杨坤霖 (steven)	8ms	384 KiB		354 Bytes	2023-3-2 19:45:54
AC	新壹街—熊轩杭 (xiongxuanhang)	11ms	7.1 MiB		529 Bytes	2024-1-13 18:01:30
AC	爱情海校区—沙天一 (沙天一)	12ms	7 MiB		269 Bytes	2023-12-30 9:30:58
AC	zzzrrrxxx	12ms	6.7 MiB	C++98	194 Bytes	2024-6-28 12:40:28
AC	张泰凌 (ztl)	12ms	512 KiB		241 Bytes	2022-6-19 9:04:48
AC	B747 (TSK)	13ms	6.6 MiB	C++98	253 Bytes	2024-7-9 16:37:35
AC	朱老师 (zyp)	13ms	7 MiB	C++11	248 Bytes	2024-5-10 22:24:18
AC	张泰凌 (ztl)	13ms	384 KiB		241 Bytes	2022-6-19 9:06:24
AC	田世瑞	13ms	6.7 MiB	C++11	283 Bytes	2024-7-13 22:19:13
AC	_PXY_	13ms	384 KiB		287 Bytes	2022-1-22 15:42:51
AC	新壹街校区-付宇轩 (fyx)	13ms	7.1 MiB		217 Bytes	2023-12-16 20:24:11
AC	ywh	13ms	384 KiB		217 Bytes	2022-6-19 9:02:08
AC	李倾城的忠实假粉 (向熠可)	13ms	392 KiB		316 Bytes	2022-3-29 21:12:39
AC	soha (武夷岩)	13ms	6.7 MiB	C++11(O2)	217 Bytes	2024-6-27 15:54:04
AC	sunxiaozhu	13ms	7 MiB	C++98	204 Bytes	2024-5-10 22:28:41
AC	赵毕岑	13ms	512 KiB		355 Bytes	2022-1-23 8:43:13
AC	Yuan (Zongzi1)	13ms	6.6 MiB	C++17(O2)	285 Bytes	2024-7-27 19:03:40
AC	任童(rentong)	13ms	392 KiB		293 Bytes	2022-5-14 17:07:40
AC	1396013295	13ms	384 KiB		262 Bytes	2022-1-23 18:54:55
AC	古煦涵	13ms	6.7 MiB	C++98	217 Bytes	2024-8-3 14:31:07
AC	李山水	13ms	508 KiB		410 Bytes	2022-3-5 18:58:06
AC	郑尧 (zhengyao)	13ms	384 KiB		319 Bytes	2023-5-13 20:32:39
AC	欧俊阳	13ms	7 MiB	C++11(O2)	185 Bytes	2024-6-15 16:17:25
AC	南坪-叶梓曦 (yezixi)	13ms	6.9 MiB	C++11	248 Bytes	2024-6-1 13:03:13
AC	张景豪	13ms	384 KiB		398 Bytes	2023-5-13 20:32:36
AC	kkksc03 (彭士锋)	13ms	440 KiB		430 Bytes	2022-3-12 13:46:03
AC	cxk123 (tanzixuan)	13ms	384 KiB		363 Bytes	2023-5-13 20:39:41
AC	许海平25	13ms	7.1 MiB	C++11	330 Bytes	2024-5-19 12:22:59
AC	luoluonuoya	13ms	384 KiB		323 Bytes	2022-3-27 15:07:18
AC	原著校区巫映秋 (巫映秋1a)	13ms	6.5 MiB		210 Bytes	2023-11-19 13:08:01
AC	郑隽霖	13ms	6.6 MiB	C++17	281 Bytes	2024-7-10 17:11:56
AC	ycy	13ms	384 KiB		759 Bytes	2023-2-17 1:49:46
AC	三差学生 (尘埃蓝莓)	13ms	384 KiB		332 Bytes	2023-5-13 20:33:04
AC	姚宏逸	13ms	440 KiB		291 Bytes	2022-3-25 10:49:50
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	13ms	6.7 MiB	C++98	258 Bytes	2024-8-2 13:36:17
AC	zhangyh (张育菡)	13ms	436 KiB		398 Bytes	2022-6-27 21:33:35
AC	chenyifei	13ms	384 KiB		253 Bytes	2022-3-20 13:26:31
AC	luosifu22006	13ms	392 KiB		370 Bytes	2022-10-16 18:43:13
AC	霍弈丞小号	13ms	384 KiB		380 Bytes	2023-4-16 17:16:24
AC	余龙恩---来自额嘛瑞卡 (yulongenshijieshangzuishuai)	13ms	384 KiB		336 Bytes	2022-1-23 10:40:57
AC	祝熙承 (zxc)	13ms	6.6 MiB	C++98	247 Bytes	2024-7-9 13:53:50
AC	杜俊宏	13ms	384 KiB		257 Bytes	2022-5-14 16:54:25
AC	张瑞博	14ms	6.7 MiB	C++11	229 Bytes	2024-7-11 22:20:51
AC	(金沙天街)严皓月 (严皓月)	14ms	6.9 MiB		223 Bytes	2023-12-13 20:44:02
AC	huanglu	14ms	428 KiB		424 Bytes	2022-6-14 16:28:32
AC	zhm123	14ms	512 KiB		351 Bytes	2023-5-8 18:15:12
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	388 KiB		286 Bytes	2023-4-9 10:36:38
AC	王祎辰 (wangyichen)	14ms	384 KiB		325 Bytes	2023-5-13 20:36:58
AC	何煜琦	14ms	7 MiB	C++11	194 Bytes	2024-8-24 17:17:27
AC	ycy	14ms	384 KiB		754 Bytes	2023-2-17 1:49:11
AC	氪鎄 (deimos)	14ms	384 KiB		332 Bytes	2022-9-23 19:28:19
AC	zcx	14ms	6.8 MiB		356 Bytes	2023-10-29 10:42:43
AC	樊竣熠 (lft1114)	14ms	512 KiB		253 Bytes	2022-8-3 14:20:10
AC	益布响完辣 (黄靖益1)	14ms	6.8 MiB	C++17	208 Bytes	2024-5-26 16:37:25
AC	拥抱幸福小熊(吴沛篪)	14ms	7 MiB	C++98	338 Bytes	2024-6-22 10:19:00
AC	喵 (蹇心悦)	14ms	392 KiB		257 Bytes	2022-11-5 16:32:36
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	6.8 MiB		198 Bytes	2023-9-16 16:28:25
AC	疯神芭芭脱丝 (李卓修)	14ms	512 KiB		402 Bytes	2022-7-9 19:05:56
AC	时代二校+王吕棪 (wanglvyan)	14ms	6.8 MiB		338 Bytes	2023-9-16 16:24:34
AC	李树崑 (lishukun)	14ms	436 KiB		345 Bytes	2022-7-15 10:48:06
AC	江泽栋	14ms	6.7 MiB	C++11	264 Bytes	2024-8-1 10:40:26
AC	徐康景 (dcm)	14ms	384 KiB		198 Bytes	2022-11-5 11:59:36
AC	李禹衡 (liyuheng22006)	14ms	384 KiB		284 Bytes	2022-10-16 18:43:55
AC	可爱的小花狗	14ms	6.8 MiB		416 Bytes	2023-9-16 16:27:56
AC	炸鱼4000+ (dxc)	14ms	7.2 MiB	C++14(O2)	219 Bytes	2024-4-29 21:25:51
AC	时代2校+涂彦迪 (tuyandi)	14ms	6.8 MiB		337 Bytes	2023-9-16 16:28:10
AC	陈海骞 (chq)	14ms	392 KiB		298 Bytes	2022-3-13 11:59:35
AC	时代2校+施皓宬 (shihaocheng)	14ms	6.8 MiB		345 Bytes	2023-9-16 16:26:04
AC	wangjunhan	14ms	444 KiB		248 Bytes	2022-3-10 20:42:31
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	6.7 MiB		357 Bytes	2023-9-16 17:31:01
AC	时代二校+马嘉宸 (majiachen)	14ms	6.8 MiB		355 Bytes	2023-9-16 16:24:58
AC	zhangheyi22006	14ms	384 KiB		281 Bytes	2022-10-16 18:43:53
AC	ycy	14ms	512 KiB		538 Bytes	2023-2-16 23:32:37
AC	yang	14ms	512 KiB		258 Bytes	2022-9-9 8:03:47
AC	cupy战士 (05c05-dkf)	14ms	440 KiB		319 Bytes	2023-2-25 22:36:06
AC	时代2校-程俊燃 (chengjunran)	14ms	6.8 MiB		378 Bytes	2023-9-16 16:28:12
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	6.7 MiB		210 Bytes	2023-9-5 20:21:47
AC	周琪渃	14ms	512 KiB		333 Bytes	2023-4-8 12:09:54
AC	bilbil	14ms	6.7 MiB		384 Bytes	2023-9-16 17:27:50
AC	枉哲锐	14ms	384 KiB		305 Bytes	2022-1-26 20:20:07
AC	毕浩宇 (bihaoyu)	14ms	6.7 MiB		359 Bytes	2023-9-16 17:25:01
AC	杜是贤 (dushixian)	14ms	392 KiB		220 Bytes	2023-5-28 10:59:10
AC	时代2校+施皓宬 (shihaocheng)	14ms	6.8 MiB		340 Bytes	2023-9-16 16:23:48
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	6.8 MiB		438 Bytes	2023-9-16 16:26:54
AC	cxk123 (tanzixuan)	14ms	448 KiB		353 Bytes	2023-5-13 20:31:38
AC	庹仕杰	14ms	7 MiB		342 Bytes	2023-12-19 18:53:56
AC	手搓STL stack 双向无环链表 _ 向量 2种实现方式: template <typename Map_Type> class Stack_l /* Stack _ List / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }Data; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }; public: unsigned int size(void) { return Data.List_Size; } Map_Type& top(void) { return Data.endp -> Node_Data; } void data(void) { return &Data; } bool empty(void) { return !((bool)Data.headp); } Stack_l<Map_Type>& push(Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type& push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type* push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(const Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = (Map_Type)push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& pop(void) { if (Data.headp) { if (Data.List_Size == 1u) { delete Data.headp; Data.List_Size = 0; Data.headp = 0; Data.endp = 0; } else { Data.endp = Data.endp -> lastp; delete Data.endp -> nextp; Data.endp -> nextp = 0; --Data.List_Size; } } return this; } Stack_l<Map_Type>& clear(void) { while (Data.List_Size) { pop(); } return this; } Stack_l<Map_Type>(void) { /* NULL / } Stack_l<Map_Type>(unsigned int data_size, Map_Type map_data) { Data.List_Size = data_size; while (data_size--) { Node nodep = new Node(); nodep -> Node_Data = map_data; if (Data.headp) { nodep -> lastp = Data.endp; Data.endp -> nextp = nodep; Data.endp = nodep; } else { Data.headp = nodep; Data.endp = nodep; } } } Stack_l<Map_Type>(Stack_l<Map_Type>& map_data) { if (!map_data.empty()) { List_Data listp = (List_Data)map_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; } } Stack_l<Map_Type>& operator=(Stack_l<Map_Type>& copy_data) { if (copy_data.empty()) return this; List_Data listp = (List_Data)copy_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; return this; } bool operator==(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() != Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return true; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return false; } return true; } bool operator!=(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() == Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return false; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return true; } return true; } ~Stack_l<Map_Type>(void) { clear(); } }; /* Stack _ List / template <typename Map_Type> class Stack_v / Stack _ Vector / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }Data; public: unsigned int size(void) { return Data.lastp - Data.headp; } Map_Type& top(void) { return (Data.lastp - 1); } void* data(void) { return &Data; } bool full(void) { if (!Data.headp) return true; return Data.endp + 1 == Data.lastp; } bool empty(void) { if (!Data.headp) return true; return Data.headp == Data.lastp; } Stack_v<Map_Type>& push(Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type& push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type* push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(const Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = (Map_Type)push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& pop(void) { if (empty()) { if (Data.lastp - Data.headp > 1) Data.resize((Data.lastp - Data.headp) >> 1); else return this; } else --Data.lastp; return this; } Stack_v<Map_Type>(void) { /* NULL / } Stack_v<Map_Type>(unsigned int data_size, Map_Type map_data) { while (data_size) { push(&map_data); --data_size; } } Stack_v<Map_Type>(Stack_v<Map_Type>& map_data) { Vector_Data datap = (Vector_Data)map_data.data(); for (unsigned int i = 0, k = map_data.size(); i != k; ++i) push(datap -> headp + i); } Stack_v<Map_Type>& operator=(Stack_v<Map_Type>& copy_data) { if (copy_data.empty()) clear(); else { Vector_Data datap = (Vector_Data)copy_data.data(); for (unsigned int i = 0, k = copy_data.size(); i != k; ++i) push(datap -> headp + i); } return this; } bool operator==(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return false; else if (empty() && cmp_data.empty()) return true; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap ->headp + i)) return false; } return true; } bool operator!=(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return true; else if (empty() && cmp_data.empty()) return false; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap -> headp + i)) return true; } return false; } Stack_v<Map_Type>& clear(void) { delete[] Data.headp; Data.headp = 0; Data.lastp = 0; Data.endp = 0; return this; } ~Stack_v<Map_Type>(void) { delete[] Data.headp; } }; / Stack _ Vector */ int main(void) { return 0; } (22029-xys)	14ms	384 KiB		313 Bytes	2023-5-27 16:32:20
AC	MoonLight ( aaa)	14ms	448 KiB		279 Bytes	2022-4-10 18:52:16
AC	李山水2	14ms	512 KiB		240 Bytes	2022-7-29 16:48:06
AC	时代2校+施皓宬 (shihaocheng)	15ms	6.7 MiB		324 Bytes	2023-9-16 17:26:26
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	6.8 MiB		438 Bytes	2023-9-16 16:26:06
AC	龚信丞	15ms	392 KiB		342 Bytes	2023-5-13 20:36:23
AC	时代二校-焦雨齐 (Angel)	15ms	6.7 MiB		371 Bytes	2023-9-16 17:28:00
AC	没有此人 (akm)	15ms	6.7 MiB		309 Bytes	2023-9-16 13:33:42
AC	ycy	15ms	384 KiB		604 Bytes	2023-2-17 1:47:23
AC	可爱的小花狗	15ms	6.7 MiB		398 Bytes	2023-9-16 17:43:28