计数排序-1(排序)

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	7ms	276 KiB		409 Bytes	2022-6-30 21:40:19
AC	文硕 (文硕1)	7ms	312 KiB		390 Bytes	2022-2-6 14:15:00
AC	黄立信	8ms	6.9 MiB		260 Bytes	2023-11-24 18:38:43
AC	希蒙 (zhengxingya)	8ms	7 MiB		398 Bytes	2023-12-16 10:30:19
AC	杨坤霖 (steven)	8ms	316 KiB		467 Bytes	2023-3-2 19:45:40
AC	アニヤ (陈子涵)	9ms	7 MiB		313 Bytes	2023-12-3 20:22:18
AC	新壹街校区-罗斤天 (罗斤天)	11ms	7.1 MiB		198 Bytes	2024-1-18 17:43:19
AC	庹仕杰	12ms	7 MiB		353 Bytes	2023-12-19 18:54:45
AC	颜梓宇	12ms	7.1 MiB		251 Bytes	2024-1-7 17:28:17
AC	任童(rentong)	12ms	384 KiB		293 Bytes	2022-5-14 17:01:41
AC	欧俊阳	12ms	7 MiB	C++98	227 Bytes	2024-6-15 16:19:24
AC	zzzrrrxxx	12ms	6.7 MiB	C++98	239 Bytes	2024-6-28 12:41:06
AC	soha (武夷岩)	12ms	6.8 MiB	C++11(O2)	262 Bytes	2024-6-27 15:55:20
AC	杜俊宏	12ms	384 KiB		257 Bytes	2022-5-14 16:53:13
AC	luoluonuoya	13ms	392 KiB		368 Bytes	2022-3-27 15:06:46
AC	李树崑 (lishukun)	13ms	384 KiB		325 Bytes	2022-7-15 10:48:19
AC	田世瑞	13ms	6.7 MiB	C++11	285 Bytes	2024-7-13 22:19:57
AC	新壹街校区-老师: 黄路 (陈星宇)	13ms	6.9 MiB		267 Bytes	2023-11-24 18:40:27
AC	时代校区-刘臣原 (微笑王子)	13ms	440 KiB		345 Bytes	2022-9-14 19:37:38
AC	张瑞博	13ms	6.8 MiB	C++11	252 Bytes	2024-8-9 21:55:31
AC	Yuan (Zongzi1)	13ms	6.6 MiB	C++17(O2)	295 Bytes	2024-7-27 19:03:25
AC	wangjunhan	13ms	384 KiB		293 Bytes	2022-3-10 20:39:24
AC	kql1	13ms	7.1 MiB	C++98	383 Bytes	2024-5-9 13:27:49
AC	姚宏逸	13ms	404 KiB		315 Bytes	2022-5-30 16:21:11
AC	城 (liqc)	13ms	392 KiB		355 Bytes	2022-9-14 19:47:09
AC	B747 (TSK)	13ms	6.6 MiB	C++98	252 Bytes	2024-7-9 16:44:29
AC	霍弈丞小号	13ms	384 KiB		380 Bytes	2023-4-16 17:16:15
AC	南坪-叶梓曦 (yezixi)	13ms	6.9 MiB	C++11	291 Bytes	2024-6-1 13:05:47
AC	江泽栋	13ms	6.7 MiB	C++11	264 Bytes	2024-8-1 10:23:13
AC	德意志第三帝国 (陈远桥)	13ms	392 KiB		290 Bytes	2022-3-21 19:22:32
AC	汪致卉 (wangzh)	13ms	512 KiB		343 Bytes	2022-4-22 19:35:41
AC	古煦涵	13ms	6.7 MiB	C++98	217 Bytes	2024-8-3 14:19:34
AC	李山水2	13ms	384 KiB		240 Bytes	2022-7-29 16:47:31
AC	新壹街校区-陈琬舒 (空空大师)	13ms	6.8 MiB		293 Bytes	2023-10-15 10:20:20
AC	新壹街+黄路+江宇轩 (江宇轩)	13ms	7.2 MiB	C++98	256 Bytes	2024-5-12 10:57:11
AC	炸鱼4000+ (dxc)	13ms	7.2 MiB	C++14(O2)	252 Bytes	2024-4-29 21:30:22
AC	赵毕岑	13ms	384 KiB		352 Bytes	2022-1-23 8:42:20
AC	祝熙承 (zxc)	13ms	6.6 MiB	C++98	292 Bytes	2024-7-9 13:55:09
AC	1396013295	13ms	384 KiB		262 Bytes	2022-1-23 18:54:43
AC	余龙恩---来自额嘛瑞卡 (yulongenshijieshangzuishuai)	13ms	384 KiB		336 Bytes	2022-1-23 10:40:41
AC	陈海骞 (chq)	13ms	436 KiB		258 Bytes	2022-3-13 11:56:08
AC	luosifu22006	13ms	384 KiB		370 Bytes	2022-10-16 18:35:06
AC	huanglu	13ms	428 KiB		428 Bytes	2022-6-14 16:24:14
AC	枉哲锐	13ms	392 KiB		308 Bytes	2022-1-26 20:19:50
AC	许海平25	13ms	7.1 MiB	C++11	330 Bytes	2024-5-19 12:23:37
AC	李浩然	13ms	7.2 MiB	C++98	279 Bytes	2024-5-17 21:25:52
AC	爱琴海校区-黄辰浩 (huangchenhao)	14ms	7.5 MiB		468 Bytes	2023-10-14 11:34:04
AC	chenyifei	14ms	384 KiB		256 Bytes	2022-3-20 13:32:03
AC	_PXY_	14ms	384 KiB		287 Bytes	2022-1-22 15:42:30
AC	喵 (蹇心悦)	14ms	384 KiB		242 Bytes	2022-11-5 15:50:46
AC	wangjunhan	14ms	384 KiB		293 Bytes	2022-3-10 20:39:06
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:36:04
AC	kkksc03 (彭士锋)	14ms	512 KiB		430 Bytes	2022-3-12 13:45:37
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:35:10
AC	李禹衡 (liyuheng22006)	14ms	384 KiB		284 Bytes	2022-10-16 18:37:31
AC	氪鎄 (deimos)	14ms	384 KiB		355 Bytes	2022-9-23 20:09:59
AC	益布响完辣 (黄靖益1)	14ms	7.2 MiB	C++17	223 Bytes	2024-5-26 16:44:19
AC	你爹 (郭铠嘉)	14ms	384 KiB		305 Bytes	2022-3-20 11:56:50
AC	郑隽霖	14ms	6.6 MiB	C++17	281 Bytes	2024-7-10 17:11:32
AC	22029-lyh	14ms	392 KiB		304 Bytes	2023-4-9 10:15:20
AC	拥抱幸福小熊(吴沛篪)	14ms	7 MiB	C++98	338 Bytes	2024-6-1 9:04:18
AC	李倾城的忠实假粉 (向熠可)	14ms	384 KiB		316 Bytes	2022-3-29 21:12:16
AC	张颢瀛	14ms	452 KiB		252 Bytes	2022-7-22 16:50:24
AC	GYZ	14ms	512 KiB		307 Bytes	2022-5-25 19:46:01
AC	luosifu22006	14ms	512 KiB		370 Bytes	2022-10-16 18:34:14
AC	刘锦航	14ms	384 KiB		231 Bytes	2022-3-20 13:32:50
AC	zhangyh (张育菡)	14ms	440 KiB		398 Bytes	2022-6-27 21:33:51
AC	赵泳鑫 (zhaoyongxin)	14ms	428 KiB		407 Bytes	2022-4-20 18:01:57
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:35:11
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	14ms	6.7 MiB	C++98	258 Bytes	2024-8-2 13:36:02
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:36:04
AC	MoonLight ( aaa)	14ms	432 KiB		315 Bytes	2022-4-10 18:17:31
AC	colin1112 (墙凌可)	14ms	6.7 MiB		320 Bytes	2023-9-5 20:49:59
AC	曹埊睿 (caodirui)	14ms	512 KiB		275 Bytes	2023-5-12 19:10:45
AC	zhangyouze (张佑泽)	14ms	7 MiB	C++98	320 Bytes	2024-6-2 16:18:54
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		314 Bytes	2023-5-27 16:30:53
AC	时代一校-赵彦博 (zyb)	14ms	6.8 MiB		281 Bytes	2023-10-5 19:53:01
AC	何煜琦	14ms	7 MiB	C++11	236 Bytes	2024-8-24 17:18:22
AC	无尽的想象 (谭仕高)	14ms	512 KiB		256 Bytes	2023-4-14 14:34:02
AC	范宜灵	14ms	392 KiB		327 Bytes	2022-8-28 15:58:30
AC	panyan	14ms	384 KiB		370 Bytes	2022-11-5 15:14:30
AC	叶雨昊 (yeyuhao22006)	14ms	384 KiB		280 Bytes	2022-10-16 18:40:20
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	392 KiB		370 Bytes	2022-10-16 18:33:11
AC	何煜琦	14ms	7 MiB	C++11	236 Bytes	2024-8-24 17:30:16
AC	zlx (xiao)	14ms	384 KiB		868 Bytes	2022-11-26 19:39:11
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:36:08
AC	Tender. (05c05-zhou)	14ms	384 KiB		216 Bytes	2022-10-23 13:49:10
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:34:15
AC	luosifu22006	14ms	392 KiB		370 Bytes	2022-10-16 18:32:22
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:36:06
AC	luosifu22006	14ms	392 KiB		370 Bytes	2022-10-16 18:34:14
AC	偽艺術家 (chenyanchi22006)	14ms	392 KiB		203 Bytes	2022-10-16 18:41:37
AC	杨淇瑞 (杨淇瑞29)	14ms	7.2 MiB	C++98	299 Bytes	2024-4-22 19:30:33
AC	李山水	14ms	384 KiB		410 Bytes	2022-3-5 18:57:23
AC	scallway	14ms	6.7 MiB		566 Bytes	2023-8-24 15:05:33
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	384 KiB		286 Bytes	2023-4-9 10:36:57
AC	李哲 (lizhe)	14ms	7.3 MiB		324 Bytes	2024-1-2 20:42:31
AC	luosifu22006	14ms	384 KiB		370 Bytes	2022-10-16 18:36:10
AC	luosifu22006	15ms	392 KiB		370 Bytes	2022-10-16 18:35:14
AC	luosifu22006	15ms	396 KiB		370 Bytes	2022-10-16 18:36:07