希蒙之肥宅快乐水

状态	递交者	时间	内存	语言	代码	递交时间
AC	LUKHE (LukeHu)	7ms	312 KiB		137 Bytes	2022-4-16 17:13:52
AC	GYZ	12ms	384 KiB		129 Bytes	2022-5-25 18:45:47
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:25
AC	朱泽晟	13ms	432 KiB		110 Bytes	2022-3-25 21:43:28
AC	汪致卉 (wangzh)	13ms	384 KiB		113 Bytes	2022-4-8 16:21:33
AC	chen (peter)	13ms	512 KiB		105 Bytes	2022-7-19 15:16:00
AC	Randy Marsh (杨子腾)	13ms	384 KiB		134 Bytes	2022-5-26 18:49:55
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:27
AC	姚宏逸	13ms	384 KiB		111 Bytes	2022-4-1 20:20:05
AC	zxccv	13ms	384 KiB		137 Bytes	2022-4-6 21:55:25
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:27
AC	王韵淮	13ms	404 KiB		96 Bytes	2022-4-4 14:42:15
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:25
AC	王晨志 (wangchenzhi)	13ms	512 KiB		104 Bytes	2022-7-14 13:28:02
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:26
AC	huyinuo	13ms	392 KiB		117 Bytes	2022-5-31 22:34:46
AC	樊竣熠 (lft1114)	13ms	448 KiB		111 Bytes	2022-8-13 16:40:52
AC	Z.饮月君 (张皓南)	13ms	424 KiB		116 Bytes	2022-4-8 18:05:16
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:26
AC	李山水	13ms	512 KiB		119 Bytes	2022-4-5 12:15:31
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:28
AC	1396013295	13ms	436 KiB		110 Bytes	2022-3-22 20:35:45
AC	李山水	13ms	400 KiB		119 Bytes	2022-4-5 12:15:27
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:26
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:30
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:30
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:29
AC	xiangsiyu	13ms	448 KiB		116 Bytes	2022-6-26 9:35:48
AC	李山水	13ms	392 KiB		119 Bytes	2022-4-5 12:15:30
AC	李山水	13ms	432 KiB		119 Bytes	2022-4-5 12:15:30
AC	MoonLight ( aaa)	13ms	440 KiB		114 Bytes	2022-8-11 10:57:55
AC	李山水	13ms	440 KiB		119 Bytes	2022-4-5 12:15:28
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:28
AC	李山水	13ms	420 KiB		119 Bytes	2022-4-5 12:15:29
AC	杜俊宏	13ms	400 KiB		105 Bytes	2022-3-31 19:23:51
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:27
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:31
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:02:10
AC	赵沛喆	13ms	436 KiB		98 Bytes	2022-8-1 15:40:27
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:28
AC	李山水	13ms	384 KiB		119 Bytes	2022-4-5 12:15:30
AC	杜俊宏	13ms	384 KiB		105 Bytes	2022-3-31 19:23:46
AC	时代二校-陈天成 (鸭缩毛巾)	13ms	440 KiB		134 Bytes	2023-5-22 20:18:26
AC	李树崑 (lishukun)	14ms	384 KiB		152 Bytes	2022-8-21 11:36:37
AC	张瑞博	14ms	6.9 MiB	C++11	109 Bytes	2024-6-3 20:30:01
AC	李山水	14ms	384 KiB		119 Bytes	2022-4-5 12:15:25
AC	李山水	14ms	424 KiB		119 Bytes	2022-4-5 12:15:29
AC	时代1校-杨宇轩 (杨宇轩)	14ms	7 MiB	C++11	114 Bytes	2024-6-21 20:39:09
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	512 KiB		121 Bytes	2022-6-25 9:48:59
AC	NJL (NJlL)	14ms	392 KiB		113 Bytes	2022-3-27 17:50:47
AC	胡瀚文	14ms	440 KiB		93 Bytes	2022-7-16 8:06:58
AC	吴俊成 (wujuncheng)	14ms	436 KiB		114 Bytes	2022-7-11 20:11:42
AC	疯神芭芭脱丝 (李卓修)	14ms	440 KiB		115 Bytes	2022-7-12 14:43:31
AC	林小博	14ms	436 KiB		137 Bytes	2022-6-30 12:20:44
AC	邬文博 (wwb)	14ms	512 KiB		100 Bytes	2023-4-17 21:36:16
AC	李山水	14ms	384 KiB		119 Bytes	2022-4-5 12:15:27
AC	叶哲宇 (yzy)	14ms	6.8 MiB		112 Bytes	2023-6-23 11:10:38
AC	李山水	14ms	384 KiB		119 Bytes	2022-4-5 12:15:28
AC	蒲梓勋 (puzixun)	14ms	444 KiB		112 Bytes	2022-8-12 17:49:16
AC	李山水	14ms	392 KiB		119 Bytes	2022-4-5 12:15:25
AC	李山水	14ms	384 KiB		119 Bytes	2022-4-5 12:15:29
AC	傅博涛	14ms	428 KiB		113 Bytes	2022-6-5 11:08:24
AC	李山水	14ms	420 KiB		119 Bytes	2022-4-5 12:02:10
AC	芒苒忧 (廖迦南)	14ms	512 KiB		133 Bytes	2022-8-16 15:03:17
AC	AC[谭赫奕] (tanheyi)	14ms	6.8 MiB		118 Bytes	2023-9-20 20:53:57
AC	李山水	14ms	384 KiB		119 Bytes	2022-4-5 12:15:29
AC	徐子恩 (Cow)	14ms	384 KiB		116 Bytes	2022-3-27 9:20:59
AC	xuniaoyin (徐袅音)	15ms	6.7 MiB		115 Bytes	2023-8-30 10:17:59
AC	冒牌陈杰晟【MOD】 (wed)	15ms	512 KiB		113 Bytes	2022-4-10 17:45:37
AC	李山水	15ms	388 KiB		119 Bytes	2022-4-5 12:15:25
AC	新壹街陈科言 (cky)	15ms	6.9 MiB		126 Bytes	2023-7-21 16:34:15
AC	kkksc03 (彭士锋)	15ms	512 KiB		105 Bytes	2022-4-23 14:21:59
AC	阮 (媚狐不吃道旁李)	15ms	7.2 MiB	C++98	115 Bytes	2024-5-18 16:07:14
AC	11451254188 (22029-mjh)	15ms	392 KiB		130 Bytes	2022-12-12 18:19:04
AC	ttt123	15ms	432 KiB		134 Bytes	2023-4-20 14:12:11
AC	金沙校区-蓝祥与 (蓝祥与)	15ms	512 KiB		105 Bytes	2022-11-21 16:05:46
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	432 KiB		145 Bytes	2022-11-25 17:53:35
AC	祝熙承 (zxc)	15ms	6.9 MiB	C++98	141 Bytes	2024-6-8 15:33:20
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	436 KiB		110 Bytes	2022-8-27 20:28:28
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.7 MiB		103 Bytes	2023-8-28 9:24:14
AC	黄彦熹 (AK-203)	16ms	420 KiB		225 Bytes	2022-10-17 19:14:06
AC	(张洛诚)	16ms	448 KiB		124 Bytes	2023-4-27 20:22:09
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)	16ms	6.8 MiB		117 Bytes	2023-6-11 10:39:00
AC	李树崑 (lishukun)	17ms	432 KiB		152 Bytes	2022-8-21 11:36:34
AC	李哲 (lizhe)	18ms	440 KiB		95 Bytes	2022-11-21 21:10:35
AC	https://www.crazygames.com/game/merge-construct (陈诺)	66ms	764 KiB		105 Bytes	2024-2-5 12:12:20
AC	https://www.crazygames.com/game/merge-construct (陈诺)	67ms	764 KiB		105 Bytes	2024-2-6 14:04:27
AC	吕同学是傻逼 (黄立信)	67ms	764 KiB		105 Bytes	2024-3-11 19:53:58
AC	曹星羽	69ms	768 KiB		114 Bytes	2024-1-28 16:02:38
AC	金沙-文豪 (wenhao)	70ms	764 KiB		129 Bytes	2024-3-31 15:24:51
AC	张芮茜	71ms	764 KiB	C++98(O2)	120 Bytes	2025-1-11 17:24:46
AC	赵奕铭	74ms	764 KiB		452 Bytes	2024-3-17 21:03:28
AC	大萌新	197ms	3.9 MiB	Python 3	42 Bytes	2023-6-2 20:40:47
AC	大萌新	200ms	3.9 MiB	Python 3	42 Bytes	2023-6-2 20:40:47
AC	源著校区-宋昊成 (马冬梅)	201ms	3.9 MiB	Python 3	43 Bytes	2022-4-23 18:43:34
AC	时代二校-焦雨齐 (Angel)	202ms	3.9 MiB	Python 3	57 Bytes	2023-1-8 11:36:36
AC	小鲨鱼	203ms	3.9 MiB	Python 3	42 Bytes	2023-6-2 20:40:10
AC	大萌新	204ms	3.9 MiB	Python 3	42 Bytes	2023-6-2 20:40:59
AC	大萌新	205ms	3.9 MiB	Python 3	42 Bytes	2023-6-2 20:40:59
AC	大萌新	207ms	4 MiB	Python 3	42 Bytes	2023-6-2 20:41:00