结巴的小明

状态	递交者	时间	内存	语言	代码	递交时间
AC	200800	4ms	7.2 MiB		139 Bytes	2023-11-12 15:20:38
AC	hrz	6ms	7.2 MiB		136 Bytes	2023-11-12 15:04:28
AC	ChongqingGroup (Donce)	9ms	7.1 MiB		167 Bytes	2023-11-12 15:17:21
AC	ywh	10ms	440 KiB		119 Bytes	2022-5-28 9:24:27
AC	赵沛喆	10ms	388 KiB		180 Bytes	2022-8-13 12:12:14
AC	longhao	10ms	384 KiB		109 Bytes	2022-1-26 10:18:45
AC	xuniaoyin (徐袅音)	10ms	6.5 MiB	C++98(O2)	119 Bytes	2024-7-24 14:45:46
AC	肖添宇	10ms	384 KiB		123 Bytes	2022-5-14 17:16:07
AC	高彬月	10ms	7.1 MiB		150 Bytes	2023-11-12 15:17:27
AC	不怎么聪明的家伙 (贺俊楠)	10ms	388 KiB		158 Bytes	2023-5-21 14:22:51
AC	李树崑 (lishukun)	10ms	512 KiB		178 Bytes	2022-8-3 18:14:56
AC	杜俊宏	10ms	512 KiB		175 Bytes	2022-6-10 21:48:36
AC	阮 (媚狐不吃道旁李)	10ms	7.2 MiB	C++98	163 Bytes	2024-5-2 16:35:40
AC	吴俊成 (wujuncheng)	10ms	436 KiB		141 Bytes	2022-7-11 20:07:23
AC	时代一校-赵彦博 (zyb)	10ms	7.2 MiB	C++98	114 Bytes	2024-4-24 20:41:18
AC	huyinuo	10ms	424 KiB		193 Bytes	2022-6-12 15:50:52
AC	原著校区巫映秋 (巫映秋1a)	10ms	7 MiB	C++98	162 Bytes	2024-6-28 22:58:26
AC	疯神芭芭脱丝 (李卓修)	10ms	392 KiB		126 Bytes	2022-1-24 11:02:09
AC	李哲 (lizhe)	10ms	384 KiB		123 Bytes	2022-8-15 19:44:46
AC	王韵淮	10ms	384 KiB		96 Bytes	2022-5-31 21:29:55
AC	高彬月	10ms	7.1 MiB		150 Bytes	2023-11-12 15:17:46
AC	弹射起飞 ? 冲 ! (吴周周)	10ms	392 KiB		172 Bytes	2023-5-13 17:06:51
AC	李彭宋代诗人 (ljy123456)	10ms	384 KiB		121 Bytes	2023-4-6 13:12:18
AC	祝熙承 (zxc)	10ms	6.4 MiB	C++98	144 Bytes	2024-7-5 20:22:09
AC	赵沛喆	10ms	396 KiB		180 Bytes	2022-8-13 12:12:14
AC	张瑞博	11ms	7 MiB	C++11	114 Bytes	2024-5-19 18:35:38
AC	没有此人 (akm)	11ms	6.7 MiB		189 Bytes	2023-10-1 11:30:36
AC	谭懿轩 (yanyixuan)	11ms	512 KiB		114 Bytes	2022-2-19 9:52:29
AC	郭人瑀作业号	11ms	440 KiB		160 Bytes	2022-8-2 15:31:57
AC	TBB (杜昊燃)	11ms	384 KiB		225 Bytes	2022-5-21 10:28:04
AC	王晨志 (wangchenzhi)	11ms	436 KiB		94 Bytes	2022-7-18 8:26:17
AC	姚宏逸	11ms	436 KiB		106 Bytes	2022-4-12 22:27:08
AC	赵泳鑫 (zhaoyongxin)	11ms	512 KiB		197 Bytes	2022-4-28 6:48:27
AC	朱泽晟	11ms	440 KiB		110 Bytes	2022-3-25 21:15:42
AC	Randy Marsh (杨子腾)	11ms	436 KiB		171 Bytes	2022-6-12 10:16:42
AC	时代二校-陈天成 (鸭缩毛巾)	11ms	384 KiB		148 Bytes	2023-5-13 17:14:07
AC	我是周靖松长得帅 (mouyunqi)	11ms	440 KiB		134 Bytes	2023-5-26 23:06:02
AC	灶门炭治郎：火之神神乐	11ms	392 KiB		174 Bytes	2023-5-13 17:16:20
AC	luoluonuoya	11ms	428 KiB		204 Bytes	2022-5-8 14:20:43
AC	时代2校+施皓宬 (shihaocheng)	11ms	384 KiB		142 Bytes	2023-5-13 17:15:09
AC	毕浩宇 (bihaoyu)	11ms	384 KiB		182 Bytes	2023-5-13 17:14:05
AC	NJL (NJlL)	11ms	512 KiB		107 Bytes	2022-7-6 18:42:01
AC	chen (peter)	11ms	440 KiB		156 Bytes	2022-7-21 9:23:06
AC	赵沛喆	11ms	512 KiB		180 Bytes	2022-8-13 12:11:46
AC	周琪渃	11ms	444 KiB		190 Bytes	2023-3-9 19:25:01
AC	HIMMZXC	11ms	440 KiB		145 Bytes	2022-3-5 15:28:54
AC	胡澜之 (666hlz666)	11ms	436 KiB		141 Bytes	2023-5-9 20:37:56
AC	黄梓桐 (HuangZiTong)	11ms	436 KiB		125 Bytes	2023-2-2 13:33:24
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	11ms	6.9 MiB	C++98	126 Bytes	2024-8-17 22:34:01
AC	wangruibo20xh	11ms	440 KiB		125 Bytes	2022-2-11 14:07:46
AC	时代二校+王吕棪 (wanglvyan)	11ms	384 KiB		188 Bytes	2023-5-13 17:13:41
AC	冒牌陈杰晟【MOD】 (wed)	11ms	432 KiB		102 Bytes	2022-3-1 22:01:32
AC	李廷旭 (litingxu)	11ms	6.7 MiB		160 Bytes	2023-8-21 18:08:56
AC	江科毅 (jky)	11ms	444 KiB		121 Bytes	2023-3-30 19:45:52
AC	许炜铭 (xuweiming)	12ms	7.9 MiB		134 Bytes	2023-6-10 20:25:14
AC	马渝杭 (mayuhang)	12ms	440 KiB		114 Bytes	2022-9-15 18:53:58
AC	谢延灏 (xeiyanhao---a handsome boy)	12ms	444 KiB		116 Bytes	2022-7-28 17:27:00
AC	王晴萱	12ms	6.8 MiB		141 Bytes	2023-9-24 10:58:33
AC	小忙果 (王昱杰)	12ms	7.2 MiB		132 Bytes	2023-12-16 17:21:18
AC	zlx (xiao)	12ms	512 KiB		170 Bytes	2022-11-27 12:23:54
AC	樊竣熠 (lft1114)	12ms	512 KiB		132 Bytes	2022-8-8 14:52:12
AC	赵沛喆	12ms	436 KiB		180 Bytes	2022-8-13 12:12:12
AC	zhm123	12ms	412 KiB		173 Bytes	2023-5-5 15:27:41
AC	源著校区-宋昊成 (马冬梅)	12ms	432 KiB		131 Bytes	2023-2-26 19:49:17
AC	叶哲宇 (yzy)	12ms	6.8 MiB		121 Bytes	2023-6-23 11:03:15
AC	坤坤荔枝小黑子 (zhonghaotian22006)	12ms	436 KiB		159 Bytes	2022-9-7 20:09:35
AC	爱情海校区—沙天一 (沙天一)	13ms	6.9 MiB		144 Bytes	2023-7-9 8:42:22
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	13ms	440 KiB		134 Bytes	2022-11-26 8:09:50
AC	新壹街陈科言 (cky)	13ms	7.2 MiB		124 Bytes	2023-7-19 17:47:31
AC	杜是贤 (dushixian)	13ms	512 KiB		113 Bytes	2023-5-28 10:46:17
AC	孙烽轶 (sfy)	13ms	6.9 MiB		114 Bytes	2023-7-9 9:48:55
AC	新壹街——陈学彬 (BUG)	13ms	6.9 MiB		232 Bytes	2023-7-6 10:47:04
AC	庹仕杰	13ms	7.1 MiB		115 Bytes	2024-1-2 18:46:40
AC	程曦漫	13ms	7.2 MiB		153 Bytes	2023-11-12 15:19:18
AC	鲜榨大肠汁	13ms	6.7 MiB		128 Bytes	2023-7-7 9:35:58
AC	程曦漫	14ms	7.1 MiB		131 Bytes	2023-11-12 15:10:01
AC	陈诺	14ms	7 MiB		130 Bytes	2024-1-8 17:19:07
AC	(张洛诚)	14ms	436 KiB		134 Bytes	2023-4-27 20:21:01
AC	8086	14ms	7.2 MiB		137 Bytes	2023-7-12 11:26:19
AC	colin1112 (墙凌可)	14ms	6.7 MiB		130 Bytes	2023-7-21 13:49:05
AC	胡程禹	14ms	6.9 MiB		157 Bytes	2023-7-7 10:28:12
AC	希蒙 (zhengxingya)	14ms	6.9 MiB		222 Bytes	2023-11-29 16:44:23
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	7 MiB		114 Bytes	2023-11-11 22:40:31
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)	17ms	6.4 MiB		148 Bytes	2023-11-19 10:38:56
AC	陌生人 (涂玉龙)	21ms	7.2 MiB		157 Bytes	2023-11-12 15:18:26
AC	拥抱幸福小熊(吴沛篪)	21ms	7.1 MiB		383 Bytes	2024-1-21 13:51:28
AC	AI创客	22ms	7.4 MiB		132 Bytes	2023-12-30 11:14:51
AC	My name is Man (钟卓劭)	52ms	544 KiB		109 Bytes	2024-3-20 20:02:16
AC	安闵煜 (anzai)	55ms	536 KiB	C++11	127 Bytes	2024-8-31 10:05:06
AC	赵奕铭	56ms	764 KiB		122 Bytes	2024-4-13 13:30:55
AC	hyh	56ms	548 KiB		107 Bytes	2024-3-2 9:51:39
AC	褚博艺	60ms	552 KiB		145 Bytes	2024-3-30 16:42:26
AC	杨坤霖 (steven)	153ms	3.9 MiB	Python 3	36 Bytes	2022-6-18 21:02:37
AC	11111	160ms	3.9 MiB	Python 3	38 Bytes	2022-2-13 17:46:48
AC	李林峰 (金克拉)	162ms	3.9 MiB	Python 3	61 Bytes	2022-2-14 10:20:52
AC	11451254188 (22029-mjh)	163ms	3.9 MiB	Python 3	32 Bytes	2023-1-30 22:20:33
AC	majinhui	165ms	3.9 MiB	Python 3	32 Bytes	2022-8-5 14:49:39
AC	爱琴海校区-刁钲洋 (刁钲洋)	167ms	3.9 MiB	Python 3	40 Bytes	2022-3-12 12:27:23
AC	刘政君 (lzj)	167ms	4 MiB	Python 3	32 Bytes	2022-2-14 9:10:15
AC	谭红中 (不知道)	168ms	4.1 MiB	Python 3	30 Bytes	2022-4-15 19:07:11