计算矩阵边缘元素之和

状态	递交者	时间	内存	代码	递交时间
AC	乐瀚阳 (yuehanyang)	24ms	6.9 MiB	296 Bytes	2023-8-19 17:10:05
AC	任童(rentong)	24ms	464 KiB	396 Bytes	2022-7-2 15:03:14
AC	陈思博	24ms	512 KiB	413 Bytes	2022-2-19 18:44:58
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	24ms	392 KiB	330 Bytes	2023-2-12 10:13:34
AC	李卓燃 (李卓燃1)	24ms	492 KiB	407 Bytes	2023-3-28 21:14:39
AC	许峻浩	24ms	384 KiB	335 Bytes	2023-3-12 13:18:06
AC	许峻浩	24ms	512 KiB	335 Bytes	2023-3-12 13:18:15
AC	(张洛诚)	24ms	6.7 MiB	374 Bytes	2023-6-8 19:08:45
AC	疯神芭芭脱丝 (李卓修)	24ms	560 KiB	364 Bytes	2022-2-27 17:03:37
AC	邬文博	24ms	484 KiB	553 Bytes	2022-7-1 16:26:05
AC	22029-hqh	24ms	392 KiB	377 Bytes	2023-1-8 10:16:39
AC	庹仕杰	24ms	460 KiB	304 Bytes	2023-5-16 18:41:35
AC	繁星 (05c35-zzm)	24ms	512 KiB	413 Bytes	2022-12-4 10:02:10
AC	许峻浩	24ms	452 KiB	335 Bytes	2023-3-12 13:18:07
AC	谁陪訫牞（杀手） (22029-zys)	24ms	452 KiB	371 Bytes	2023-1-31 17:03:08
AC	soha (武夷岩)	24ms	384 KiB	279 Bytes	2022-12-3 15:48:43
AC	我推的乱破 (贺俊楠)	24ms	768 KiB	276 Bytes	2023-5-14 14:57:42
AC	暗蛆突围 (lzh)	24ms	564 KiB	346 Bytes	2023-5-12 18:24:40
AC	kkksc03 (彭士锋)	24ms	812 KiB	338 Bytes	2022-3-12 13:28:39
AC	ttt123	24ms	512 KiB	364 Bytes	2023-1-31 16:52:31
AC	许峻浩	24ms	448 KiB	335 Bytes	2023-3-12 13:18:17
AC	CK (李弘毅)	24ms	384 KiB	407 Bytes	2022-12-3 15:46:16
AC	soha (武夷岩)	24ms	456 KiB	279 Bytes	2022-12-3 15:48:43
AC	22029-lyh	24ms	412 KiB	377 Bytes	2023-1-8 11:02:34
AC	zhouzipu	24ms	544 KiB	677 Bytes	2022-8-21 14:30:01
AC	22029-hqh	24ms	384 KiB	377 Bytes	2023-1-8 10:17:36
AC	22029-lsl	24ms	408 KiB	396 Bytes	2023-1-8 11:30:43
AC	ttt123	24ms	512 KiB	466 Bytes	2023-1-8 11:21:59
AC	谢雨贝	24ms	6.7 MiB	268 Bytes	2023-6-4 10:35:20
AC	22029-lyh	24ms	384 KiB	377 Bytes	2023-1-8 11:02:21
AC	许峻浩	24ms	448 KiB	335 Bytes	2023-3-12 13:18:17
AC	Tender. (05c05-zhou)	24ms	476 KiB	275 Bytes	2022-10-18 11:46:53
AC	luosifu22006	24ms	488 KiB	387 Bytes	2022-8-20 18:18:01
AC	灵光sans (wangchihao)	24ms	392 KiB	341 Bytes	2022-12-3 15:45:50
AC	张景豪	24ms	512 KiB	333 Bytes	2023-2-25 21:04:20
AC	新壹街校区-陈琬舒 (空空大师)	24ms	6.7 MiB	271 Bytes	2023-9-13 10:31:37
AC	Jack	25ms	512 KiB	354 Bytes	2023-1-11 9:35:01
AC	chenjunyao	25ms	6.8 MiB	351 Bytes	2023-8-25 18:37:08
AC	郭人瑀作业号	25ms	816 KiB	315 Bytes	2022-8-2 16:06:03
AC	lizhengqian19	25ms	6.8 MiB	584 Bytes	2023-6-12 15:53:53
AC	许峻浩	25ms	448 KiB	335 Bytes	2023-3-12 13:18:07
AC	ganlin1	25ms	6.9 MiB	254 Bytes	2023-8-3 16:17:01
AC	雷文博（帅哥） (18983951391)	25ms	384 KiB	426 Bytes	2023-3-12 13:19:52
AC	sqmyb	25ms	768 KiB	356 Bytes	2023-3-12 18:15:13
AC	无尽的想象 (谭仕高)	25ms	384 KiB	258 Bytes	2022-9-10 18:46:21
AC	许峻浩	25ms	448 KiB	335 Bytes	2023-3-12 13:18:06
AC	朱泽晟	25ms	452 KiB	301 Bytes	2022-8-31 17:14:48
AC	xyc (谢雨宸)	25ms	384 KiB	337 Bytes	2023-5-28 9:33:09
AC	dengduxi	25ms	444 KiB	255 Bytes	2023-1-16 19:39:23
AC	没有此人 (akm)	25ms	6.9 MiB	356 Bytes	2023-7-2 19:11:12
AC	胡瀚文	25ms	888 KiB	358 Bytes	2022-7-16 15:10:47
AC	三差学生(尘埃蓝莓) (白佳睿)	25ms	7.1 MiB	404 Bytes	2023-7-11 10:18:57
AC	原著校区巫映秋 (巫映秋1a)	25ms	7 MiB	444 Bytes	2023-6-18 17:28:26
AC	小翔的粉丝	25ms	7.5 MiB	317 Bytes	2023-7-3 10:01:46
AC	zhm123	25ms	512 KiB	330 Bytes	2022-11-24 13:13:55
AC	孙烽轶 (sfy)	25ms	384 KiB	349 Bytes	2022-12-3 15:45:48
AC	爱琴海校区-黄辰浩 (huangchenhao)	25ms	512 KiB	475 Bytes	2023-3-6 19:39:57
AC	tcx	25ms	444 KiB	396 Bytes	2023-2-12 10:12:01
AC	yixingyou	25ms	460 KiB	310 Bytes	2022-12-3 15:56:50
AC	zhouxifei	25ms	480 KiB	266 Bytes	2022-10-7 12:09:08
AC	叶雨昊 (yeyuhao22006)	25ms	560 KiB	308 Bytes	2022-12-4 12:17:48
AC	22016-lyj	25ms	452 KiB	275 Bytes	2023-5-8 21:15:05
AC	许峻浩	25ms	392 KiB	335 Bytes	2023-3-12 13:18:14
AC	缥 (王硕2012)	25ms	512 KiB	338 Bytes	2023-3-7 19:22:44
AC	科比.布莱恩特 (董浩琰)	25ms	6.9 MiB	374 Bytes	2023-8-3 11:00:33
AC	源著校区-宋昊成 (马冬梅)	26ms	512 KiB	360 Bytes	2023-2-25 18:37:04
AC	胡程禹	26ms	6.9 MiB	366 Bytes	2023-7-7 9:30:07
AC	张玉坚 (zhangyuian)	26ms	768 KiB	294 Bytes	2023-3-12 17:32:52
AC	李哲 (lizhe)	26ms	392 KiB	335 Bytes	2022-10-3 22:04:16
AC	甄一阳 (22016-zyy)	26ms	444 KiB	269 Bytes	2022-11-24 18:31:45
AC	liusitong	26ms	6.8 MiB	268 Bytes	2023-6-22 10:13:58
AC	杨浩灵 (金坷拉)	26ms	444 KiB	396 Bytes	2023-1-14 15:29:14
AC	22029-hqh	26ms	424 KiB	377 Bytes	2023-1-8 10:16:39
AC	印昭旭（412） (印昭旭)	26ms	468 KiB	328 Bytes	2023-5-28 9:23:32
AC	zcx	26ms	432 KiB	329 Bytes	2023-1-8 11:22:21
AC	22029-hqh	26ms	520 KiB	377 Bytes	2023-1-8 10:16:34
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	26ms	448 KiB	434 Bytes	2023-1-8 10:31:15
AC	22029-hqh	26ms	452 KiB	377 Bytes	2023-1-8 10:17:36
AC	陈泰羽 (chentaiyu)	27ms	492 KiB	351 Bytes	2023-3-24 21:18:38
AC	cupy战士 (05c05-dkf)	27ms	512 KiB	290 Bytes	2023-3-5 15:42:50
AC	Randy Marsh (杨子腾)	27ms	512 KiB	378 Bytes	2023-1-13 15:25:20
AC	郑驭辰	27ms	7 MiB	275 Bytes	2023-12-27 19:35:33
AC	杜启苇 (duqiwei)	27ms	464 KiB	349 Bytes	2022-8-30 14:27:49
AC	22029-zjs	27ms	440 KiB	411 Bytes	2023-1-7 15:10:04
AC	司雨来 (siyulai)	28ms	476 KiB	284 Bytes	2023-1-15 20:28:56
AC	罗伟杰 (13308275065)	28ms	408 KiB	335 Bytes	2022-8-30 14:44:15
AC	ycy	28ms	440 KiB	396 Bytes	2022-9-25 12:15:41
AC	huanglu	29ms	472 KiB	422 Bytes	2022-9-17 16:38:29
AC	经常消失 (小萝卜)	29ms	904 KiB	476 Bytes	2022-3-23 20:38:02
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)	30ms	456 KiB	521 Bytes	2023-1-8 11:20:58
AC	希蒙 (zhengxingya)	31ms	6.9 MiB	535 Bytes	2023-7-21 8:25:43
AC	蒲梓勋 (puzixun)	31ms	768 KiB	369 Bytes	2022-10-2 11:37:41
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	32ms	7.2 MiB	248 Bytes	2024-1-19 15:57:01
AC	200800	35ms	7.2 MiB	519 Bytes	2023-12-15 20:18:20
AC	张梓浩 (zhangzihao)	35ms	6.7 MiB	492 Bytes	2023-11-21 20:17:47
AC	三差学生 (尘埃蓝莓)	35ms	7 MiB	305 Bytes	2023-11-25 19:25:48
AC	Guest	35ms	7.3 MiB	251 Bytes	2023-12-16 15:10:13
AC	zyl	37ms	7.3 MiB	404 Bytes	2024-1-5 15:46:40
AC	林凡童 (lft)	37ms	476 KiB	411 Bytes	2022-9-15 19:55:14
AC	贾博涵	39ms	7 MiB	311 Bytes	2023-12-19 12:38:19