矩阵加法

状态	递交者	时间	内存	代码	递交时间
AC	wrqwc	38ms	472 KiB	357 Bytes	2022-7-1 15:00:43
AC	tcx	38ms	512 KiB	497 Bytes	2023-2-12 9:33:03
AC	赵彬鸿	38ms	492 KiB	370 Bytes	2022-8-14 14:27:43
AC	22029-hqh	38ms	512 KiB	796 Bytes	2023-1-8 9:46:40
AC	ywh	38ms	572 KiB	386 Bytes	2022-6-11 11:26:37
AC	李树崑 (lishukun)	38ms	512 KiB	400 Bytes	2022-3-26 15:05:50
AC	赵彬鸿	38ms	568 KiB	370 Bytes	2022-8-14 14:27:38
AC	wrqwc	38ms	456 KiB	357 Bytes	2022-7-1 15:00:41
AC	高国瑞	38ms	6.9 MiB	583 Bytes	2023-7-30 11:20:42
AC	刘锦航	38ms	512 KiB	392 Bytes	2022-6-12 18:11:32
AC	tcx	38ms	540 KiB	497 Bytes	2023-2-12 9:33:04
AC	胡瀚文	38ms	1.3 MiB	397 Bytes	2022-7-15 17:17:23
AC	tcx	38ms	512 KiB	497 Bytes	2023-2-12 9:33:07
AC	李卓燃 (李卓燃1)	38ms	564 KiB	462 Bytes	2023-3-24 20:56:41
AC	乐瀚阳 (yuehanyang)	38ms	680 KiB	398 Bytes	2023-4-15 17:25:35
AC	陈家齐 (陈家齐1)	38ms	6.9 MiB	377 Bytes	2023-7-5 16:44:46
AC	yangbinyu	38ms	568 KiB	388 Bytes	2022-11-6 11:55:51
AC	22029-hqh	38ms	512 KiB	796 Bytes	2023-1-8 9:46:38
AC	tcx	38ms	512 KiB	497 Bytes	2023-2-12 9:31:20
AC	暗蛆突围 (lzh)	38ms	628 KiB	669 Bytes	2023-5-12 18:10:54
AC	cupy战士 (05c05-dkf)	38ms	604 KiB	427 Bytes	2023-3-5 15:35:02
AC	谭懿轩 (yanyixuan)	38ms	548 KiB	348 Bytes	2022-2-19 10:13:02
AC	xyc (谢雨宸)	38ms	584 KiB	412 Bytes	2023-5-28 9:31:01
AC	甄一阳 (22016-zyy)	38ms	560 KiB	486 Bytes	2022-12-4 9:09:13
AC	11451254188 (22029-mjh)	38ms	512 KiB	392 Bytes	2023-1-31 16:29:19
AC	微风将至 (李睿轩)	38ms	1.5 MiB	549 Bytes	2022-5-29 20:16:25
AC	我是曾科智儿子 (沈小童)	38ms	600 KiB	402 Bytes	2023-5-13 15:08:39
AC	暗蛆突围 (lzh)	38ms	576 KiB	635 Bytes	2023-5-12 18:11:26
AC	tcx	38ms	512 KiB	497 Bytes	2023-2-12 9:35:06
AC	tcx	38ms	512 KiB	497 Bytes	2023-2-12 9:33:06
AC	原著校区巫映秋 (巫映秋1a)	38ms	6.8 MiB	397 Bytes	2023-6-18 17:18:02
AC	kapurua	38ms	564 KiB	389 Bytes	2023-5-3 10:32:31
AC	^_^ (ctc)	38ms	572 KiB	391 Bytes	2023-2-27 19:46:09
AC	tcx	38ms	508 KiB	497 Bytes	2023-2-12 9:33:04
AC	zcx	38ms	572 KiB	391 Bytes	2023-1-8 10:35:05
AC	22029-lsl	38ms	520 KiB	403 Bytes	2023-1-8 9:58:16
AC	22029-hqh	39ms	512 KiB	796 Bytes	2023-1-8 9:46:40
AC	22029-hqh	39ms	652 KiB	796 Bytes	2023-1-8 9:46:36
AC	暗蛆突围 (lzh)	39ms	520 KiB	635 Bytes	2023-5-12 18:11:26
AC	许峻浩	39ms	520 KiB	354 Bytes	2023-3-5 15:48:03
AC	时代2校+涂彦迪 (tuyandi)	39ms	6.9 MiB	398 Bytes	2023-7-11 16:24:17
AC	任希贤	39ms	628 KiB	548 Bytes	2023-5-13 16:22:57
AC	余彦瑞	39ms	6.7 MiB	425 Bytes	2023-6-4 12:18:24
AC	司雨来 (siyulai)	39ms	528 KiB	476 Bytes	2023-1-15 20:27:56
AC	zjm	39ms	464 KiB	413 Bytes	2023-2-12 9:34:03
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)	39ms	640 KiB	614 Bytes	2023-1-8 11:46:58
AC	熊海阳 (xiongxaiyang)	39ms	6.9 MiB	389 Bytes	2023-8-19 18:06:22
AC	CK (李弘毅)	39ms	564 KiB	466 Bytes	2022-12-17 11:10:07
AC	sqmyb	39ms	564 KiB	399 Bytes	2023-3-12 17:56:23
AC	赵彬鸿	39ms	472 KiB	370 Bytes	2022-8-14 14:27:43
AC	tcx	39ms	520 KiB	497 Bytes	2023-2-12 9:33:06
AC	时代一校-赵彦博 (zyb)	39ms	560 KiB	384 Bytes	2022-11-6 12:01:39
AC	爱琴海校区-刁钲洋 (刁钲洋)	39ms	552 KiB	528 Bytes	2023-3-5 15:27:23
AC	wrqwc	39ms	512 KiB	357 Bytes	2022-7-1 15:00:39
AC	叶雨昊 (yeyuhao22006)	39ms	564 KiB	358 Bytes	2022-10-23 20:18:09
AC	22029-hqh	39ms	512 KiB	796 Bytes	2023-1-8 9:46:42
AC	远方传来笛	39ms	552 KiB	406 Bytes	2023-3-26 18:22:37
AC	tcx	39ms	512 KiB	497 Bytes	2023-2-12 9:33:06
AC	22029-hqh	39ms	512 KiB	796 Bytes	2023-1-8 9:46:41
AC	22029-lyh	39ms	644 KiB	377 Bytes	2023-1-8 10:24:05
AC	(金沙天街)严皓月 (严皓月)	39ms	588 KiB	382 Bytes	2023-5-7 10:57:43
AC	王子恩	39ms	580 KiB	446 Bytes	2022-9-25 14:21:04
AC	暗蛆突围 (lzh)	39ms	568 KiB	635 Bytes	2023-5-12 18:11:26
AC	王瀚毅 (wanghanyi)	39ms	576 KiB	369 Bytes	2022-11-6 12:28:19
AC	喻兴诚 (Brian)	39ms	520 KiB	395 Bytes	2022-2-20 10:28:58
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	39ms	564 KiB	487 Bytes	2023-1-8 9:35:53
AC	暗蛆突围 (lzh)	39ms	520 KiB	635 Bytes	2023-5-12 18:11:25
AC	赵彬鸿	39ms	400 KiB	370 Bytes	2022-8-14 14:27:41
AC	22029-hqh	39ms	520 KiB	796 Bytes	2023-1-8 9:46:38
AC	许律天	40ms	7.1 MiB	411 Bytes	2023-12-23 16:53:22
AC	谁陪訫牞（杀手） (22029-zys)	40ms	564 KiB	562 Bytes	2023-1-31 16:34:51
AC	任舒尧	40ms	520 KiB	378 Bytes	2022-9-23 18:38:40
AC	scallway	40ms	556 KiB	366 Bytes	2022-12-10 14:40:42
AC	明哲瀚 (18580067605)	40ms	1.3 MiB	501 Bytes	2023-2-21 21:00:22
AC	22029-hqh	40ms	520 KiB	796 Bytes	2023-1-8 9:46:39
AC	Tender. (05c05-zhou)	40ms	548 KiB	417 Bytes	2022-10-18 11:46:05
AC	蒲梓勋 (puzixun)	41ms	604 KiB	472 Bytes	2022-10-2 11:32:32
AC	22029-hqh	41ms	512 KiB	796 Bytes	2023-1-8 9:46:39
AC	科比.布莱恩特 (董浩琰)	41ms	6.9 MiB	425 Bytes	2023-8-3 11:00:02
AC	dengduxi	41ms	584 KiB	458 Bytes	2023-1-16 19:40:36
AC	tcx	41ms	512 KiB	497 Bytes	2023-2-12 9:33:04
AC	三差学生 (尘埃蓝莓)	41ms	7.2 MiB	363 Bytes	2023-11-25 18:56:12
AC	毕源博	42ms	596 KiB	431 Bytes	2023-5-28 17:11:12
AC	拥抱幸福小熊(吴沛篪)	42ms	7.2 MiB	418 Bytes	2023-12-30 11:30:23
AC	张玉坚 (zhangyuian)	43ms	1.3 MiB	395 Bytes	2023-3-12 16:28:52
AC	新壹街陈科言 (cky)	44ms	6.9 MiB	407 Bytes	2023-7-19 16:16:31
AC	罗伟杰 (13308275065)	44ms	1.6 MiB	629 Bytes	2022-8-31 16:24:18
AC	王康瑞	44ms	7.2 MiB	394 Bytes	2023-12-30 11:26:58
AC	暗蛆突围 (lzh)	44ms	520 KiB	635 Bytes	2023-5-12 18:11:26
AC	zyl	45ms	7.3 MiB	738 Bytes	2024-1-5 15:45:51
AC	wanghuaiying	45ms	7.1 MiB	375 Bytes	2023-12-29 19:03:39
AC	张雯皓 (zhangwenhao)	46ms	7 MiB	410 Bytes	2023-12-23 11:26:01
AC	徐子恩 (Cow)	49ms	492 KiB	396 Bytes	2022-2-20 10:23:12
AC	暗蛆突围 (lzh)	50ms	520 KiB	635 Bytes	2023-5-12 18:11:26
AC	陈佳婧	51ms	572 KiB	401 Bytes	2022-9-25 14:38:30
AC	郭人瑀作业号	52ms	568 KiB	374 Bytes	2022-8-2 16:05:32
AC	朱老师 (zyp)	54ms	6.8 MiB	399 Bytes	2023-10-2 20:30:30
AC	小根哥	54ms	512 KiB	467 Bytes	2022-9-6 20:46:52
AC	luosifu22006	54ms	568 KiB	369 Bytes	2022-8-20 18:54:15
AC	朱老师 (zyp)	55ms	6.7 MiB	384 Bytes	2023-9-5 18:55:31