排序 - 题目统计

状态	递交者	时间	内存	语言	代码	递交时间
AC	Zongzi1	31ms	6.5 MiB	C++17(O2)	717 Bytes	2024-7-27 18:56:54
AC	colin1112 (墙凌可)	44ms	6.5 MiB		330 Bytes	2023-9-20 18:05:25
AC	kql1	44ms	6.9 MiB	C++98	212 Bytes	2024-5-9 13:23:56
AC	刘锦航	48ms	1 MiB		228 Bytes	2022-3-20 13:36:16
AC	zlx (xiao)	48ms	2.3 MiB		1.5 KiB	2022-11-26 19:35:08
AC	chenyifei	49ms	1.1 MiB		253 Bytes	2022-3-20 13:38:54
AC	李山水	51ms	1 MiB		263 Bytes	2022-3-5 18:52:40
AC	张梓浩 (zhangzihao)	51ms	6.7 MiB	C++11(O2)	236 Bytes	2024-6-23 11:59:10
AC	CK (李弘毅)	51ms	7 MiB	C++11(O2)	301 Bytes	2024-5-5 9:52:11
AC	周靖淞 (zhoujingsong)	52ms	6.8 MiB	C++98(O2)	257 Bytes	2024-8-21 14:08:08
AC	李山水	52ms	1 MiB		263 Bytes	2022-3-5 18:52:40
AC	芒苒忧 (廖迦南)	64ms	2.9 MiB		917 Bytes	2022-7-22 11:05:32
AC	huanglu	65ms	6.9 MiB	C++98	852 Bytes	2024-5-9 15:50:46
AC	张瑞博	69ms	6.5 MiB	C++11	212 Bytes	2024-7-13 15:22:50
AC	朱老师 (zyp)	70ms	6.8 MiB	C++11	234 Bytes	2024-6-14 17:04:09
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	73ms	6.7 MiB	C++98	214 Bytes	2024-8-2 13:34:53
AC	不怎么聪明的家伙 (贺俊楠)	75ms	6.7 MiB		262 Bytes	2023-8-30 18:30:40
AC	时代一校-赵彦博 (zyb)	76ms	6.8 MiB		236 Bytes	2023-10-5 19:52:41
AC	杨浩灵 (金坷拉)	76ms	6.7 MiB		257 Bytes	2023-7-20 9:46:44
AC	章愉霖	76ms	6.6 MiB		214 Bytes	2023-6-14 19:46:53
AC	阮 (媚狐不吃道旁李)	76ms	6.8 MiB	C++98	239 Bytes	2024-5-25 16:22:06
AC	tsc_ (杨悦堃)	76ms	6.5 MiB		262 Bytes	2023-9-2 17:48:10
AC	胡澜之 (666hlz666)	77ms	6.7 MiB	C++11	258 Bytes	2024-5-20 19:45:43
AC	王义苇 (wangyiwei)	77ms	6.7 MiB		889 Bytes	2023-6-11 15:12:26
AC	美术猫映画 (mkh)	77ms	6.7 MiB		228 Bytes	2023-7-19 9:22:05
AC	RanHao	78ms	6.9 MiB		346 Bytes	2023-8-8 16:20:44
AC	黄梓轩 (huangzixuan)	78ms	6.7 MiB		325 Bytes	2023-9-17 14:10:13
AC	11451254188 (22029-mjh)	78ms	6.9 MiB		257 Bytes	2023-8-6 11:06:05
AC	时代一校 - 冯隆浩 (冯隆浩)	78ms	6.8 MiB		209 Bytes	2023-10-6 10:42:30
AC	刘昊臻 (liuhaozhen)	78ms	6.7 MiB		234 Bytes	2023-9-2 17:45:52
AC	时代二校-焦雨齐 (Angel)	78ms	6.7 MiB		291 Bytes	2023-7-19 9:19:30
AC	邹曜丞 (13983097018)	79ms	6.7 MiB		257 Bytes	2023-7-19 10:31:29
AC	小忙果 (王昱杰)	79ms	6.7 MiB		227 Bytes	2023-9-2 17:45:35
AC	新壹街朱启航 (zhuqihang)	79ms	6.8 MiB		253 Bytes	2023-9-2 17:44:41
AC	zhangyouze (张佑泽)	79ms	6.5 MiB		245 Bytes	2023-9-2 17:48:53
AC	超级管理员 (root)	79ms	6.7 MiB		225 Bytes	2023-6-5 23:34:44
AC	Chter	79ms	6.7 MiB		229 Bytes	2023-8-23 15:20:20
AC	你爹 (郭铠嘉)	80ms	1 MiB		303 Bytes	2022-3-13 10:51:03
AC	Randy Marsh (杨子腾)	80ms	1 MiB		308 Bytes	2022-3-13 10:48:02
AC	miku (阳沐珊)	83ms	6.9 MiB		272 Bytes	2023-7-20 13:34:07
AC	疯神芭芭脱丝 (李卓修)	84ms	2.2 MiB		268 Bytes	2022-7-12 11:53:10
AC	杜俊宏	84ms	2.2 MiB		240 Bytes	2022-7-15 9:10:19
AC	爱琴海校区-刁钲洋 (刁钲洋)	84ms	1 MiB		273 Bytes	2023-5-22 20:16:54
AC	新壹街陈科言 (cky)	85ms	7 MiB		301 Bytes	2023-7-19 16:28:57
AC	HIMMZXC	85ms	1.1 MiB		667 Bytes	2022-3-5 14:08:46
AC	Jose (反恐皮蛋)	85ms	1016 KiB		387 Bytes	2022-6-3 18:20:57
AC	wuzhenghan	86ms	1 MiB		244 Bytes	2023-3-6 21:27:52
AC	新壹街校区-杨轩懿 (杨轩懿1)	86ms	6.9 MiB		292 Bytes	2023-7-25 12:14:30
AC	杜是贤 (dushixian)	86ms	2.2 MiB		220 Bytes	2023-5-28 10:59:27
AC	傅博涛	86ms	1008 KiB		229 Bytes	2022-3-13 10:48:28
AC	luoluonuoya	86ms	1016 KiB		252 Bytes	2022-6-18 15:55:55
AC	郑之策	86ms	1008 KiB		234 Bytes	2022-3-20 12:03:21
AC	胡瀚文	86ms	2.5 MiB		212 Bytes	2022-7-17 11:58:51
AC	wuzhenghan	87ms	1.3 MiB		208 Bytes	2023-3-6 21:52:45
AC	赵泳鑫 (zhaoyongxin)	87ms	2.2 MiB		268 Bytes	2022-6-6 21:01:33
AC	jdy	87ms	1 MiB		244 Bytes	2022-3-13 10:23:36
AC	wangzihang	87ms	2.2 MiB		605 Bytes	2023-3-25 14:35:40
AC	王韵淮	87ms	1.6 MiB		193 Bytes	2022-5-1 11:20:48
AC	wangjunhan	87ms	1.2 MiB		251 Bytes	2022-2-28 22:13:42
AC	肖添宇	87ms	1016 KiB		542 Bytes	2022-5-14 18:52:12
AC	德意志第三帝国 (陈远桥)	87ms	1.1 MiB		286 Bytes	2022-3-21 19:21:11
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	88ms	2.2 MiB		251 Bytes	2023-5-31 21:55:06
AC	草\|\|草 (陈星佑)	88ms	1 MiB		240 Bytes	2023-1-9 17:56:58
AC	偽艺術家 (chenyanchi22006)	89ms	1.6 MiB		225 Bytes	2022-8-23 9:44:18
AC	_daa	89ms	1 MiB		689 Bytes	2022-1-20 18:53:10
AC	梨冻亿 (wiueh)	90ms	1.6 MiB		285 Bytes	2022-1-23 19:54:26
AC	yang	90ms	2.2 MiB		256 Bytes	2022-9-9 7:58:44
AC	huyinuo	90ms	2.3 MiB		264 Bytes	2022-8-28 10:13:18
AC	1396013295	91ms	2.8 MiB		741 Bytes	2022-1-28 19:34:20
AC	姚宏逸	91ms	2.1 MiB		844 Bytes	2022-11-2 20:53:41
AC	坤坤荔枝小黑子 (zhonghaotian22006)	92ms	1.2 MiB		254 Bytes	2022-10-18 18:52:14
AC	Tender. (05c05-zhou)	92ms	2.2 MiB		231 Bytes	2022-10-23 13:48:36
AC	renqiumo	93ms	1.6 MiB		864 Bytes	2022-5-29 15:10:06
AC	偽艺術家 (chenyanchi22006)	95ms	2.7 MiB		220 Bytes	2022-8-23 9:43:50
AC	曾御城（现用名） (Jason)	95ms	1.6 MiB		865 Bytes	2022-6-1 19:03:23
AC	李树崑 (lishukun)	97ms	1.3 MiB		345 Bytes	2022-6-23 20:43:41
AC	文硕 (文硕1)	109ms	1 MiB		286 Bytes	2022-7-12 13:52:28
AC	zyl	111ms	2.3 MiB		344 Bytes	2024-2-2 14:18:19
AC	曾御城（现用名） (Jason)	115ms	1.6 MiB		865 Bytes	2022-6-1 19:02:41
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)	117ms	2.8 MiB		206 Bytes	2023-6-3 11:28:16
AC	没有此人 (akm)	117ms	79.7 MiB		303 Bytes	2023-7-9 10:19:51
AC	Harley (郑浩然)	121ms	4 MiB	C++98	234 Bytes	2024-9-19 19:56:52
AC	赵沛喆	176ms	2.7 MiB		271 Bytes	2022-8-17 15:37:37
AC	谭红中 (不知道)	180ms	20.7 MiB	Python 3	102 Bytes	2022-4-17 21:21:49
AC	Alduin	455ms	19.8 MiB	Python 3	103 Bytes	2024-3-30 16:45:09