矩阵算斜线

状态	递交者	时间	内存	语言	代码	递交时间
AC	许律天	4ms	7 MiB		380 Bytes	2023-12-23 17:11:56
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	6ms	7.2 MiB		409 Bytes	2024-1-19 16:00:00
AC	曹雅萱	6ms	7.2 MiB	C++11	608 Bytes	2024-5-2 11:57:23
AC	Turorany (郑浩然)	6ms	7.2 MiB	C++98	479 Bytes	2024-5-3 16:11:28
AC	安闵煜 (anzai)	6ms	6.9 MiB	C++11	418 Bytes	2024-8-18 10:49:05
AC	张月恒	7ms	7 MiB	C++98(O2)	604 Bytes	2024-6-2 17:33:38
AC	陈家熠	7ms	7.2 MiB	C++11	596 Bytes	2024-5-3 9:10:00
AC	6 (chenjiacheng)	7ms	6.8 MiB	C++98	286 Bytes	2024-6-7 16:04:23
AC	陈杰晟	7ms	384 KiB		327 Bytes	2023-2-15 14:12:26
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	7ms	7.2 MiB	C++98	447 Bytes	2024-4-21 11:42:30
AC	希蒙 (zhengxingya)	7ms	7.2 MiB	C++98	650 Bytes	2024-4-20 16:34:53
AC	zcx	7ms	384 KiB		352 Bytes	2023-3-25 9:10:14
AC	zzzrrrxxx	7ms	6.9 MiB	C++98	278 Bytes	2024-6-16 14:31:12
AC	张祖名	7ms	6.8 MiB	C++98(O2)	501 Bytes	2024-8-7 22:38:14
AC	22029-zjs	7ms	384 KiB		480 Bytes	2023-3-24 18:14:42
AC	周琪渃	7ms	384 KiB		532 Bytes	2023-1-30 18:46:12
AC	郑尧 (zhengyao)	7ms	7.2 MiB	C++98	440 Bytes	2024-5-4 21:34:32
AC	lvyanshan	7ms	7 MiB	C++98	518 Bytes	2024-5-11 17:24:28
AC	段淏泷	7ms	6.8 MiB	C++98	387 Bytes	2024-5-21 21:34:00
AC	U城校区-郭旻哲 (郭旻哲)	7ms	6.7 MiB		335 Bytes	2023-8-30 14:30:03
AC	xuniaoyin (徐袅音)	7ms	7.2 MiB	C++98(O2)	342 Bytes	2024-5-15 21:59:26
AC	11451254188 (22029-mjh)	7ms	408 KiB		354 Bytes	2023-3-25 9:09:53
AC	小忙果 (王昱杰)	7ms	7.1 MiB		485 Bytes	2023-7-18 9:24:04
AC	邵清泉	7ms	7 MiB	C++11	387 Bytes	2024-5-14 16:45:15
AC	yiqiuyu23002	7ms	6.9 MiB		328 Bytes	2023-7-27 12:01:43
AC	游智棋	7ms	7 MiB	C++17	518 Bytes	2024-6-9 20:24:14
AC	张瑞博	7ms	6.9 MiB	C++11	442 Bytes	2024-8-19 12:06:46
AC	吴佳智 (AWM)	7ms	6.8 MiB		479 Bytes	2023-6-27 17:27:43
AC	huanglu	8ms	384 KiB		613 Bytes	2023-1-9 23:38:04
AC	爱琴海校区-黄辰浩 (huangchenhao)	8ms	8 MiB		670 Bytes	2023-8-22 17:07:01
AC	胡澜之 (666hlz666)	8ms	6.8 MiB		479 Bytes	2023-6-27 17:28:08
AC	缥 (王硕2012)	8ms	384 KiB		960 Bytes	2023-3-25 9:36:46
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)	8ms	384 KiB		520 Bytes	2023-3-25 9:12:00
AC	陈骏逸 (chenjunyi)	8ms	7.2 MiB		577 Bytes	2023-7-9 14:42:28
AC	郑岐蔚	8ms	440 KiB		444 Bytes	2023-1-26 15:18:11
AC	爱琴海校区-刁钲洋 (刁钲洋)	8ms	6.8 MiB		806 Bytes	2023-8-22 14:50:20
AC	刘老师 (图书管理员)	8ms	7.1 MiB	C++11	387 Bytes	2024-5-14 17:32:46
AC	scallway	8ms	6.9 MiB		350 Bytes	2023-7-2 15:30:34
AC	我推的乱破 (贺俊楠)	8ms	6.9 MiB		667 Bytes	2023-7-6 8:30:45
AC	黄梓轩 (huangzixuan)	8ms	7.4 MiB		343 Bytes	2023-7-14 9:28:09
AC	huyinuo	8ms	428 KiB		473 Bytes	2022-12-13 18:50:21
AC	朱老师 (zyp)	8ms	6.9 MiB		352 Bytes	2023-7-27 11:59:54
AC	新壹街——陈学彬 (BUG)	9ms	7.1 MiB		466 Bytes	2023-7-6 9:51:33
AC	三差学生(尘埃蓝莓) (白佳睿)	12ms	7.3 MiB		380 Bytes	2024-1-17 19:42:41
AC	杨镇宇	35ms	544 KiB		359 Bytes	2024-3-15 18:40:11
AC	Accepted (周芷乐)	38ms	532 KiB	C++14	440 Bytes	2024-10-5 15:33:05