A + B Problem

状态	递交者	时间	内存	语言	代码	递交时间
AC	王科睿	5ms	8 MiB		110 Bytes	2022-7-25 19:47:32
AC	yangbinyu	5ms	8.2 MiB		111 Bytes	2022-9-12 21:04:43
AC	叶雨昊 (yeyuhao22006)	5ms	8.2 MiB		118 Bytes	2023-2-10 19:56:06
AC	我是SB神	5ms	8.2 MiB		111 Bytes	2022-1-23 15:43:46
AC	朱老师 (zyp)	5ms	8.2 MiB		179 Bytes	2023-3-3 21:06:06
AC	吃小孩的viv_	5ms	8.2 MiB		90 Bytes	2022-5-20 15:26:10
AC	汤杰尧	5ms	8 MiB		145 Bytes	2022-7-20 19:01:49
AC	叶雨昊 (yeyuhao22006)	5ms	8.2 MiB		118 Bytes	2023-2-10 19:56:07
AC	赵彬鸿	5ms	8.2 MiB		119 Bytes	2022-1-25 10:58:40
AC	zcx	5ms	8.2 MiB		102 Bytes	2023-2-7 20:48:43
AC	zzzrrrxxx	5ms	8.1 MiB		105 Bytes	2023-4-9 19:57:20
AC	22029-lsl	5ms	8.2 MiB		111 Bytes	2023-2-16 19:53:02
AC	yhd	5ms	8.1 MiB		112 Bytes	2022-7-4 18:22:19
AC	丁宇涵 (05c35-dyh1)	5ms	8.2 MiB		120 Bytes	2022-6-5 9:55:25
AC	赵彬鸿	5ms	8.2 MiB		119 Bytes	2022-1-25 10:58:41
AC	chenxiaozhun	5ms	8.2 MiB		115 Bytes	2022-4-4 14:46:25
AC	李施诚	5ms	8.2 MiB		126 Bytes	2022-9-28 21:04:43
AC	谭懿轩 (yanyixuan)	5ms	8.2 MiB		469 Bytes	2022-9-2 23:53:17
AC	袁伟宸	5ms	8.1 MiB		123 Bytes	2023-5-28 15:37:17
AC	李荣轩	5ms	8.2 MiB		110 Bytes	2023-2-28 18:29:33
AC	ycy	5ms	8.2 MiB		120 Bytes	2022-4-8 16:51:38
AC	yhd	5ms	8.1 MiB		112 Bytes	2022-7-4 18:22:15
AC	我是** (zhuyubing)	5ms	8.2 MiB		116 Bytes	2022-11-5 11:31:55
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)	5ms	8.2 MiB		119 Bytes	2022-11-26 11:45:40
AC	钟元朗	5ms	8 MiB		93 Bytes	2022-7-10 17:13:38
AC	啊...这 (炼狱杏寿郎)	5ms	8.1 MiB		106 Bytes	2022-6-29 11:41:52
AC	樊竣熠 (lft1114)	5ms	8.2 MiB		133 Bytes	2022-1-23 17:41:52
AC	邓皓天 (1234567A)	5ms	7.2 MiB		126 Bytes	2023-7-7 17:57:56
AC	王启仑 (wangqilun23010)	5ms	8.2 MiB		120 Bytes	2023-3-24 20:27:48
AC	wuqi	5ms	8.2 MiB		117 Bytes	2022-1-25 20:03:34
AC	李某人	5ms	8.2 MiB		102 Bytes	2022-1-21 17:05:08
AC	李某人	5ms	8.2 MiB		102 Bytes	2022-1-21 17:05:00
AC	黄俊翰 (123456789hjh)	5ms	7.1 MiB		98 Bytes	2023-7-12 8:23:55
AC	余晨浩 (yuchenhao)	5ms	8 MiB		119 Bytes	2022-8-24 15:10:44
AC	余晨浩 (yuchenhao)	5ms	8 MiB		119 Bytes	2022-8-24 15:10:40
AC	Guest	5ms	6.7 MiB	C++98(O2)	126 Bytes	2024-7-14 16:44:09
AC	草\|\|草 (陈星佑)	5ms	8.2 MiB		102 Bytes	2022-1-25 11:02:29
AC	新壹街——陈学彬 (BUG)	5ms	8.2 MiB		102 Bytes	2022-2-27 9:04:33
AC	凌肯 (lingken22006)	5ms	8.2 MiB		118 Bytes	2022-3-20 19:27:19
AC	范陈翰	5ms	8.2 MiB		110 Bytes	2023-2-28 18:30:31
AC	xiangsiyu	5ms	8.1 MiB		110 Bytes	2022-6-12 16:49:37
AC	huanglu	5ms	8.1 MiB		98 Bytes	2023-6-2 17:33:30
AC	陈家齐 (陈家齐1)	5ms	7.3 MiB		103 Bytes	2023-7-5 17:58:11
AC	六 (江智昕)	5ms	8.2 MiB		128 Bytes	2022-12-1 15:47:03
AC	陈年保宁醋 (dengboren)	5ms	8.2 MiB		372 Bytes	2022-1-15 20:01:36
AC	陈雨泽1	5ms	8.2 MiB		121 Bytes	2023-2-11 9:30:14
AC	王泓涵 (whh)	5ms	8.1 MiB		116 Bytes	2022-6-19 10:00:38
AC	李某人	5ms	8.1 MiB		102 Bytes	2022-1-21 17:05:04
AC	谭懿轩 (yanyixuan)	5ms	8.2 MiB		1.3 KiB	2022-11-2 21:08:46
AC	李允昊	5ms	8.1 MiB		129 Bytes	2023-6-22 11:48:58
AC	余晨浩 (yuchenhao)	5ms	7.9 MiB		119 Bytes	2022-8-24 15:10:36
AC	22029-lsl	5ms	8.2 MiB		111 Bytes	2023-2-16 19:53:17
AC	张景豪	5ms	7.8 MiB		112 Bytes	2023-6-29 18:52:01
AC	https://www.minecraft.net/zh-hans (王振西)	5ms	8.2 MiB		108 Bytes	2022-11-27 14:47:41
AC	明哲瀚 (18580067605)	5ms	8.2 MiB		116 Bytes	2022-10-2 20:52:51
AC	唐嘉文	5ms	8 MiB		115 Bytes	2022-7-17 14:55:50
AC	小土豆 (liuzirui2)	5ms	7.1 MiB		101 Bytes	2023-7-18 9:10:31
AC	贾璨玮 (马NB)	5ms	8 MiB		115 Bytes	2022-7-18 19:28:27
AC	(LengZeng)	5ms	8.2 MiB		124 Bytes	2022-3-11 20:11:15
AC	马浩宸 (mhc06)	5ms	7.1 MiB		115 Bytes	2023-7-21 8:14:53
AC	cheers 戴 (daizhuorun)	5ms	8.2 MiB		129 Bytes	2022-2-19 15:56:50
AC	谭红中 (不知道)	5ms	8.2 MiB		111 Bytes	2022-6-1 20:03:44
AC	朱老师 (zyp)	5ms	8.2 MiB		179 Bytes	2023-3-3 21:00:25
AC	时代二校-王盼兮 (wangpanxi)	5ms	8.2 MiB		115 Bytes	2023-2-25 9:41:46
AC	李某人	5ms	8.2 MiB		102 Bytes	2022-1-21 17:05:01
AC	陈红恺	5ms	7.1 MiB		110 Bytes	2023-7-15 8:22:53
AC	嘉宝 (王淳恺)	5ms	7.1 MiB		115 Bytes	2023-7-21 8:14:15
AC	赵墨竹	5ms	8 MiB		112 Bytes	2022-8-12 16:03:59
AC	坤坤荔枝小黑子 (zhonghaotian22006)	5ms	8.2 MiB		903 Bytes	2022-9-11 10:37:02
AC	李禹衡 (liyuheng22006)	5ms	8.2 MiB		110 Bytes	2022-6-7 21:19:39
AC	黄相茗	5ms	8.2 MiB		133 Bytes	2022-4-18 18:44:48
AC	SHY20091224	5ms	8.1 MiB		116 Bytes	2022-6-26 12:25:46
AC	徐正旺 (xzw)	5ms	8 MiB		104 Bytes	2022-7-29 9:11:02
AC	李信 (朱子龙)	5ms	6.6 MiB	C++11	107 Bytes	2024-7-30 10:16:04
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	5ms	8.2 MiB		160 Bytes	2023-3-5 21:05:41
AC	姚宏逸	5ms	8.2 MiB		2.2 KiB	2022-11-29 11:24:30
AC	zjz	5ms	8.2 MiB		116 Bytes	2022-2-22 18:37:56
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	5ms	8.2 MiB		140 Bytes	2022-3-26 15:38:35
AC	李荣轩	5ms	8.2 MiB		110 Bytes	2023-2-28 18:29:33
AC	新壹街校区-冉睦阳 (冉睦阳)	5ms	8.1 MiB		119 Bytes	2023-5-27 11:45:53
AC	罗宇凡 (吴彦祖)	5ms	8.2 MiB		151 Bytes	2022-1-19 9:15:58
AC	叶雨昊 (yeyuhao22006)	5ms	8.2 MiB		118 Bytes	2023-2-10 19:56:05
AC	张卜 (张卜01)	5ms	8 MiB		94 Bytes	2022-7-18 19:17:19
AC	黄立信	5ms	7.1 MiB		111 Bytes	2023-7-11 8:52:13
AC	王启仑 (wangqilun23010)	5ms	7.1 MiB		424 Bytes	2023-7-10 19:00:51
AC	陈思源	5ms	8.1 MiB		110 Bytes	2023-2-28 18:33:38
AC	德克萨斯做的到吗 (liyangbao)	5ms	8.2 MiB		122 Bytes	2022-10-24 16:50:49
AC	Error404sans (焦阳浩云)	5ms	8.2 MiB		106 Bytes	2023-1-14 14:50:05
AC	范陈翰	5ms	8.2 MiB		110 Bytes	2023-2-28 18:30:20
AC	杨淇瑞 (杨淇瑞29)	5ms	8.1 MiB		119 Bytes	2023-5-29 21:06:40
AC	吾头飞至珠峰，甚痛！ (Starry)	5ms	8.2 MiB		101 Bytes	2022-9-24 17:22:39
AC	胡瀚文	5ms	8.2 MiB		109 Bytes	2022-1-19 18:20:53
AC	曹恩瑞 (shen_mi_hei_ke1)	5ms	8.2 MiB		120 Bytes	2022-1-15 11:12:16
AC	wangzihang	5ms	8.2 MiB		130 Bytes	2022-5-14 13:07:00
AC	王韵淮	5ms	8.2 MiB		87 Bytes	2022-4-11 21:16:31
AC	陈海骞 (chq)	5ms	8.2 MiB		108 Bytes	2022-3-10 22:44:04
AC	Ronnie	5ms	8.2 MiB		137 Bytes	2022-1-19 9:34:38
AC	wuqi	5ms	8.2 MiB		117 Bytes	2022-1-25 20:03:41
AC	李宜帆	5ms	8.2 MiB		110 Bytes	2023-2-28 18:30:22
AC	朱老师 (zyp)	5ms	8.2 MiB		110 Bytes	2022-3-20 18:30:13