矩阵交换行

状态	递交者	时间	内存	代码	递交时间
AC	时代一校-王宥量 (wangyouliang)	16ms	392 KiB	348 Bytes	2022-11-6 12:21:50
AC	时代2校-程俊燃 (chengjunran)	16ms	6.8 MiB	369 Bytes	2023-6-10 16:41:20
AC	colin1112 (墙凌可)	16ms	6.7 MiB	536 Bytes	2023-9-4 21:21:21
AC	煞笔笔	16ms	6.7 MiB	376 Bytes	2023-9-28 20:03:05
AC	luosifu22006	16ms	432 KiB	489 Bytes	2022-8-20 17:48:27
AC	林小博	16ms	432 KiB	571 Bytes	2023-3-4 8:59:21
AC	叶雨昊 (yeyuhao22006)	16ms	388 KiB	361 Bytes	2022-9-25 17:43:54
AC	马渝杭 (mayuhang)	16ms	440 KiB	373 Bytes	2022-9-8 18:13:29
AC	luosifu22006	16ms	384 KiB	489 Bytes	2022-9-25 17:40:29
AC	luosifu22006	16ms	392 KiB	489 Bytes	2022-9-25 17:40:28
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	392 KiB	461 Bytes	2022-9-25 17:37:54
AC	qinlang	16ms	6.8 MiB	347 Bytes	2023-10-20 20:06:53
AC	王彬羽 (wby)	16ms	440 KiB	426 Bytes	2023-5-18 19:23:18
AC	zhouxifei	16ms	440 KiB	418 Bytes	2022-10-7 11:59:01
AC	22029-zjs	16ms	512 KiB	464 Bytes	2023-1-7 15:36:37
AC	黄梓轩 (huangzixuan)	16ms	424 KiB	457 Bytes	2023-2-11 13:53:48
AC	zjm	17ms	392 KiB	437 Bytes	2023-2-12 9:56:23
AC	Aphrode	17ms	6.9 MiB	415 Bytes	2023-8-13 17:14:23
AC	时代1校-杨宇轩 (杨宇轩)	17ms	6.7 MiB	344 Bytes	2023-8-22 12:34:39
AC	史韵哲	17ms	6.7 MiB	376 Bytes	2023-6-4 10:31:43
AC	陈泰羽 (chentaiyu)	17ms	436 KiB	538 Bytes	2023-3-30 21:59:32
AC	李廷旭 (litingxu)	17ms	6.9 MiB	519 Bytes	2023-7-13 15:23:10
AC	杨坤霖 (steven)	17ms	512 KiB	531 Bytes	2022-12-24 13:22:49
AC	zhuqiwei22006	17ms	384 KiB	329 Bytes	2022-9-25 17:44:47
AC	坤坤荔枝小黑子 (zhonghaotian22006)	17ms	432 KiB	461 Bytes	2022-9-25 17:42:23
AC	22029-hqh	17ms	384 KiB	502 Bytes	2023-1-8 10:33:38
AC	sqmyb	17ms	428 KiB	414 Bytes	2023-3-12 18:01:26
AC	LUKHE (LukeHu)	17ms	420 KiB	546 Bytes	2022-2-18 18:23:48
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	17ms	384 KiB	413 Bytes	2023-2-12 9:51:14
AC	luosifu22006	17ms	440 KiB	489 Bytes	2022-9-25 17:40:42
AC	zjm	17ms	392 KiB	437 Bytes	2023-2-12 9:56:23
AC	缥 (王硕2012)	17ms	440 KiB	419 Bytes	2023-3-7 19:23:10
AC	zhm123	17ms	448 KiB	358 Bytes	2022-11-24 13:18:01
AC	三差学生 (尘埃蓝莓)	17ms	7 MiB	322 Bytes	2023-11-25 19:10:07
AC	zjm	17ms	392 KiB	437 Bytes	2023-2-12 9:56:22
AC	叶雨昊 (yeyuhao22006)	17ms	512 KiB	369 Bytes	2022-11-26 16:49:32
AC	22016-lyj	17ms	512 KiB	380 Bytes	2023-4-14 22:02:42
AC	https://www.minecraft.net/zh-hans (王振西)	17ms	6.9 MiB	365 Bytes	2023-6-18 14:27:13
AC	CK (李弘毅)	17ms	512 KiB	358 Bytes	2022-12-17 11:11:13
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:43
AC	zhangheyi22006	17ms	384 KiB	421 Bytes	2022-9-25 17:44:19
AC	王子恩	17ms	460 KiB	399 Bytes	2022-9-25 14:21:48
AC	22029-hqh	17ms	412 KiB	502 Bytes	2023-1-8 10:33:36
AC	坤坤荔枝小黑子 (zhonghaotian22006)	17ms	384 KiB	461 Bytes	2022-9-25 17:42:33
AC	坤坤荔枝小黑子 (zhonghaotian22006)	17ms	400 KiB	461 Bytes	2022-9-25 17:42:28
AC	弹射起飞 ? 冲 ! (吴周周)	17ms	6.8 MiB	485 Bytes	2023-6-10 16:34:58
AC	暗蛆突围 (lzh)	17ms	452 KiB	410 Bytes	2023-5-12 18:19:06
AC	原著校区巫映秋 (巫映秋1a)	17ms	7 MiB	414 Bytes	2023-6-18 17:23:30
AC	坤坤荔枝小黑子 (zhonghaotian22006)	17ms	392 KiB	461 Bytes	2022-9-25 17:42:27
AC	22029-hqh	17ms	384 KiB	502 Bytes	2023-1-8 10:33:39
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	17ms	384 KiB	484 Bytes	2023-1-8 9:56:05
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:29
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:31
AC	22029-lsl	17ms	392 KiB	409 Bytes	2023-1-8 10:57:04
AC	Tender. (05c05-zhou)	17ms	440 KiB	706 Bytes	2022-10-18 11:46:38
AC	时代二校-王盼兮 (wangpanxi)	17ms	8 MiB	364 Bytes	2023-8-25 15:42:05
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:41
AC	^_^ (ctc)	17ms	520 KiB	366 Bytes	2023-2-27 20:00:11
AC	Jose (反恐皮蛋)	17ms	436 KiB	431 Bytes	2022-10-12 14:52:11
AC	ycy	17ms	440 KiB	625 Bytes	2022-9-25 12:13:08
AC	爱琴海校区-刁钲洋 (刁钲洋)	17ms	6.7 MiB	299 Bytes	2023-9-17 12:39:22
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:42
AC	霍弈丞小号	17ms	512 KiB	460 Bytes	2023-3-12 16:47:14
AC	时代二校-陈天成 (鸭缩毛巾)	17ms	6.8 MiB	363 Bytes	2023-6-10 16:37:14
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:41
AC	scallway	17ms	384 KiB	371 Bytes	2022-12-10 14:39:08
AC	liusitong	17ms	7.2 MiB	406 Bytes	2023-6-18 14:53:15
AC	Error404sans (焦阳浩云)	17ms	7.1 MiB	365 Bytes	2023-6-18 14:45:53
AC	繁星 (05c35-zzm)	17ms	432 KiB	480 Bytes	2022-12-4 10:01:36
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:16
AC	坤坤荔枝小黑子 (zhonghaotian22006)	17ms	384 KiB	461 Bytes	2022-9-25 17:42:33
AC	xuniaoyin (徐袅音)	17ms	7.1 MiB	382 Bytes	2023-7-14 10:20:25
AC	leisixian (22029-lyh)	17ms	384 KiB	465 Bytes	2023-1-8 10:56:50
AC	张子轩 (zhangzixuana)	17ms	440 KiB	428 Bytes	2022-11-6 12:15:18
AC	坤坤荔枝小黑子 (zhonghaotian22006)	17ms	384 KiB	461 Bytes	2022-9-25 17:42:29
AC	22029-hqh	17ms	420 KiB	502 Bytes	2023-1-8 10:33:39
AC	胡宸华 (huchenhua)	17ms	6.9 MiB	449 Bytes	2023-7-7 21:48:04
AC	luosifu22006	17ms	384 KiB	489 Bytes	2022-9-25 17:40:30
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	384 KiB	461 Bytes	2022-9-25 17:42:27
AC	zcx	18ms	428 KiB	384 Bytes	2023-1-8 10:55:43
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	392 KiB	461 Bytes	2022-9-25 17:42:29
AC	ganlin1	18ms	6.9 MiB	343 Bytes	2023-8-3 16:13:53
AC	乐瀚阳 (yuehanyang)	18ms	512 KiB	375 Bytes	2023-4-15 17:25:59
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	384 KiB	461 Bytes	2022-9-25 17:42:28
AC	dengduxi	18ms	440 KiB	423 Bytes	2023-1-16 19:40:08
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	384 KiB	461 Bytes	2022-9-25 17:42:26
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	384 KiB	461 Bytes	2022-9-25 17:42:31
AC	luosifu22006	18ms	392 KiB	489 Bytes	2022-9-25 17:40:29
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	392 KiB	461 Bytes	2022-9-25 17:42:26
AC	huanglu	18ms	436 KiB	464 Bytes	2022-11-4 16:45:24
AC	luosifu22006	18ms	392 KiB	489 Bytes	2022-9-25 17:40:38
AC	王晴萱	18ms	6.9 MiB	389 Bytes	2023-7-18 11:10:23
AC	luosifu22006	18ms	388 KiB	489 Bytes	2022-9-25 17:40:39
AC	luosifu22006	18ms	384 KiB	489 Bytes	2022-9-25 17:40:28
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)	18ms	384 KiB	557 Bytes	2023-1-8 11:44:36
AC	luosifu22006	18ms	384 KiB	489 Bytes	2022-9-25 17:40:38
AC	岳鑫正	18ms	6.9 MiB	435 Bytes	2023-6-28 16:59:57
AC	ttt123	18ms	512 KiB	514 Bytes	2023-1-7 15:26:44
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	392 KiB	461 Bytes	2022-9-25 17:39:08
AC	luosifu22006	18ms	384 KiB	489 Bytes	2022-9-25 17:40:30