叠罗汉

状态	递交者	时间	内存	语言	代码	递交时间
AC	丛林 (conglin)	1ms	384 KiB		291 Bytes	2022-12-2 17:07:08
AC	炸鱼4000+ (dxc)	1ms	384 KiB		174 Bytes	2023-4-11 19:56:11
AC	谢延灏 (xeiyanhao---a handsome boy)	1ms	440 KiB		223 Bytes	2022-1-22 17:20:23
AC	李廷旭 (litingxu)	1ms	384 KiB		180 Bytes	2023-5-7 15:37:17
AC	张泰凌 (ztl)	1ms	384 KiB		196 Bytes	2022-3-18 19:32:55
AC	jiangjc	1ms	384 KiB		150 Bytes	2023-5-28 15:35:15
AC	某某某	1ms	392 KiB		157 Bytes	2022-4-16 15:47:00
AC	22029-zjs	1ms	384 KiB		233 Bytes	2023-2-11 9:58:42
AC	陈星亦 (cxy01)	1ms	384 KiB		132 Bytes	2022-10-6 14:41:53
AC	低调的学霸	1ms	384 KiB		161 Bytes	2022-8-17 16:01:22
AC	德意志第三帝国 (陈远桥)	1ms	384 KiB		239 Bytes	2022-3-14 19:57:24
AC	冉宸语	1ms	384 KiB		185 Bytes	2022-10-23 15:12:18
AC	liuyuchen	1ms	384 KiB		177 Bytes	2023-2-5 15:25:09
AC	邹曜丞 (13983097018)	1ms	384 KiB		172 Bytes	2023-5-7 12:14:57
AC	姚宏逸	1ms	384 KiB		177 Bytes	2022-1-9 11:26:53
AC	草\|\|草 (陈星佑)	1ms	384 KiB		166 Bytes	2022-1-25 11:39:56
AC	杨睎尧	1ms	336 KiB		178 Bytes	2022-1-25 11:33:21
AC	(俞伏羲)	1ms	384 KiB		163 Bytes	2023-2-5 15:23:47
AC	18523558128zcn	1ms	384 KiB		192 Bytes	2022-4-9 13:52:37
AC	关博源	1ms	384 KiB		182 Bytes	2023-2-25 10:08:01
AC	刘蕤箎	1ms	384 KiB		155 Bytes	2023-2-18 9:46:23
AC	叶雨昊 (yeyuhao22006)	1ms	384 KiB		214 Bytes	2022-3-24 17:38:24
AC	赵彬鸿	1ms	384 KiB		178 Bytes	2022-1-25 11:30:33
AC	任舒尧	1ms	384 KiB		276 Bytes	2023-2-1 10:07:04
AC	黄相茗	1ms	384 KiB		175 Bytes	2022-4-6 21:17:21
AC	金沙校区-蓝祥与 (蓝祥与)	1ms	384 KiB		235 Bytes	2022-11-29 17:36:35
AC	草\|\|草 (陈星佑)	1ms	384 KiB		230 Bytes	2022-6-5 11:04:49
AC	低调的学霸	1ms	384 KiB		161 Bytes	2022-8-17 16:01:15
AC	希蒙 (zhengxingya)	1ms	6.7 MiB		164 Bytes	2023-7-24 19:45:25
AC	低调的学霸	1ms	384 KiB		161 Bytes	2022-8-17 16:01:15
AC	龙吉先 (ljx)	1ms	384 KiB		168 Bytes	2023-2-4 11:33:39
AC	易锦程 (sky)	1ms	384 KiB		180 Bytes	2023-3-4 11:01:01
AC	李树崑 (lishukun)	1ms	384 KiB		234 Bytes	2022-2-26 16:14:41
AC	Randy Marsh (杨子腾)	1ms	384 KiB		193 Bytes	2022-9-28 19:03:45
AC	pwf	1ms	384 KiB		344 Bytes	2022-9-3 11:29:57
AC	Z.饮月君 (张皓南)	1ms	384 KiB		174 Bytes	2022-2-13 11:29:06
AC	hangge	1ms	384 KiB		199 Bytes	2023-5-29 19:03:19
AC	SHY20091224	1ms	384 KiB		215 Bytes	2022-8-17 15:49:45
AC	Nico	1ms	384 KiB		170 Bytes	2022-12-23 15:40:09
AC	罗元邑	1ms	384 KiB		155 Bytes	2023-2-10 21:30:14
AC	李山水	1ms	384 KiB		193 Bytes	2022-2-16 17:03:09
AC	xxteacher	1ms	384 KiB		148 Bytes	2022-1-25 15:43:32
AC	疯神芭芭脱丝 (李卓修)	1ms	384 KiB		254 Bytes	2022-1-22 18:15:36
AC	李廷旭 (litingxu)	1ms	384 KiB		170 Bytes	2023-3-19 18:10:43
AC	低调的学霸	1ms	384 KiB		161 Bytes	2022-8-17 16:01:16
AC	dengfeng	1ms	384 KiB		210 Bytes	2022-2-17 10:59:28
AC	huyinuo	1ms	376 KiB		157 Bytes	2022-2-15 21:03:21
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	1ms	384 KiB		151 Bytes	2022-8-27 20:24:59
AC	ganlin1	1ms	384 KiB		203 Bytes	2023-5-14 13:46:03
AC	ren (陈苡心)	1ms	384 KiB		162 Bytes	2023-5-7 15:43:58
AC	江政含	1ms	6.6 MiB		163 Bytes	2023-7-4 20:22:25
AC	lkz	1ms	384 KiB		162 Bytes	2023-5-7 18:24:06
AC	吴佳智 (AWM)	1ms	384 KiB		187 Bytes	2023-2-4 11:15:55
AC	ren (陈苡心)	1ms	384 KiB		162 Bytes	2023-5-7 15:43:57
AC	yzl	1ms	512 KiB		157 Bytes	2022-4-9 19:05:05
AC	zhuyvbing	1ms	384 KiB		161 Bytes	2022-10-29 12:01:54
AC	1 (秦子栋)	1ms	384 KiB		163 Bytes	2023-5-7 15:44:24
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	1ms	384 KiB		139 Bytes	2022-9-3 17:10:10
AC	zhoulinjun	1ms	384 KiB		175 Bytes	2023-1-1 18:03:47
AC	陈于硕(我™的) (chenyu)	1ms	384 KiB		163 Bytes	2023-3-4 11:24:38
AC	chenyifei	1ms	384 KiB		179 Bytes	2022-8-27 17:06:07
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	1ms	384 KiB		151 Bytes	2022-8-27 20:24:39
AC	科比.布莱恩特 (董浩琰)	1ms	6.8 MiB		575 Bytes	2023-7-21 9:45:21
AC	向南地	1ms	384 KiB		230 Bytes	2022-2-19 9:53:26
AC	yuanminghong	1ms	348 KiB		158 Bytes	2023-1-1 18:21:28
AC	任童(rentong)	1ms	384 KiB		169 Bytes	2022-3-19 16:22:26
AC	凌肯 (lingken22006)	1ms	384 KiB		247 Bytes	2022-6-3 19:23:06
AC	伍芷函	1ms	384 KiB		190 Bytes	2022-8-24 10:02:19
AC	dengduxi	1ms	384 KiB		166 Bytes	2022-11-27 11:45:44
AC	赵彬鸿	1ms	392 KiB		178 Bytes	2022-1-25 11:30:36
AC	我是周靖松长得帅 (mouyunqi)	1ms	6.9 MiB		158 Bytes	2023-6-24 15:23:19
AC	马渝杭 (mayuhang)	1ms	384 KiB		182 Bytes	2023-3-21 18:49:35
AC	zzzrrrxxx	1ms	384 KiB		242 Bytes	2023-5-28 19:00:13
AC	何星震 (Jacob)	1ms	352 KiB		158 Bytes	2022-9-30 21:28:02
AC	ych	1ms	384 KiB		207 Bytes	2023-2-4 11:05:53
AC	罗宇凡 (吴彦祖)	1ms	384 KiB		234 Bytes	2022-3-3 20:34:55
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB	C++	175 Bytes	2022-4-1 12:07:47
AC	cupy战士 (05c05-dkf)	1ms	384 KiB		172 Bytes	2022-6-5 15:27:39
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	1ms	364 KiB		204 Bytes	2022-3-1 21:40:52
AC	谭懿轩 (yanyixuan)	1ms	384 KiB		171 Bytes	2022-3-17 17:26:28
AC	zhuqiwei22006	1ms	384 KiB		161 Bytes	2022-4-13 20:31:54
AC	邵冠铖 (shaoguancheng22031)	1ms	384 KiB		149 Bytes	2022-12-8 13:38:05
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)	1ms	384 KiB		248 Bytes	2023-5-16 19:07:51
AC	千千万万	1ms	384 KiB		166 Bytes	2023-1-1 18:13:30
AC	谭懿轩 (yanyixuan)	1ms	384 KiB		171 Bytes	2022-1-16 16:57:06
AC	Randy Marsh (杨子腾)	1ms	384 KiB		193 Bytes	2022-4-17 11:36:25
AC	赵彬鸿	1ms	392 KiB		178 Bytes	2022-1-25 11:30:35
AC	新壹街罗田雨 (罗田雨29)	1ms	6.9 MiB		225 Bytes	2023-8-5 18:05:01
AC	zhm123	1ms	384 KiB		165 Bytes	2022-10-8 16:24:11
AC	江科毅 (jky)	1ms	6.7 MiB		174 Bytes	2023-6-7 20:15:16
AC	Steven (王梓丞)	1ms	384 KiB		166 Bytes	2022-3-26 15:47:57
AC	六 (江智昕)	1ms	384 KiB		274 Bytes	2023-3-17 20:18:13
AC	国林泽 (guolinze)	1ms	384 KiB		154 Bytes	2022-3-2 21:32:29
AC	zhangzhichen	1ms	364 KiB		217 Bytes	2023-5-11 19:08:15
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	1ms	384 KiB		138 Bytes	2022-9-22 20:22:00
AC	¿¿¿??? (李睿瞳)	1ms	384 KiB		164 Bytes	2023-2-4 11:00:56
AC	谢博文	1ms	384 KiB		180 Bytes	2022-2-12 21:02:24
AC	赵彬鸿	1ms	384 KiB		178 Bytes	2022-1-25 11:30:35
AC	徐钒予	1ms	384 KiB		167 Bytes	2023-1-1 18:08:07
AC	qinyi	1ms	384 KiB		294 Bytes	2022-2-26 16:29:49