排序 - 题目统计

状态	递交者	时间	内存	语言	代码	递交时间
AC	zlx (xiao)	46ms	1.1 MiB		1.5 KiB	2022-5-20 21:40:35
AC	刘锦航	48ms	1.1 MiB		215 Bytes	2022-6-12 17:13:11
AC	zhangyh (张育菡)	49ms	1016 KiB		246 Bytes	2022-5-31 20:26:35
AC	李山水	49ms	1.6 MiB		281 Bytes	2022-6-3 10:56:42
AC	zyl	50ms	7 MiB	C++11(O2)	240 Bytes	2024-6-19 14:05:54
AC	zhangyh (张育菡)	50ms	1020 KiB		255 Bytes	2022-5-31 20:25:43
AC	TBB (杜昊燃)	51ms	1 MiB		329 Bytes	2022-5-1 22:46:36
AC	tyx_9192596	59ms	2.2 MiB		224 Bytes	2023-3-15 18:10:03
AC	芒苒忧 (廖迦南)	62ms	1.6 MiB		917 Bytes	2022-5-4 11:33:48
AC	阮 (媚狐不吃道旁李)	67ms	7.2 MiB	C++98	239 Bytes	2024-5-18 16:43:34
AC	zhangyouze (张佑泽)	67ms	6.9 MiB	C++98	232 Bytes	2024-6-3 22:02:55
AC	zzzrrrxxx	68ms	6.9 MiB	C++98	221 Bytes	2024-8-21 20:31:01
AC	张瑞博	69ms	6.6 MiB	C++11	212 Bytes	2024-7-13 15:21:36
AC	王晴萱	70ms	7 MiB	C++11	205 Bytes	2024-5-18 10:03:36
AC	段淏泷	72ms	6.7 MiB	C++98	218 Bytes	2024-8-3 15:30:33
AC	金沙—彭智宸 (彭智宸)	75ms	6.5 MiB		233 Bytes	2023-6-4 11:25:37
AC	金沙—彭智宸 (彭智宸)	75ms	6.7 MiB		233 Bytes	2023-6-4 11:26:20
AC	金沙—彭智宸 (彭智宸)	76ms	6.7 MiB		247 Bytes	2023-6-4 10:46:40
AC	zhm123	77ms	6.7 MiB		223 Bytes	2023-9-19 18:20:49
AC	时代一校 - 冯隆浩 (冯隆浩)	77ms	6.8 MiB		209 Bytes	2023-10-6 10:42:12
AC	邹曜丞 (13983097018)	78ms	6.7 MiB		257 Bytes	2023-7-19 10:31:41
AC	火星伞宾——刘晏恺 (刘晏恺)	78ms	6.9 MiB		218 Bytes	2023-7-23 15:25:47
AC	游灵一幻 (martin)	78ms	6.5 MiB		204 Bytes	2023-6-4 10:43:11
AC	刘煜轩	78ms	6.5 MiB		228 Bytes	2023-8-24 16:23:58
AC	庹仕杰	78ms	6.9 MiB		251 Bytes	2023-6-30 14:41:27
AC	巨珩宇	78ms	6.7 MiB		461 Bytes	2023-6-4 11:44:44
AC	谢雨贝	78ms	6.5 MiB		336 Bytes	2023-6-4 11:05:43
AC	王祎辰 (wangyichen)	78ms	6.7 MiB		264 Bytes	2023-8-31 11:54:57
AC	贺睿林	78ms	6.5 MiB		241 Bytes	2023-6-4 10:44:21
AC	史韵哲	78ms	6.5 MiB		288 Bytes	2023-6-4 11:52:56
AC	colin1112 (墙凌可)	78ms	7.1 MiB		285 Bytes	2023-5-19 8:02:42
AC	时代2校-程俊燃 (chengjunran)	78ms	6.7 MiB		213 Bytes	2023-9-23 21:15:57
AC	荣耀	78ms	6.7 MiB		208 Bytes	2023-8-30 12:37:11
AC	爱琴海校区-刁钲洋 (刁钲洋)	79ms	6.7 MiB		341 Bytes	2023-8-13 15:20:03
AC	时代二校-王盼兮 (wangpanxi)	79ms	6.7 MiB		227 Bytes	2023-8-25 15:09:58
AC	中岛敦 (黄麒瑞)	79ms	6.8 MiB		246 Bytes	2023-10-20 19:00:09
AC	(金沙天街)严皓月 (严皓月)	79ms	6.5 MiB		232 Bytes	2023-6-4 10:05:09
AC	吴俊成 (wujuncheng)	79ms	1000 KiB		218 Bytes	2022-6-7 17:38:03
AC	时代一校 - 冯隆浩 (冯隆浩)	80ms	6.8 MiB		209 Bytes	2023-10-6 10:40:32
AC	任希贤	80ms	6.6 MiB		200 Bytes	2023-8-24 16:11:14
AC	乐瀚阳 (yuehanyang)	80ms	6.9 MiB		195 Bytes	2023-8-19 16:55:02
AC	时代二校-陈天成 (鸭缩毛巾)	80ms	6.5 MiB		213 Bytes	2023-9-9 17:21:26
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)	80ms	6.6 MiB		217 Bytes	2023-6-3 20:31:21
AC	zjm	80ms	1 MiB		218 Bytes	2023-4-16 10:30:04
AC	新壹街校区-陈琬舒 (空空大师)	80ms	11 MiB		227 Bytes	2023-7-21 8:34:04
AC	姜思瀚	81ms	6.9 MiB		248 Bytes	2023-6-30 14:48:46
AC	秦维希 (qinweixi)	81ms	1 MiB		410 Bytes	2022-6-12 17:44:22
AC	陈骏洋	82ms	1008 KiB		268 Bytes	2022-6-5 11:48:36
AC	liusitong	82ms	6.7 MiB		219 Bytes	2023-6-22 10:38:01
AC	CMG	83ms	996 KiB		220 Bytes	2022-5-29 18:57:53
AC	朱老师 (zyp)	83ms	996 KiB		312 Bytes	2023-4-16 10:28:11
AC	蒲梓勋 (puzixun)	83ms	1.1 MiB		249 Bytes	2022-12-8 20:08:44
AC	王昱祺 (12王昱祺)	83ms	6.6 MiB		280 Bytes	2023-6-13 15:59:49
AC	章愉霖	83ms	7.1 MiB		205 Bytes	2023-10-14 15:47:08
AC	林靖明	83ms	2 MiB		230 Bytes	2023-2-1 20:21:55
AC	熊奕博 (Mothefuck)	83ms	1016 KiB		231 Bytes	2023-3-5 16:14:48
AC	城 (liqc)	84ms	1 MiB		238 Bytes	2022-9-14 19:56:17
AC	Randy Marsh (杨子腾)	84ms	992 KiB		290 Bytes	2022-5-29 17:47:53
AC	可爱的小花狗	84ms	7.2 MiB	C++11	225 Bytes	2024-4-27 18:23:32
AC	阚一鸣	84ms	1 MiB		255 Bytes	2023-5-14 15:15:17
AC	火爆肥肠（杨弘毅） (火爆肥肠)	84ms	992 KiB		230 Bytes	2022-6-8 21:00:04
AC	kin of kin (jojo)	84ms	1 MiB		597 Bytes	2022-3-28 17:41:19
AC	新壹街陈科言 (cky)	84ms	6.7 MiB		301 Bytes	2023-7-19 16:29:16
AC	德意志第三帝国 (陈远桥)	84ms	1016 KiB		268 Bytes	2022-6-5 11:30:28
AC	郑淇予 (macabaca)	84ms	1 MiB		205 Bytes	2022-6-12 18:00:37
AC	无尽的想象 (谭仕高)	84ms	1 MiB		285 Bytes	2022-8-31 16:24:32
AC	赵泳鑫 (zhaoyongxin)	85ms	1.9 MiB		268 Bytes	2022-6-6 20:53:27
AC	张玉坚 (zhangyuian)	85ms	1016 KiB		228 Bytes	2023-3-5 16:13:11
AC	陈杰晟	85ms	1012 KiB		571 Bytes	2022-6-11 19:30:32
AC	XYZ303	85ms	2.2 MiB		225 Bytes	2022-5-22 19:31:32
AC	wangjunhan	85ms	2.2 MiB		251 Bytes	2022-6-11 19:08:54
AC	时代一校蒋帛希 (13983392730)	85ms	2.3 MiB		251 Bytes	2023-2-9 21:37:11
AC	wangzihang	85ms	1.3 MiB		605 Bytes	2023-3-25 14:34:42
AC	王晨志 (wangchenzhi)	85ms	2.2 MiB		435 Bytes	2022-7-28 17:13:49
AC	sqmyb	85ms	980 KiB		221 Bytes	2023-3-5 16:13:37
AC	张梓辰 (DiaoDesi屌德斯)	85ms	1.1 MiB		217 Bytes	2022-9-14 19:57:01
AC	86想要钱 (twt)	85ms	2.2 MiB		229 Bytes	2023-2-17 18:59:47
AC	LukeDid	85ms	2.2 MiB		318 Bytes	2023-4-21 22:36:14
AC	没有此人 (akm)	85ms	6.5 MiB		309 Bytes	2023-9-16 13:32:14
AC	许嘉恩 (xje22031)	85ms	2.3 MiB		222 Bytes	2023-5-11 15:54:03
AC	李林峰 (金克拉)	85ms	1016 KiB		225 Bytes	2022-9-14 19:58:15
AC	伍芷函	85ms	2.1 MiB		277 Bytes	2023-3-5 16:04:40
AC	微风将至 (李睿轩)	86ms	996 KiB		230 Bytes	2022-5-22 19:34:27
AC	徐正旺 (xzw)	86ms	988 KiB		687 Bytes	2023-3-29 17:49:17
AC	SB (mfy01)	86ms	1.5 MiB		193 Bytes	2023-2-2 20:24:47
AC	疯神芭芭脱丝 (李卓修)	86ms	988 KiB		268 Bytes	2022-6-12 17:04:11
AC	龙沁均 (我是S神)	86ms	1 MiB		214 Bytes	2022-6-11 19:38:16
AC	qinyi	86ms	1 MiB		318 Bytes	2022-4-2 17:00:45
AC	时代一校-赵彦博 (zyb)	86ms	2.2 MiB		236 Bytes	2023-2-7 15:01:46
AC	罗毅川 (scp-049)	86ms	1020 KiB		245 Bytes	2022-6-12 17:45:08
AC	soha (武夷岩)	86ms	1 MiB		242 Bytes	2023-5-19 21:19:36
AC	朱老师 (zyp)	86ms	2.2 MiB		221 Bytes	2023-2-2 20:18:17
AC	喻文博 (22016-ywb)	86ms	1 MiB		197 Bytes	2022-12-4 11:15:03
AC	关博源	86ms	996 KiB		242 Bytes	2023-5-20 10:49:20
AC	11111	86ms	1 MiB		248 Bytes	2022-6-9 14:28:36
AC	胡澜之 (666hlz666)	86ms	6.8 MiB		243 Bytes	2023-10-30 16:51:04
AC	ycy	86ms	2.3 MiB		279 Bytes	2022-4-19 21:44:49
AC	经常消失 (小萝卜)	87ms	1 MiB		318 Bytes	2022-4-4 21:51:08
AC	姚宏逸	87ms	2.2 MiB		605 Bytes	2022-5-6 15:31:27
AC	黄立信	87ms	1.9 MiB		281 Bytes	2023-5-18 18:29:57