结巴的小明

状态	递交者	时间	内存	语言	代码	递交时间
AC	wangjun	4ms	7.2 MiB		143 Bytes	2023-11-26 15:08:36
AC	朱泽晟	5ms	312 KiB		192 Bytes	2022-8-18 16:49:46
AC	https://www.crazygames.com/game/merge-construct (陈诺)	8ms	7.3 MiB		130 Bytes	2024-1-4 22:17:59
AC	拥抱幸福小熊(吴沛篪)	9ms	7.1 MiB		383 Bytes	2024-1-21 13:51:10
AC	郭人瑀作业号	10ms	384 KiB		160 Bytes	2022-8-2 15:32:07
AC	杜是贤 (dushixian)	10ms	384 KiB		108 Bytes	2022-6-12 9:39:36
AC	yanxiaosong	10ms	384 KiB		184 Bytes	2022-9-12 10:20:21
AC	白祖睿	10ms	6.6 MiB	C++98(O2)	103 Bytes	2024-7-12 12:25:54
AC	. (Pig)	10ms	384 KiB		136 Bytes	2022-1-19 11:06:12
AC	yaokaixuan	10ms	384 KiB		146 Bytes	2022-1-19 11:13:58
AC	Randy Marsh (杨子腾)	10ms	384 KiB		171 Bytes	2022-6-12 10:26:20
AC	pandap&a王皓宸 (WANGHAOCHEN)	10ms	384 KiB		197 Bytes	2023-4-7 19:50:35
AC	XYZ303	10ms	424 KiB		155 Bytes	2022-1-19 11:13:48
AC	陈杰晟	10ms	384 KiB		131 Bytes	2022-5-29 11:04:20
AC	Ronnie	10ms	388 KiB		152 Bytes	2022-1-19 11:13:34
AC	张瑞博	10ms	7 MiB	C++11	114 Bytes	2024-5-27 22:01:27
AC	wangruibo20xh	10ms	512 KiB		125 Bytes	2022-2-11 14:00:39
AC	盗号者该死 (陶欣垚)	10ms	7 MiB	C++11	182 Bytes	2024-5-26 15:26:27
AC	喻兴诚 (Brian)	10ms	412 KiB		136 Bytes	2022-1-19 11:44:51
AC	ycy	10ms	384 KiB		130 Bytes	2022-6-18 16:10:07
AC	杜俊宏	10ms	384 KiB		175 Bytes	2022-4-5 13:00:00
AC	罗宇凡 (吴彦祖)	10ms	384 KiB		151 Bytes	2022-1-19 11:13:49
AC	侯治鋆	10ms	384 KiB		144 Bytes	2022-5-27 20:25:00
AC	Mr_D	10ms	7 MiB	C++17	212 Bytes	2024-5-26 14:55:32
AC	jop	10ms	392 KiB		126 Bytes	2022-1-19 11:16:34
AC	吴俊成 (wujuncheng)	10ms	384 KiB		141 Bytes	2022-7-11 11:24:05
AC	chen (peter)	10ms	384 KiB		156 Bytes	2022-7-21 9:23:21
AC	坤坤荔枝小黑子 (zhonghaotian22006)	10ms	384 KiB		144 Bytes	2022-7-4 9:49:23
AC	王晨志 (wangchenzhi)	10ms	392 KiB		140 Bytes	2022-6-19 13:01:26
AC	panyan	10ms	388 KiB		141 Bytes	2022-9-12 10:25:32
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)	10ms	384 KiB		128 Bytes	2023-5-19 17:50:16
AC	李哲 (lizhe)	10ms	384 KiB		123 Bytes	2022-8-16 21:25:46
AC	luoluonuoya	10ms	384 KiB		192 Bytes	2022-1-26 16:32:02
AC	徐子恩 (Cow)	10ms	384 KiB		176 Bytes	2022-1-19 11:14:35
AC	韩正墨 (xmw05)	10ms	444 KiB		129 Bytes	2022-7-13 9:50:12
AC	喻文博 (22016-ywb)	10ms	392 KiB		176 Bytes	2022-9-11 11:40:41
AC	22016-oyc	10ms	392 KiB		146 Bytes	2022-9-11 11:38:53
AC	赵泳鑫 (zhaoyongxin)	10ms	384 KiB		187 Bytes	2022-4-25 18:01:01
AC	朱老师 (zyp)	10ms	440 KiB		153 Bytes	2022-8-16 18:09:28
AC	阮 (媚狐不吃道旁李)	10ms	7.2 MiB	C++98	163 Bytes	2024-5-2 16:35:34
AC	Zongzi1	10ms	6.6 MiB	C++17(O2)	134 Bytes	2024-7-21 9:48:41
AC	xmw318046	10ms	6.4 MiB	C++98	137 Bytes	2024-7-5 18:26:24
AC	田宝贤	10ms	6.9 MiB	C++98	153 Bytes	2024-5-26 14:56:56
AC	NJL (NJlL)	10ms	388 KiB		102 Bytes	2022-5-15 17:39:40
AC	Ronnie	10ms	400 KiB		152 Bytes	2022-1-19 11:13:39
AC	xiangsiyu	10ms	384 KiB		218 Bytes	2022-7-4 8:07:26
AC	原著校区巫映秋 (巫映秋1a)	10ms	7 MiB	C++98	152 Bytes	2024-6-28 22:58:13
AC	在煎鱼的肖大总铳 (肖宇航)	11ms	6.8 MiB		112 Bytes	2023-9-24 11:24:04
AC	yaokaixin	11ms	384 KiB		145 Bytes	2022-1-19 11:13:56
AC	ddz	11ms	384 KiB		231 Bytes	2022-3-6 18:35:56
AC	张祖名	11ms	6.9 MiB	C++98(O2)	125 Bytes	2024-7-2 21:57:01
AC	芒苒忧 (廖迦南)	11ms	512 KiB		131 Bytes	2022-8-15 14:52:11
AC	MoonLight ( aaa)	11ms	384 KiB		282 Bytes	2022-1-22 9:53:22
AC	ddz	11ms	392 KiB		231 Bytes	2022-3-6 18:35:55
AC	xyc (谢雨宸)	11ms	6.7 MiB		145 Bytes	2023-9-27 20:14:21
AC	AC[谭赫奕] (tanheyi)	11ms	384 KiB		128 Bytes	2023-4-2 10:02:15
AC	陈骏逸 (chenjunyi)	11ms	512 KiB		102 Bytes	2022-7-28 21:47:20
AC	SYC0226	11ms	384 KiB		249 Bytes	2022-3-20 14:33:57
AC	杨瀚霖 (yanghanlin)	11ms	444 KiB		170 Bytes	2023-2-18 10:18:48
AC	17779	11ms	424 KiB		192 Bytes	2022-4-4 17:18:15
AC	林小博	11ms	436 KiB		131 Bytes	2022-5-11 20:13:07
AC	梅子楠 (22016-mzn)	11ms	384 KiB		175 Bytes	2022-9-11 11:41:32
AC	zlx (xiao)	11ms	384 KiB		170 Bytes	2022-11-26 18:40:46
AC	Ronnie	11ms	404 KiB		152 Bytes	2022-1-19 11:13:37
AC	Ronnie	11ms	392 KiB		152 Bytes	2022-1-19 11:13:36
AC	RanHao	11ms	6.9 MiB		128 Bytes	2023-7-26 13:25:43
AC	yanxiaosong	11ms	384 KiB		129 Bytes	2022-9-12 10:23:35
AC	Ronnie	11ms	408 KiB		152 Bytes	2022-1-19 11:13:37
AC	疯神芭芭脱丝 (李卓修)	11ms	384 KiB		126 Bytes	2022-1-24 11:04:36
AC	sb (杨锦睿)	11ms	7 MiB	C++11	164 Bytes	2024-5-26 14:55:58
AC	huyinuo	11ms	440 KiB		193 Bytes	2022-4-27 19:28:32
AC	lch (凌昌瀚)	11ms	444 KiB		133 Bytes	2022-7-5 18:40:08
AC	疯神芭芭脱丝 (李卓修)	11ms	392 KiB		126 Bytes	2022-3-6 17:38:46
AC	TBB (杜昊燃)	11ms	432 KiB		214 Bytes	2022-4-30 10:40:40
AC	何昊宇 (22016-hhy)	11ms	512 KiB		120 Bytes	2022-9-11 9:27:00
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	11ms	6.9 MiB	C++98	126 Bytes	2024-8-17 22:33:38
AC	程子杰 (05c41-czj)	11ms	416 KiB		131 Bytes	2022-7-27 11:12:28
AC	dmh (丁墨涵)	11ms	436 KiB		128 Bytes	2022-2-20 14:14:49
AC	刘宸睿	11ms	6.9 MiB	C++17(O2)	177 Bytes	2024-5-26 14:57:58
AC	不怎么聪明的家伙 (贺俊楠)	11ms	512 KiB		158 Bytes	2023-4-9 9:00:38
AC	曹埊睿 (caodirui)	11ms	384 KiB		200 Bytes	2023-4-15 20:07:36
AC	Ronnie	11ms	384 KiB		152 Bytes	2022-1-19 11:13:38
AC	魑归sama	11ms	448 KiB		133 Bytes	2022-7-12 16:47:30
AC	偽艺術家 (chenyanchi22006)	11ms	436 KiB		117 Bytes	2022-8-15 22:11:28
AC	luojunyang	11ms	512 KiB		182 Bytes	2022-1-21 9:35:44
AC	Ronnie	11ms	392 KiB		152 Bytes	2022-1-19 11:13:37
AC	胡宸华 (huchenhua)	11ms	6.9 MiB		112 Bytes	2023-8-20 22:09:54
AC	时代一校-赵彦博 (zyb)	11ms	7.2 MiB	C++98	114 Bytes	2024-4-24 20:30:56
AC	Ronnie	11ms	384 KiB		152 Bytes	2022-1-19 11:13:38
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	11ms	384 KiB		138 Bytes	2022-1-27 20:39:15
AC	詹宇航 (zyh7)	11ms	384 KiB		133 Bytes	2022-7-8 18:12:56
AC	王韵淮	11ms	392 KiB		96 Bytes	2022-5-28 14:46:50
AC	文硕 (文硕1)	11ms	444 KiB		197 Bytes	2022-7-12 11:52:48
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	11ms	384 KiB		137 Bytes	2023-1-17 15:28:09
AC	孙烽轶 (sfy)	11ms	6.9 MiB		114 Bytes	2023-7-9 9:48:42
AC	小忙果 (王昱杰)	11ms	7 MiB		132 Bytes	2023-7-18 9:04:35
AC	Ronnie	11ms	384 KiB		152 Bytes	2022-1-19 11:13:36
AC	陈忝锐	11ms	424 KiB		106 Bytes	2022-3-6 17:43:57
AC	lll	11ms	384 KiB		147 Bytes	2023-4-7 20:50:39
AC	Ronnie	11ms	384 KiB		152 Bytes	2022-1-19 11:13:38