希蒙开灯

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵泳鑫 (zhaoyongxin)	15ms	436 KiB		338 Bytes	2022-4-23 17:54:43
AC	22029-zjs	15ms	384 KiB		393 Bytes	2023-3-16 20:54:03
AC	22029-zjs	15ms	404 KiB		393 Bytes	2023-3-16 20:54:08
AC	ganlin1	15ms	6.9 MiB		261 Bytes	2023-7-28 14:06:59
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	6.5 MiB		309 Bytes	2023-11-19 13:57:57
AC	wuqi	15ms	6.9 MiB		392 Bytes	2023-8-10 15:27:47
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	15ms	436 KiB		751 Bytes	2022-2-25 19:52:21
AC	zcx	15ms	384 KiB		345 Bytes	2023-3-23 19:15:20
AC	22029-zjs	15ms	392 KiB		393 Bytes	2023-3-16 20:54:08
AC	罗兰（漆黑襟默) (zhangxiaoci)	15ms	384 KiB		307 Bytes	2023-4-15 15:49:40
AC	王康瑞	15ms	7.4 MiB		290 Bytes	2023-12-16 11:30:02
AC	22029-zjs	15ms	384 KiB		393 Bytes	2023-3-16 20:54:08
AC	22029-zjs	15ms	384 KiB		393 Bytes	2023-3-16 20:54:08
AC	稻妻第一深情 (喝酒の吟游诗人)	15ms	440 KiB		1.6 KiB	2023-3-12 0:28:50
AC	杨朔	15ms	7 MiB		336 Bytes	2023-12-16 11:47:01
AC	11451254188 (22029-mjh)	15ms	388 KiB		340 Bytes	2023-3-18 10:07:10
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)	15ms	436 KiB		339 Bytes	2023-3-16 20:18:01
AC	RanHao	15ms	6.9 MiB		558 Bytes	2023-7-22 19:41:10
AC	漆星语 (qixingyu)	15ms	6.8 MiB		364 Bytes	2023-7-1 9:26:16
AC	chen (peter)	15ms	452 KiB		315 Bytes	2023-3-18 20:23:48
AC	Tender. (05c05-zhou)	15ms	664 KiB		1.3 KiB	2022-10-18 11:43:53
AC	huanglu	15ms	7 MiB		269 Bytes	2023-7-18 16:10:14
AC	缥 (王硕2012)	15ms	440 KiB		313 Bytes	2023-3-23 19:11:45
AC	金沙校区-蓝祥与 (蓝祥与)	15ms	392 KiB		319 Bytes	2023-4-15 15:49:53
AC	李哲 (lizhe)	15ms	548 KiB		343 Bytes	2022-10-29 17:37:10
AC	10255	15ms	444 KiB		352 Bytes	2022-12-31 14:42:24
AC	liujingxing(我要李毛川!) (liujingxing)	15ms	6.7 MiB		390 Bytes	2023-9-5 19:02:54
AC	刘锦航	15ms	428 KiB		374 Bytes	2023-3-18 20:11:05
AC	时代二校+王吕棪 (wanglvyan)	15ms	6.7 MiB		350 Bytes	2023-9-9 16:10:56
AC	金沙—彭智宸 (彭智宸)	15ms	6.9 MiB		276 Bytes	2023-8-19 8:35:27
AC	新壹街校区-付宇轩 (fyx)	15ms	6.9 MiB		276 Bytes	2023-7-24 16:19:50
AC	scallway	15ms	6.8 MiB		281 Bytes	2023-7-1 11:25:03
AC	yuqihao	15ms	7.4 MiB		302 Bytes	2023-12-16 11:38:34
AC	熊海阳 (xiongxaiyang)	16ms	6.9 MiB		308 Bytes	2023-8-13 11:47:31
AC	叶哲宇 (yzy)	16ms	6.7 MiB		318 Bytes	2023-9-2 11:43:06
AC	10255	16ms	440 KiB		357 Bytes	2022-11-24 20:14:21
AC	22029-zjs	16ms	400 KiB		393 Bytes	2023-3-16 20:54:08
AC	22029-zjs	16ms	392 KiB		393 Bytes	2023-3-16 20:54:07
AC	不怎么聪明的家伙 (贺俊楠)	16ms	7 MiB		308 Bytes	2024-1-14 11:10:18
AC	孔思鳗	16ms	7 MiB		305 Bytes	2023-12-16 12:01:25
AC	爱琴海校区-刁钲洋 (刁钲洋)	16ms	6.9 MiB		544 Bytes	2023-8-4 19:55:02
AC	yanglang	16ms	440 KiB		242 Bytes	2022-10-30 10:58:23
AC	Jack	16ms	436 KiB		495 Bytes	2023-1-11 9:33:57
AC	ttt123	16ms	444 KiB		464 Bytes	2022-8-7 14:11:09
AC	22029-lsl	16ms	384 KiB		335 Bytes	2023-3-18 10:09:01
AC	xuniaoyin (徐袅音)	17ms	6.9 MiB		481 Bytes	2023-8-6 20:11:19
AC	任童(rentong)	17ms	432 KiB		469 Bytes	2022-12-16 14:22:52
AC	11451254188 (22029-mjh)	17ms	432 KiB		306 Bytes	2023-3-15 20:56:35
AC	郭睿	17ms	6.8 MiB		303 Bytes	2023-11-17 22:20:21
AC	colin1112 (墙凌可)	17ms	7.1 MiB		355 Bytes	2023-11-11 11:14:46
AC	郑岐蔚	18ms	448 KiB		765 Bytes	2023-1-26 14:46:45
AC	贾博涵	18ms	7.2 MiB		355 Bytes	2023-12-11 11:18:02
AC	童艺涵	20ms	384 KiB		264 Bytes	2023-4-15 15:48:51
AC	Guest	20ms	7.4 MiB		313 Bytes	2023-12-16 11:38:26
AC	拥抱幸福小熊(吴沛篪)	21ms	7.1 MiB		226 Bytes	2023-12-16 11:01:32
AC	胡澜之 (666hlz666)	21ms	7.1 MiB		279 Bytes	2023-11-11 11:16:21
AC	lizhengqian19	21ms	6.8 MiB		435 Bytes	2023-6-12 15:42:26
AC	炸鱼4000+ (dxc)	22ms	7.2 MiB		282 Bytes	2023-11-29 21:49:14
AC	zyl	23ms	7.3 MiB		430 Bytes	2024-1-5 15:39:05
AC	唐彬献	24ms	7 MiB		313 Bytes	2023-12-16 11:56:23
AC	张雯皓 (zhangwenhao)	26ms	7 MiB		313 Bytes	2023-12-23 11:24:10
AC	guozuming	26ms	444 KiB		321 Bytes	2022-12-10 18:29:20
AC	陈红恺 (chk)	31ms	4.3 MiB		256 Bytes	2022-8-26 14:59:51
AC	黄立信	57ms	768 KiB		361 Bytes	2024-2-14 8:50:27
AC	yuchenyi23017	66ms	532 KiB		297 Bytes	2024-1-28 15:24:06
AC	lizishuo	67ms	552 KiB		324 Bytes	2024-2-18 16:57:06
AC	杨镇宇	68ms	536 KiB		318 Bytes	2024-3-15 17:48:21
AC	杨博文05	73ms	548 KiB	C++98	336 Bytes	2024-9-1 13:01:03
AC	新壹街校区-陈品烨 (陈品烨)	74ms	768 KiB	C++98	297 Bytes	2024-9-9 13:25:57
AC	fcxin	136ms	9.4 MiB	Python 3	287 Bytes	2024-8-15 13:25:12
AC	猫不理包子	186ms	9.1 MiB	Python 3	273 Bytes	2023-9-28 17:03:10
AC	高俊	192ms	9.1 MiB	Python 3	473 Bytes	2023-9-29 11:22:52
AC	wawa	205ms	4 MiB	Python 3	273 Bytes	2022-8-2 16:29:18
AC	kongql	206ms	4 MiB	Python 3	242 Bytes	2022-7-28 15:11:40
AC	cola	213ms	4 MiB	Python 3	327 Bytes	2022-12-28 15:24:08
AC	Qinxiu	537ms	3.8 MiB	Python 3	194 Bytes	2024-2-2 10:52:24
AC	Qinxiu	550ms	3.8 MiB	Python 3	194 Bytes	2024-2-18 17:44:57