矩阵指定行求和

状态	递交者	时间	内存	语言	代码	递交时间
AC	杨坤霖 (steven)	8ms	256 KiB		372 Bytes	2023-2-1 18:36:54
AC	杨坤霖 (steven)	9ms	264 KiB		372 Bytes	2023-2-1 18:36:53
AC	杨坤霖 (steven)	9ms	256 KiB		372 Bytes	2023-2-1 18:36:53
AC	杨坤霖 (steven)	9ms	256 KiB		372 Bytes	2023-2-1 18:36:52
AC	杨坤霖 (steven)	9ms	264 KiB		372 Bytes	2023-2-1 18:36:54
AC	杨坤霖 (steven)	9ms	264 KiB		372 Bytes	2023-2-1 18:36:51
AC	杨坤霖 (steven)	9ms	256 KiB		372 Bytes	2023-2-1 18:36:50
AC	杨坤霖 (steven)	9ms	256 KiB		372 Bytes	2023-2-1 18:36:52
AC	高彬月	10ms	7.1 MiB		321 Bytes	2023-12-10 16:11:46
AC	张瑞博	17ms	6.7 MiB	C++11	313 Bytes	2024-7-11 23:12:38
AC	xzf	17ms	6.6 MiB	C++98	593 Bytes	2024-7-21 16:57:00
AC	周琪渃	18ms	384 KiB		385 Bytes	2023-2-2 19:08:34
AC	(张洛诚)	18ms	7 MiB		358 Bytes	2023-6-17 16:06:17
AC	时代二校-焦雨齐 (Angel)	18ms	7.1 MiB		366 Bytes	2023-6-10 19:38:40
AC	acc	18ms	7.2 MiB	C++11	308 Bytes	2024-5-10 15:21:19
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	436 KiB		351 Bytes	2023-2-26 18:15:32
AC	时代二校-焦雨齐 (Angel)	18ms	7.1 MiB		366 Bytes	2023-6-10 19:38:34
AC	吴佳智 (AWM)	19ms	6.8 MiB		324 Bytes	2023-6-23 10:18:13
AC	时代二校-陈天成 (鸭缩毛巾)	19ms	7 MiB		297 Bytes	2023-6-17 15:29:21
AC	雷诺伊尔 (崔金鹏)	19ms	6.8 MiB	C++17	345 Bytes	2024-8-9 20:21:00
AC	李禹衡 (liyuheng22006)	19ms	440 KiB		281 Bytes	2023-2-26 18:26:35
AC	Guest	19ms	6.5 MiB	C++98(O2)	418 Bytes	2024-7-21 16:53:54
AC	colin1112 (墙凌可)	20ms	6.7 MiB		382 Bytes	2023-6-17 16:51:04
AC	时代2校+涂彦迪 (tuyandi)	20ms	8.3 MiB		300 Bytes	2023-7-11 17:21:19
AC	胡澜之 (666hlz666)	20ms	6.8 MiB		324 Bytes	2023-6-23 10:18:59
AC	爱琴海校区-刁钲洋 (刁钲洋)	20ms	6.8 MiB		407 Bytes	2023-6-29 15:10:10
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)	20ms	6.8 MiB		334 Bytes	2023-6-24 12:17:05
AC	希蒙 (zhengxingya)	20ms	6.9 MiB		350 Bytes	2023-7-21 8:26:49
AC	不怎么聪明的家伙 (贺俊楠)	20ms	396 KiB		448 Bytes	2023-5-28 11:58:19
AC	新壹街校区-陈琬舒 (空空大师)	20ms	6.7 MiB		338 Bytes	2023-9-13 10:49:13
AC	hrz	20ms	7.1 MiB		331 Bytes	2023-12-10 16:16:42
AC	吴佳智 (AWM)	20ms	6.8 MiB		324 Bytes	2023-6-23 10:18:03
AC	huyinuo	20ms	384 KiB		363 Bytes	2023-1-10 20:20:35
AC	时代二校-焦雨齐 (Angel)	21ms	7.1 MiB		366 Bytes	2023-6-10 19:38:48
AC	dream	22ms	7.3 MiB		417 Bytes	2023-7-9 10:05:33
AC	时代一校-赵彦博 (zyb)	22ms	6.9 MiB		328 Bytes	2023-7-15 11:11:45
AC	李哲 (lizhe)	23ms	512 KiB		393 Bytes	2023-1-15 12:17:16
AC	陈雨泽1	23ms	6.9 MiB		339 Bytes	2023-7-7 15:32:48
AC	陌生人 (涂玉龙)	24ms	7.1 MiB		334 Bytes	2023-12-10 16:09:45
AC	冯若涵	29ms	7.1 MiB		297 Bytes	2023-12-29 20:04:48
AC	ChongqingGroup (Donce)	42ms	7.1 MiB		318 Bytes	2023-12-10 16:14:44