矩阵排列2

状态	递交者	时间	内存	语言	代码	递交时间
AC	煞笔笔	-	7 MiB		191 Bytes	2024-1-18 11:30:01
AC	wangjun	-	7 MiB		203 Bytes	2023-12-2 16:43:52
AC	陈诺	4ms	7.1 MiB		216 Bytes	2024-1-1 16:09:31
AC	zyl	4ms	7.3 MiB		195 Bytes	2024-1-4 10:28:20
AC	李卓燃 (李卓燃1)	5ms	384 KiB		211 Bytes	2023-4-7 18:57:28
AC	赵沛喆	5ms	384 KiB		231 Bytes	2022-8-4 12:47:54
AC	wangzihang	5ms	452 KiB	C++	206 Bytes	2022-8-4 9:57:26
AC	经常消失 (小萝卜)	5ms	384 KiB		216 Bytes	2022-4-4 13:31:45
AC	chenrunxiang22031	5ms	384 KiB		194 Bytes	2023-2-26 10:09:49
AC	王韵淮	5ms	392 KiB		177 Bytes	2022-5-12 21:09:22
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	5ms	384 KiB		255 Bytes	2023-2-26 10:43:52
AC	zlx (xiao)	5ms	512 KiB		274 Bytes	2022-7-27 9:28:01
AC	火爆肥肠（杨弘毅） (火爆肥肠)	5ms	512 KiB		303 Bytes	2022-3-22 21:35:33
AC	zjz	5ms	384 KiB		193 Bytes	2022-2-27 19:02:15
AC	李彭宋代诗人 (ljy123456)	5ms	416 KiB		202 Bytes	2023-4-11 21:12:12
AC	杜俊宏	5ms	384 KiB		282 Bytes	2022-5-31 13:53:22
AC	姚宏逸	5ms	384 KiB		206 Bytes	2022-5-30 22:39:03
AC	303	5ms	384 KiB		234 Bytes	2022-5-29 10:23:52
AC	杜是贤 (dushixian)	5ms	508 KiB		193 Bytes	2022-5-8 10:55:53
AC	xiangsiyu	5ms	384 KiB		242 Bytes	2022-6-19 18:44:40
AC	偽艺術家 (chenyanchi22006)	5ms	436 KiB		199 Bytes	2022-8-15 23:27:45
AC	luoluonuoya	5ms	384 KiB		210 Bytes	2022-5-28 16:22:57
AC	张月恒	5ms	6.9 MiB	C++98(O2)	183 Bytes	2024-5-26 18:06:55
AC	刘沐僖太逊了 (lmxasgy1314)	5ms	436 KiB		212 Bytes	2022-5-29 10:42:58
AC	李山水	5ms	436 KiB		236 Bytes	2022-8-4 12:38:41
AC	曹埊睿 (caodirui)	5ms	428 KiB		248 Bytes	2023-5-8 19:34:21
AC	李卓燃 (李卓燃1)	5ms	384 KiB		257 Bytes	2023-4-7 19:01:53
AC	王晨志 (wangchenzhi)	5ms	512 KiB		216 Bytes	2022-5-29 15:47:51
AC	黄梓桐 (HuangZiTong)	5ms	392 KiB		193 Bytes	2022-7-29 17:04:03
AC	kim	5ms	384 KiB		231 Bytes	2023-4-7 19:08:19
AC	qinyi	5ms	436 KiB		216 Bytes	2022-3-9 18:59:25
AC	新壹街校区-周士杰 (zsj)	5ms	384 KiB		191 Bytes	2022-12-4 19:22:38
AC	黄立信	5ms	6.8 MiB		261 Bytes	2023-10-15 13:36:44
AC	罗玮希1	5ms	384 KiB		197 Bytes	2023-4-7 19:11:08
AC	坤坤荔枝小黑子 (zhonghaotian22006)	5ms	404 KiB		193 Bytes	2022-9-11 18:04:19
AC	吴俊成 (wujuncheng)	5ms	444 KiB		212 Bytes	2022-7-10 12:32:58
AC	时代校区-孔令皓 (konglinghao)	5ms	7.2 MiB	C++98	182 Bytes	2024-5-16 22:15:17
AC	Zongzi1	5ms	6.6 MiB	C++17(O2)	206 Bytes	2024-7-18 9:56:33
AC	游智棋	5ms	7.4 MiB	C++17	206 Bytes	2024-4-27 16:04:05
AC	任瑞的学生 (jiangyadong)	5ms	440 KiB		202 Bytes	2022-6-19 13:11:10
AC	阮 (媚狐不吃道旁李)	5ms	7 MiB	C++98	242 Bytes	2024-5-25 16:30:10
AC	maomao	5ms	436 KiB		277 Bytes	2022-5-25 20:15:01
AC	Erin	5ms	6.9 MiB	C++98	195 Bytes	2024-5-5 10:43:59
AC	qwerty	5ms	368 KiB		210 Bytes	2022-3-12 16:40:49
AC	邵冠铖 (shaoguancheng22031)	5ms	384 KiB		167 Bytes	2023-2-26 10:07:25
AC	kim	5ms	384 KiB		231 Bytes	2023-4-7 19:08:20
AC	朱老师 (zyp)	5ms	440 KiB		229 Bytes	2022-8-6 14:09:39
AC	我很6 (zjj22031)	5ms	392 KiB		222 Bytes	2023-2-26 10:07:27
AC	赵鑫宸 (xiaoxiao721)	5ms	436 KiB		294 Bytes	2022-2-26 17:07:03
AC	谭懿轩 (yanyixuan)	5ms	384 KiB		198 Bytes	2022-1-3 17:53:33
AC	chen (peter)	5ms	396 KiB		220 Bytes	2022-10-5 14:05:08
AC	张祖名	5ms	6.9 MiB	C++98(O2)	249 Bytes	2024-6-10 21:36:22
AC	NJL (NJlL)	5ms	444 KiB		236 Bytes	2022-7-6 14:42:08
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	432 KiB		229 Bytes	2023-5-16 19:33:46
AC	11111	5ms	384 KiB		274 Bytes	2022-4-1 19:06:03
AC	ywh	5ms	384 KiB		203 Bytes	2022-6-28 20:06:17
AC	heyuzhe	5ms	6.9 MiB	C++98	231 Bytes	2024-8-16 8:47:55
AC	马渝杭 (mayuhang)	5ms	444 KiB		202 Bytes	2023-4-10 20:02:24
AC	17779	5ms	440 KiB		191 Bytes	2022-3-12 10:53:03
AC	zhangyh (张育菡)	5ms	440 KiB		207 Bytes	2022-7-18 8:24:51
AC	啊...这 (炼狱杏寿郎)	5ms	436 KiB		206 Bytes	2022-8-13 15:26:08
AC	冒牌陈杰晟【MOD】 (wed)	5ms	440 KiB		321 Bytes	2022-3-6 16:10:01
AC	leisixian (22029-lyh)	5ms	384 KiB		243 Bytes	2023-2-26 10:42:48
AC	huyinuo	5ms	432 KiB		208 Bytes	2022-3-18 19:26:45
AC	wangruibo20xh	5ms	440 KiB		206 Bytes	2022-2-11 14:23:23
AC	陈杰晟	5ms	384 KiB		230 Bytes	2022-2-20 11:24:01
AC	zhengjiaxiang	5ms	392 KiB		257 Bytes	2023-4-7 19:02:57
AC	SYC0226	5ms	392 KiB		218 Bytes	2022-3-20 13:09:49
AC	11451254188 (22029-mjh)	5ms	428 KiB		269 Bytes	2023-3-30 7:48:41
AC	时代2校-程俊燃 (chengjunran)	5ms	6.7 MiB		218 Bytes	2023-8-25 9:06:46
AC	汪致卉 (wangzh)	5ms	384 KiB		321 Bytes	2022-1-22 20:17:19
AC	无尽的想象 (谭仕高)	5ms	512 KiB		194 Bytes	2022-7-28 17:01:20
AC	1396013295	5ms	440 KiB		263 Bytes	2022-1-22 18:14:49
AC	何星震 (Jacob)	5ms	512 KiB		251 Bytes	2023-2-6 20:22:36
AC	zzl	5ms	6.8 MiB		235 Bytes	2023-11-7 1:04:03
AC	秦维希 (qinweixi)	5ms	384 KiB		205 Bytes	2022-5-29 11:01:41
AC	肖添宇	6ms	440 KiB		219 Bytes	2022-4-16 18:01:08
AC	chenyantong	6ms	384 KiB		225 Bytes	2023-4-7 18:59:10
AC	胡程禹	6ms	6.7 MiB		218 Bytes	2023-8-21 20:30:40
AC	时代一校-赵彦博 (zyb)	6ms	6.7 MiB		237 Bytes	2023-8-24 18:50:31
AC	kim	6ms	412 KiB		231 Bytes	2023-4-7 19:08:21
AC	李清城 (朱瀚文集训号)	6ms	428 KiB		228 Bytes	2023-2-2 17:17:44
AC	时代一校 - 冯隆浩 (冯隆浩)	6ms	384 KiB		205 Bytes	2022-10-2 23:07:47
AC	jdy	6ms	384 KiB		188 Bytes	2022-10-5 14:04:01
AC	黄梓轩 (huangzixuan)	6ms	440 KiB		235 Bytes	2023-2-11 13:58:04
AC	Tender. (05c05-zhou)	6ms	432 KiB		228 Bytes	2022-10-17 20:56:30
AC	heyi	6ms	6.8 MiB	C++98(O2)	262 Bytes	2024-8-10 11:00:47
AC	周琪渃	6ms	440 KiB		263 Bytes	2022-12-7 21:41:17
AC	(张洛诚)	6ms	512 KiB		292 Bytes	2023-4-27 19:56:42
AC	WHWHWHWHWHW (OP AI)	6ms	6.9 MiB	C++11	197 Bytes	2024-7-1 18:12:24
AC	kim	6ms	384 KiB		231 Bytes	2023-4-7 19:08:20
AC	kim	6ms	412 KiB		231 Bytes	2023-4-7 19:08:20
AC	ganlin1	6ms	6.9 MiB		199 Bytes	2023-7-27 9:48:01
AC	伍行念 (wuxingnian)	6ms	6.7 MiB		238 Bytes	2023-9-27 20:45:56
AC	胡宸华 (huchenhua)	6ms	384 KiB		215 Bytes	2022-11-12 23:08:48
AC	爱琴海校区-刁钲洋 (刁钲洋)	6ms	512 KiB		211 Bytes	2023-2-8 18:55:13
AC	呵呵呵 (陈思琦)	6ms	444 KiB		187 Bytes	2022-12-31 16:34:39
AC	我很6 (zjj22031)	6ms	512 KiB		222 Bytes	2023-2-26 10:35:52
AC	zzzrrrxxx	6ms	6.7 MiB		186 Bytes	2023-9-17 19:44:26
AC	谁陪訫牞（杀手） (22029-zys)	6ms	436 KiB		211 Bytes	2023-1-5 17:13:59