叠罗汉升级版

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵启程 (赵启程1)	7ms	512 KiB		234 Bytes	2023-3-31 22:01:46
AC	明哲瀚 (18580067605)	7ms	384 KiB		245 Bytes	2022-9-8 19:28:19
AC	雷中鑫123456	7ms	384 KiB		215 Bytes	2023-4-8 11:50:31
AC	田世瑞	7ms	384 KiB		239 Bytes	2022-10-30 15:22:40
AC	qwertyuiop	7ms	384 KiB		230 Bytes	2022-2-19 10:18:08
AC	向俊熙 (xiangjunxi23003)	7ms	444 KiB		232 Bytes	2023-2-15 16:37:30
AC	极为的好van的 (lyq)	7ms	6.8 MiB		219 Bytes	2023-6-9 18:56:03
AC	wangyueru	7ms	436 KiB		222 Bytes	2022-9-4 11:37:56
AC	你猜呀	7ms	420 KiB		212 Bytes	2023-2-12 15:42:43
AC	梁程翔	7ms	6.9 MiB	C++17	214 Bytes	2024-8-18 15:30:57
AC	TJW唐嘉文	7ms	432 KiB		246 Bytes	2022-4-28 19:30:02
AC	郭睿	7ms	6.6 MiB	C++98	237 Bytes	2024-7-9 22:09:11
AC	xxteacher	7ms	392 KiB		219 Bytes	2022-1-25 17:05:19
AC	一个小黑	7ms	6.7 MiB		202 Bytes	2023-9-22 21:17:36
AC	汤杰尧 (05c05-tjy1)	7ms	504 KiB		220 Bytes	2022-5-9 21:55:57
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	7ms	384 KiB		232 Bytes	2022-3-3 20:16:04
AC	谢佳辰	7ms	384 KiB		256 Bytes	2022-6-12 9:14:16
AC	明哲瀚 (18580067605)	7ms	512 KiB		245 Bytes	2022-9-9 18:31:32
AC	huyinuo	7ms	384 KiB		286 Bytes	2022-3-14 19:12:20
AC	liulinqi1	7ms	384 KiB		219 Bytes	2022-10-2 18:09:30
AC	明哲瀚 (18580067605)	7ms	392 KiB		245 Bytes	2022-9-7 19:45:23
AC	yanyuhan	7ms	400 KiB		223 Bytes	2023-2-12 15:55:13
AC	56 (13883454928)	7ms	384 KiB		229 Bytes	2023-3-22 22:06:07
AC	杨佳葆	7ms	384 KiB		196 Bytes	2022-3-31 19:10:28
AC	李樊駁	7ms	392 KiB		227 Bytes	2023-2-12 15:55:38
AC	chen (peter)	7ms	432 KiB		245 Bytes	2022-7-19 9:20:21
AC	17779	7ms	432 KiB		243 Bytes	2022-2-25 15:27:17
AC	张峻熙	7ms	436 KiB		221 Bytes	2022-10-31 21:13:27
AC	李树崑 (lishukun)	7ms	384 KiB		316 Bytes	2022-3-11 19:58:16
AC	明轩 (吕同学)	7ms	428 KiB		224 Bytes	2022-8-3 21:27:20
AC	明哲瀚 (18580067605)	7ms	512 KiB		245 Bytes	2022-9-9 18:33:17
AC	Aphrode	7ms	6.8 MiB		266 Bytes	2023-6-23 13:28:35
AC	叶令子	7ms	6.8 MiB		236 Bytes	2023-10-27 20:13:17
AC	Tang	7ms	384 KiB		238 Bytes	2022-2-26 9:58:01
AC	喻兴诚 (Brian)	7ms	384 KiB		260 Bytes	2022-3-6 19:45:24
AC	谢延灏 (xeiyanhao---a handsome boy)	7ms	448 KiB		225 Bytes	2022-2-27 19:46:48
AC	黄梓桐 (HuangZiTong)	7ms	392 KiB		213 Bytes	2022-10-7 17:15:16
AC	liuyuchen	7ms	392 KiB		227 Bytes	2023-2-12 15:51:37
AC	邹曜丞 (13983097018)	7ms	392 KiB		218 Bytes	2023-4-15 20:18:52
AC	王祎辰 (wangyichen)	7ms	7 MiB		248 Bytes	2023-7-16 14:42:28
AC	叶哲宇 (yzy)	7ms	384 KiB		225 Bytes	2023-4-8 11:43:34
AC	南坪校区-龙浩睿 (longhaorui)	7ms	428 KiB		222 Bytes	2023-2-11 18:00:28
AC	ywh	7ms	384 KiB		262 Bytes	2022-1-25 13:37:02
AC	我全家SB！！！我没母！！！ (baijinlin)	7ms	512 KiB		233 Bytes	2023-2-11 18:14:52
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	7ms	400 KiB		292 Bytes	2022-1-23 18:35:25
AC	我是蔡徐坤 (任晋辉)	7ms	6.7 MiB		222 Bytes	2023-9-23 18:50:01
AC	dinghaoyan1	7ms	384 KiB		275 Bytes	2022-9-7 20:49:58
AC	俞文博	7ms	388 KiB		227 Bytes	2022-4-9 19:33:25
AC	冒牌陈杰晟【MOD】 (wed)	7ms	412 KiB		233 Bytes	2022-2-26 16:51:08
AC	陈奕瑾 (shenxiulinyue)	7ms	436 KiB		207 Bytes	2022-4-28 21:28:58
AC	Jack	7ms	436 KiB		244 Bytes	2022-8-2 17:04:27
AC	05c35-hhw	7ms	436 KiB		243 Bytes	2022-6-6 15:53:37
AC	唐彬献	7ms	7.1 MiB		211 Bytes	2023-10-21 12:08:25
AC	炸鱼4000+ (dxc)	7ms	7 MiB	C++14(O2)	217 Bytes	2024-6-23 16:46:31
AC	十七	7ms	6.6 MiB	C++20	239 Bytes	2024-7-30 11:58:16
AC	俞伏羲	7ms	384 KiB		233 Bytes	2023-2-12 15:49:02
AC	hxb	7ms	432 KiB		254 Bytes	2023-3-5 11:21:04
AC	xzf	7ms	7.5 MiB		441 Bytes	2023-10-21 20:18:56
AC	not_None	7ms	384 KiB		333 Bytes	2022-1-27 18:09:23
AC	. (Pig)	7ms	384 KiB		246 Bytes	2022-3-6 9:25:23
AC	(05c35-cyd)	7ms	384 KiB		248 Bytes	2022-3-6 16:50:02
AC	18523558128zcn	7ms	384 KiB		217 Bytes	2022-4-9 14:19:50
AC	wangshuo	7ms	392 KiB		235 Bytes	2022-9-18 11:59:55
AC	彭粤庭 (JJlinCN)	7ms	7.1 MiB	C++11	254 Bytes	2024-4-19 18:57:42
AC	牟淳雅	7ms	6.7 MiB		213 Bytes	2023-9-17 19:41:26
AC	侯治鋆	7ms	392 KiB		206 Bytes	2022-4-5 11:28:53
AC	yangbinyu	7ms	432 KiB		233 Bytes	2022-9-20 21:13:39
AC	时代2校-程俊燃 (chengjunran)	7ms	512 KiB		232 Bytes	2023-4-8 20:20:13
AC	杜是贤 (dushixian)	7ms	444 KiB		222 Bytes	2022-3-9 20:10:56
AC	天之渺 (05c41-dd)	7ms	432 KiB		226 Bytes	2022-6-4 19:04:47
AC	许炜铭 (xuweiming)	7ms	6.8 MiB		244 Bytes	2023-6-10 22:08:45
AC	^_^ (ctc)	7ms	436 KiB		230 Bytes	2022-12-7 10:49:29
AC	邹曜丞 (13983097018)	7ms	384 KiB		218 Bytes	2023-4-15 20:18:52
AC	明哲瀚 (18580067605)	7ms	384 KiB		245 Bytes	2022-9-9 18:33:28
AC	(05c35-cyd)	7ms	384 KiB		248 Bytes	2022-3-6 16:50:00
AC	zzl	7ms	6.8 MiB		248 Bytes	2023-11-6 20:48:47
AC	肖艺勋2	7ms	6.7 MiB	C++17	306 Bytes	2024-7-20 16:27:14
AC	熊奕博 (Mothefuck)	7ms	384 KiB		271 Bytes	2022-8-24 20:59:50
AC	杨子力	7ms	392 KiB		233 Bytes	2022-3-6 20:15:56
AC	Ronnie	7ms	440 KiB		259 Bytes	2022-2-11 15:34:28
AC	My name is Man (钟卓劭)	7ms	7.2 MiB	C++98	222 Bytes	2024-6-23 14:00:54
AC	李玥漪	7ms	392 KiB		306 Bytes	2022-2-21 21:30:06
AC	yuqihao	7ms	7.1 MiB		221 Bytes	2023-10-21 11:50:38
AC	吴恩子	7ms	6.7 MiB		217 Bytes	2023-9-27 19:51:41
AC	CWj	7ms	432 KiB		241 Bytes	2023-2-11 11:32:04
AC	chenyifei	7ms	384 KiB		228 Bytes	2022-8-27 17:09:30
AC	拥抱幸福小熊(吴沛篪)	7ms	7.2 MiB		215 Bytes	2023-10-21 11:25:48
AC	zhangxinchen	7ms	384 KiB		220 Bytes	2022-4-5 13:54:32
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)	7ms	440 KiB		286 Bytes	2022-9-21 19:15:16
AC	孙嘉蔚	7ms	7.1 MiB		236 Bytes	2024-1-13 17:51:48
AC	冉宸语	7ms	432 KiB		236 Bytes	2023-3-12 16:52:33
AC	冯若涵	7ms	7.1 MiB		191 Bytes	2023-10-21 11:54:38
AC	zvt_132 (任子轩)	7ms	6.7 MiB		206 Bytes	2023-9-23 14:46:06
AC	黄泓翔	7ms	384 KiB		227 Bytes	2022-10-30 15:08:20
AC	呵 (mohaoran)	7ms	512 KiB		218 Bytes	2022-8-27 22:53:38
AC	童艺涵	7ms	512 KiB		254 Bytes	2022-12-3 20:02:02
AC	原著校区巫映秋 (巫映秋1a)	7ms	384 KiB		224 Bytes	2022-10-30 15:23:55
AC	曹埊睿 (caodirui)	7ms	384 KiB		252 Bytes	2023-3-21 19:00:51
AC	ttt123	7ms	392 KiB		228 Bytes	2023-4-20 13:16:47
AC	李绪航	7ms	6.7 MiB		272 Bytes	2023-9-16 17:15:57