希蒙跳楼梯

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代二校-王盼兮 (wangpanxi)	18ms	7.4 MiB		211 Bytes	2024-1-21 11:10:49
AC	Accepted (周芷乐)	25ms	6.7 MiB	C++14	208 Bytes	2024-7-20 12:12:31
AC	李山水	25ms	384 KiB		240 Bytes	2022-5-14 19:38:59
AC	黄俊皓	25ms	396 KiB		256 Bytes	2022-5-14 19:47:08
AC	hulang	25ms	384 KiB		253 Bytes	2022-5-14 19:46:02
AC	谢雨贝	25ms	7 MiB	C++20(O2)	274 Bytes	2024-6-19 19:47:45
AC	文硕 (文硕1)	25ms	392 KiB		233 Bytes	2022-7-12 13:40:14
AC	zhangxiushi	26ms	428 KiB		252 Bytes	2022-5-14 19:38:26
AC	李倾城的忠实假粉 (向熠可)	26ms	384 KiB		214 Bytes	2022-3-29 21:21:15
AC	tongxiao	26ms	7 MiB	C++20(O2)	378 Bytes	2024-6-19 19:46:06
AC	李山水	26ms	384 KiB		240 Bytes	2022-5-14 19:39:25
AC	赵泳鑫 (zhaoyongxin)	26ms	384 KiB		221 Bytes	2022-5-14 19:31:50
AC	(张洛诚)	26ms	392 KiB		206 Bytes	2023-5-10 20:28:09
AC	Error404sans (焦阳浩云)	27ms	7 MiB	C++20(O2)	1.5 KiB	2024-6-19 19:47:16
AC	22029-zjs	27ms	392 KiB		184 Bytes	2023-5-15 19:52:00
AC	在煎鱼的肖大总铳 (肖宇航)	27ms	6.7 MiB		247 Bytes	2023-9-29 8:58:30
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)	27ms	392 KiB		239 Bytes	2023-5-13 11:28:17
AC	11451254188 (22029-mjh)	27ms	384 KiB		193 Bytes	2023-5-13 11:21:19
AC	wuqilin	27ms	424 KiB		184 Bytes	2023-5-19 20:49:36
AC	zzzrrrxxx	27ms	7.2 MiB		246 Bytes	2024-1-22 16:59:36
AC	王重道	27ms	384 KiB		210 Bytes	2023-5-19 20:37:13
AC	肖添宇	28ms	384 KiB		204 Bytes	2022-5-14 19:38:33
AC	贾鑫豪 (Mr Sam)	28ms	512 KiB		186 Bytes	2023-5-6 15:06:58
AC	时代二校-焦雨齐 (Angel)	28ms	6.9 MiB		226 Bytes	2023-10-21 18:00:24
AC	新壹街校区-周士杰 (zsj)	28ms	436 KiB		176 Bytes	2023-5-7 18:19:30
AC	郑岐蔚	28ms	504 KiB		219 Bytes	2023-4-12 19:54:46
AC	22029-lsl	28ms	384 KiB		212 Bytes	2023-5-13 11:27:48
AC	杨颂恩 (yangsongen)	28ms	6.7 MiB		801 Bytes	2023-8-24 20:14:55
AC	MoonLight ( aaa)	29ms	444 KiB		241 Bytes	2022-8-10 9:50:16
AC	你猜呀	29ms	6.9 MiB		211 Bytes	2023-9-10 10:35:19
AC	疯神芭芭脱丝 (李卓修)	29ms	504 KiB		221 Bytes	2022-7-12 11:35:33
AC	zcx	29ms	512 KiB		203 Bytes	2023-5-13 11:13:59
AC	zzy	29ms	7 MiB		233 Bytes	2023-6-17 16:10:18
AC	赵沛喆	29ms	436 KiB		181 Bytes	2022-9-2 12:28:12
AC	ttt123	30ms	392 KiB		204 Bytes	2023-5-13 11:27:00
AC	scallway	30ms	6.8 MiB		226 Bytes	2023-9-10 10:55:36
AC	朱老师 (zyp)	31ms	512 KiB		224 Bytes	2022-10-3 23:13:48
AC	姚宏逸	31ms	444 KiB		246 Bytes	2023-3-16 21:11:41
AC	欧俊阳	31ms	6.7 MiB		723 Bytes	2023-8-25 13:26:21
AC	坤坤荔枝小黑子 (zhonghaotian22006)	32ms	512 KiB		229 Bytes	2022-11-6 18:47:32
AC	曹埊睿 (caodirui)	32ms	440 KiB		227 Bytes	2023-6-3 11:21:37
AC	姚宏逸	32ms	400 KiB		753 Bytes	2022-11-28 20:15:57
AC	RanHao	34ms	7.7 MiB		247 Bytes	2023-8-25 17:24:43
AC	guozuming	34ms	512 KiB		166 Bytes	2023-1-10 16:27:41
AC	周靖松 (ZhouJS)	39ms	7 MiB		216 Bytes	2023-7-20 17:05:52
AC	zyl	49ms	7 MiB		193 Bytes	2024-1-24 13:30:38
AC	cupy战士 (05c05-dkf)	51ms	7.3 MiB		227 Bytes	2024-1-24 9:48:41
AC	金沙校区-曹皓扬 (曹皓扬)	121ms	764 KiB		809 Bytes	2024-3-24 11:17:50
AC	洛阳锦程 (郭思利)	122ms	764 KiB		273 Bytes	2024-3-24 11:22:01
AC	孙烽轶 (sfy)	127ms	764 KiB		200 Bytes	2024-3-4 20:19:17
AC	张梓浩 (zhangzihao)	134ms	764 KiB		226 Bytes	2024-3-31 9:45:49
AC	时代校区-孔令皓 (konglinghao)	134ms	536 KiB		273 Bytes	2024-3-24 11:16:54
AC	U城校区-邓皓月 (邓皓月)	134ms	532 KiB		279 Bytes	2024-3-24 11:16:38
AC	金沙校区-鲜腾俊 (junjun)	137ms	764 KiB		273 Bytes	2024-3-24 11:20:23
AC	tongxiao	153ms	7 MiB	C++20(O2)	349 Bytes	2024-6-19 19:44:09
AC	zcx	190ms	444 KiB		266 Bytes	2023-5-8 19:57:17
AC	ttt123	190ms	420 KiB		238 Bytes	2023-5-12 16:58:21
AC	zhangyh (张育菡)	190ms	404 KiB		260 Bytes	2022-6-3 8:26:26
AC	陈一锋 (cyf01)	193ms	424 KiB		191 Bytes	2022-6-29 18:55:40
AC	zhm123	195ms	432 KiB		206 Bytes	2023-4-7 19:28:32
AC	执剑人罗辑 (Jasson)	196ms	424 KiB		193 Bytes	2023-5-19 21:20:10
AC	黄梓轩 (huangzixuan)	198ms	424 KiB		189 Bytes	2023-5-25 20:32:32
AC	林小博	199ms	440 KiB		269 Bytes	2022-12-10 13:37:18
AC	colin1112 (墙凌可)	200ms	7 MiB		228 Bytes	2023-5-31 15:30:54
AC	王乐仪	200ms	512 KiB		213 Bytes	2022-7-6 17:25:54
AC	徐康景 (dcm)	202ms	428 KiB		239 Bytes	2022-12-10 11:06:58
AC	panyan	202ms	512 KiB		239 Bytes	2022-12-10 13:41:02
AC	缥 (王硕2012)	203ms	424 KiB		336 Bytes	2023-5-13 18:40:02
AC	时代一校-赵彦博 (zyb)	205ms	6.9 MiB		228 Bytes	2023-7-30 17:55:13
AC	Jose (反恐皮蛋)	206ms	436 KiB		350 Bytes	2022-7-27 8:58:14
AC	Tender. (05c05-zhou)	206ms	432 KiB		217 Bytes	2022-11-25 10:40:54
AC	陈杰晟	206ms	640 KiB		293 Bytes	2022-3-24 13:53:52
AC	ttt123	207ms	428 KiB		328 Bytes	2023-5-13 12:17:48
AC	胡宸华 (huchenhua)	207ms	6.9 MiB		235 Bytes	2023-8-20 20:11:12
AC	奇怪的正义人！ (leweiqi)	208ms	500 KiB		237 Bytes	2022-7-17 16:32:18
AC	马渝杭 (mayuhang)	209ms	432 KiB		203 Bytes	2023-5-21 13:00:20
AC	程子杰 (05c41-czj)	210ms	420 KiB		200 Bytes	2022-6-29 19:05:21
AC	dengduxi	210ms	432 KiB		198 Bytes	2023-4-19 20:25:44
AC	余龙恩---来自额嘛瑞卡 (yulongenshijieshangzuishuai)	212ms	424 KiB		292 Bytes	2022-1-23 10:51:40
AC	huanglu	214ms	440 KiB		293 Bytes	2023-4-28 21:31:59
AC	陈风亦 (chenfengyi)	216ms	512 KiB		198 Bytes	2022-12-10 13:38:34
AC	17779	219ms	440 KiB		256 Bytes	2022-4-18 14:50:11
AC	huyinuo	222ms	512 KiB		222 Bytes	2022-7-6 13:33:52
AC	_PXY_	223ms	512 KiB		239 Bytes	2022-1-23 11:22:19
AC	曾龙兮	225ms	512 KiB		206 Bytes	2023-1-9 18:00:40
AC	周琪渃	230ms	512 KiB		299 Bytes	2023-5-13 17:55:46
AC	ttt123	235ms	432 KiB		338 Bytes	2023-5-13 12:21:16
AC	86想要钱 (twt)	237ms	512 KiB		230 Bytes	2023-1-9 18:01:48
AC	谭红中 (不知道)	241ms	436 KiB		190 Bytes	2023-1-20 13:26:42
AC	zlx (xiao)	243ms	512 KiB		253 Bytes	2022-11-26 20:05:50
AC	wangjun	244ms	7.3 MiB		246 Bytes	2023-11-18 19:32:04
AC	牟淳雅	249ms	6.7 MiB		162 Bytes	2023-9-24 14:22:54
AC	王晨志 (wangchenzhi)	256ms	512 KiB		442 Bytes	2022-2-1 16:51:28
AC	中岛敦 (黄麒瑞)	277ms	6.7 MiB		169 Bytes	2023-9-29 9:01:09
AC	不怎么聪明的家伙 (贺俊楠)	280ms	6.8 MiB		175 Bytes	2023-9-24 12:17:46
AC	新壹街校区-杨轩懿 (杨轩懿1)	284ms	6.7 MiB		158 Bytes	2023-9-24 12:24:00
AC	梨冻亿 (wiueh)	410ms	3.9 MiB	Python 3	219 Bytes	2022-1-23 20:13:48
AC	金沙校区 - 刘昱辰 (liuyuchen002)	436ms	716 KiB		191 Bytes	2024-3-24 11:17:58
AC	金沙-文豪 (wenhao)	442ms	7 MiB		250 Bytes	2023-12-16 13:43:37
AC	新壹街—熊轩杭 (xiongxuanhang)	459ms	7 MiB		262 Bytes	2024-1-20 10:32:00