希蒙查房-1

状态	递交者	时间	内存	语言	代码	递交时间
AC	黄立信	2ms	7 MiB		711 Bytes	2023-11-12 21:58:55
AC	colin1112 (墙凌可)	3ms	7.4 MiB		477 Bytes	2023-11-11 11:10:18
AC	luoluonuoya	7ms	384 KiB		518 Bytes	2022-8-4 13:49:32
AC	杜俊宏	7ms	384 KiB		388 Bytes	2022-6-4 16:12:18
AC	LittleHair	7ms	6.7 MiB	C++11	471 Bytes	2024-7-12 23:27:14
AC	谭懿轩 (yanyixuan)	7ms	384 KiB		377 Bytes	2022-7-19 16:06:53
AC	曹埊睿 (caodirui)	7ms	384 KiB		441 Bytes	2023-5-8 19:09:51
AC	曾翊洋 (海洋万象)	7ms	384 KiB		524 Bytes	2023-4-28 20:59:49
AC	郑妍汐	7ms	392 KiB		453 Bytes	2022-5-11 17:20:09
AC	伍行念 (wuxingnian)	7ms	6.8 MiB		697 Bytes	2023-10-10 10:04:08
AC	陈杰晟	7ms	384 KiB		411 Bytes	2022-3-24 16:12:11
AC	Guest	8ms	7.2 MiB	C++98(O2)	404 Bytes	2024-4-30 15:44:35
AC	王晨志 (wangchenzhi)	8ms	388 KiB		741 Bytes	2022-6-19 6:21:29
AC	chen (peter)	8ms	392 KiB		502 Bytes	2022-7-19 14:29:23
AC	无尽的想象 (谭仕高)	8ms	384 KiB		371 Bytes	2022-7-31 11:47:15
AC	周靖松 (ZhouJS)	8ms	384 KiB		358 Bytes	2023-4-15 15:17:35
AC	赵泳鑫 (zhaoyongxin)	8ms	384 KiB		456 Bytes	2022-7-9 17:01:06
AC	时代一校 - 冯隆浩 (冯隆浩)	8ms	392 KiB		353 Bytes	2022-7-2 19:41:59
AC	1396013295	8ms	384 KiB		602 Bytes	2022-1-22 19:16:00
AC	MoonLight ( aaa)	8ms	384 KiB		449 Bytes	2022-1-25 12:11:05
AC	疯神芭芭脱丝 (李卓修)	8ms	392 KiB		474 Bytes	2022-7-9 17:13:40
AC	leisixian (22029-lyh)	8ms	384 KiB		602 Bytes	2022-12-31 9:57:51
AC	朱老师 (zyp)	8ms	6.9 MiB	C++11	494 Bytes	2024-7-2 21:51:43
AC	叶哲宇 (yzy)	8ms	7.2 MiB	C++11	352 Bytes	2024-5-5 21:10:06
AC	wangzihang	8ms	6.8 MiB		502 Bytes	2023-11-6 17:05:35
AC	李树崑 (lishukun)	8ms	508 KiB		482 Bytes	2022-8-3 18:01:40
AC	Nico	8ms	6.8 MiB		568 Bytes	2023-10-3 17:52:51
AC	黄诗童 (hst01)	8ms	444 KiB		392 Bytes	2022-8-29 22:12:09
AC	姚宏逸	8ms	440 KiB		631 Bytes	2022-5-30 16:27:14
AC	郭人瑀作业号	8ms	432 KiB		454 Bytes	2022-8-2 15:03:21
AC	yuzk	8ms	6.9 MiB	C++11	469 Bytes	2024-8-24 16:47:39
AC	wangruibo20xh	8ms	384 KiB		403 Bytes	2022-2-11 18:43:20
AC	RanHao	8ms	6.9 MiB	C++11(O2)	494 Bytes	2024-7-3 0:33:05
AC	甄一阳 (22016-zyy)	8ms	512 KiB		350 Bytes	2022-11-20 19:09:00
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)	8ms	384 KiB		652 Bytes	2022-12-31 9:53:07
AC	汪致卉 (wangzh)	8ms	384 KiB		589 Bytes	2022-4-17 0:28:04
AC	肖添宇	8ms	440 KiB		506 Bytes	2022-4-16 19:57:36
AC	无尽的想象 (谭仕高)	8ms	452 KiB		386 Bytes	2022-7-31 11:46:36
AC	Zongzi1	8ms	6.6 MiB	C++17(O2)	603 Bytes	2024-7-18 22:11:06
AC	吴俊成 (wujuncheng)	8ms	392 KiB		666 Bytes	2022-7-11 22:43:30
AC	22029-zjs	8ms	512 KiB		614 Bytes	2022-12-31 9:53:17
AC	文硕 (文硕1)	8ms	444 KiB		483 Bytes	2022-7-12 11:43:44
AC	杜是贤 (dushixian)	8ms	512 KiB		468 Bytes	2022-8-2 11:38:27
AC	ttt123	8ms	384 KiB		555 Bytes	2022-12-30 14:01:36
AC	朱老师 (zyp)	8ms	424 KiB		426 Bytes	2022-7-31 18:36:46
AC	坤坤荔枝小黑子 (zhonghaotian22006)	8ms	384 KiB		738 Bytes	2023-5-8 21:17:04
AC	张子扬	8ms	424 KiB		497 Bytes	2022-3-1 21:53:13
AC	SYC0226	8ms	440 KiB		733 Bytes	2022-3-20 14:02:25
AC	zcx	8ms	384 KiB		480 Bytes	2022-12-31 9:46:13
AC	芒苒忧 (廖迦南)	8ms	440 KiB		541 Bytes	2022-2-26 9:49:44
AC	三藏的痔疮 (不会玩是原罪)	8ms	448 KiB		506 Bytes	2022-1-23 16:18:11
AC	王乐仪	8ms	384 KiB		474 Bytes	2022-2-5 17:13:09
AC	明轩 (吕同学)	8ms	6.6 MiB	C++14(O2)	1.1 KiB	2024-7-6 15:15:44
AC	任童(rentong)	8ms	428 KiB		470 Bytes	2022-7-2 15:02:04
AC	张祖名	8ms	6.9 MiB	C++98(O2)	543 Bytes	2024-6-11 22:39:16
AC	Tender. (05c05-zhou)	8ms	436 KiB		502 Bytes	2023-5-14 16:49:40
AC	ttt123	8ms	392 KiB		675 Bytes	2022-12-31 9:49:53
AC	22029-lsl	8ms	392 KiB		484 Bytes	2022-12-31 9:56:05
AC	zcszcs	8ms	6.7 MiB		395 Bytes	2023-9-23 16:58:15
AC	zhangzixuanaa	9ms	392 KiB		369 Bytes	2023-4-15 15:23:52
AC	陈红恺 (chk)	9ms	448 KiB		392 Bytes	2022-8-1 21:03:20
AC	稻妻第一深情 (喝酒の吟游诗人)	9ms	448 KiB		1.7 KiB	2023-3-12 0:24:20
AC	heruitong	9ms	440 KiB		424 Bytes	2022-11-27 22:08:02
AC	11451254188 (22029-mjh)	9ms	384 KiB		685 Bytes	2022-12-31 9:54:03
AC	罗兰（漆黑襟默) (zhangxiaoci)	9ms	384 KiB		373 Bytes	2023-4-15 15:15:46
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	9ms	384 KiB		502 Bytes	2022-12-31 9:49:08
AC	cupy战士 (05c05-dkf)	9ms	6.9 MiB		428 Bytes	2023-9-24 11:42:58
AC	Erin	9ms	7 MiB	C++98	360 Bytes	2024-5-29 13:09:04
AC	朱老师 (zyp)	9ms	448 KiB		520 Bytes	2022-8-19 13:40:11
AC	kkksc03 (彭士锋)	9ms	512 KiB		502 Bytes	2022-3-12 13:26:08
AC	SB (mfy01)	9ms	488 KiB		641 Bytes	2023-2-3 17:44:38
AC	heyi	9ms	6.8 MiB	C++98(O2)	461 Bytes	2024-8-11 14:11:56
AC	qinjin11	9ms	448 KiB		381 Bytes	2022-11-29 21:06:52
AC	朱老师 (zyp)	9ms	6.9 MiB		422 Bytes	2023-8-11 21:38:44
AC	坤坤荔枝小黑子 (zhonghaotian22006)	9ms	512 KiB		700 Bytes	2022-10-31 20:41:30
AC	444444444 (唐跃元)	9ms	384 KiB		366 Bytes	2023-4-15 15:19:28
AC	罗竣瀚	9ms	384 KiB		341 Bytes	2023-4-15 15:21:06
AC	童艺涵	9ms	392 KiB		339 Bytes	2023-4-15 15:17:19
AC	10255	9ms	384 KiB		438 Bytes	2022-12-13 20:40:58
AC	cbw	10ms	6.8 MiB		526 Bytes	2023-6-20 13:49:49
AC	关博源	10ms	384 KiB		677 Bytes	2023-3-22 20:30:49
AC	^_^ (ctc)	10ms	512 KiB		433 Bytes	2022-12-13 20:40:37
AC	huanglu	10ms	440 KiB		532 Bytes	2023-1-8 19:06:25
AC	kcs007	10ms	432 KiB		367 Bytes	2023-4-15 15:13:13
AC	郑岐蔚	10ms	444 KiB		416 Bytes	2023-1-26 14:46:10
AC	胡宸华 (huchenhua)	10ms	424 KiB		493 Bytes	2023-1-14 9:46:44
AC	Tender. (05c05-zhou)	10ms	448 KiB		502 Bytes	2022-10-18 11:43:10
AC	RanHao	10ms	6.9 MiB		422 Bytes	2023-8-20 10:02:53
AC	Jack	10ms	512 KiB		401 Bytes	2023-1-11 9:28:35
AC	zyl	12ms	7.1 MiB		396 Bytes	2024-1-22 11:25:13
AC	杜俊宏	17ms	392 KiB		389 Bytes	2022-6-4 19:26:27
AC	贾博涵	19ms	7 MiB		417 Bytes	2023-12-5 11:19:26
AC	张雯皓 (zhangwenhao)	20ms	7.2 MiB		360 Bytes	2024-1-13 11:08:33
AC	jdy	34ms	544 KiB		385 Bytes	2024-3-16 17:58:15
AC	jdy	40ms	764 KiB		421 Bytes	2024-3-16 18:08:15
AC	xuniaoyin (徐袅音)	41ms	532 KiB		495 Bytes	2024-1-31 12:17:31
AC	姜皓允	42ms	532 KiB		404 Bytes	2024-2-20 19:41:05
AC	赵奕铭	42ms	548 KiB		438 Bytes	2024-3-10 17:11:34
AC	希蒙 (zhengxingya)	42ms	532 KiB		568 Bytes	2024-2-3 16:26:44
AC	fcxin	80ms	9.3 MiB	Python 3	793 Bytes	2024-8-15 13:09:56