矩阵列优先输出

状态	递交者	时间	内存	语言	代码	递交时间
AC	Nico	15ms	6.9 MiB		404 Bytes	2023-10-3 18:00:24
AC	李山水	16ms	440 KiB		378 Bytes	2022-2-20 14:59:45
AC	时代二校+王吕棪 (wanglvyan)	16ms	7 MiB		267 Bytes	2023-6-17 16:39:29
AC	时代二校+马嘉宸 (majiachen)	16ms	6.9 MiB		286 Bytes	2023-6-17 16:49:42
AC	时代2校+涂彦迪 (tuyandi)	16ms	7.5 MiB		273 Bytes	2023-7-12 16:27:09
AC	22029-hqh	16ms	384 KiB		363 Bytes	2023-1-9 11:55:07
AC	22029-hqh	16ms	384 KiB		363 Bytes	2023-1-9 11:55:16
AC	22029-hqh	16ms	392 KiB		363 Bytes	2023-1-9 11:55:00
AC	时代2校-程俊燃 (chengjunran)	16ms	7.2 MiB		361 Bytes	2023-6-17 16:56:26
AC	22029-zjs	16ms	384 KiB		344 Bytes	2023-1-9 11:46:08
AC	zhouxifei	16ms	512 KiB		384 Bytes	2022-10-15 9:30:27
AC	22029-hqh	16ms	384 KiB		363 Bytes	2023-1-9 11:55:06
AC	时代二校-焦雨齐 (Angel)	16ms	6.9 MiB		293 Bytes	2023-6-17 16:43:58
AC	可爱的小花狗	16ms	6.9 MiB		326 Bytes	2023-6-17 16:53:47
AC	22029-hqh	16ms	512 KiB		363 Bytes	2023-1-9 11:55:01
AC	谭懿轩 (yanyixuan)	16ms	452 KiB		289 Bytes	2022-8-9 15:59:14
AC	22029-hqh	16ms	384 KiB		363 Bytes	2023-1-9 11:55:16
AC	22029-hqh	16ms	384 KiB		363 Bytes	2023-1-9 11:55:07
AC	leisixian (22029-lyh)	16ms	384 KiB		443 Bytes	2023-1-9 11:45:21
AC	22029-hqh	16ms	384 KiB		363 Bytes	2023-1-9 11:55:07
AC	贾博涵	16ms	7 MiB		314 Bytes	2023-12-21 10:03:07
AC	李哲 (lizhe)	16ms	436 KiB		347 Bytes	2022-10-14 21:14:29
AC	10255	16ms	7.3 MiB		293 Bytes	2023-7-6 16:24:56
AC	弹射起飞 ? 冲 ! (吴周周)	16ms	7 MiB		419 Bytes	2023-6-17 16:41:07
AC	黄梓轩 (huangzixuan)	16ms	444 KiB		334 Bytes	2023-2-11 13:54:27
AC	leisixian (22029-lyh)	16ms	392 KiB		443 Bytes	2023-1-9 11:45:18
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	16ms	384 KiB		273 Bytes	2023-2-19 9:59:34
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	548 KiB		377 Bytes	2022-10-23 16:14:12
AC	22029-lsl	16ms	384 KiB		298 Bytes	2023-1-9 11:45:32
AC	22029-hqh	16ms	392 KiB		363 Bytes	2023-1-9 11:55:00
AC	胡程禹	16ms	6.7 MiB		303 Bytes	2023-8-21 20:29:40
AC	zlx (xiao)	16ms	540 KiB		456 Bytes	2022-11-26 18:34:30
AC	时代二校-陈天成 (鸭缩毛巾)	16ms	6.9 MiB		286 Bytes	2023-6-17 16:38:38
AC	22029-hqh	16ms	384 KiB		363 Bytes	2023-1-9 11:55:06
AC	张智洋	16ms	7.2 MiB		276 Bytes	2023-6-17 16:57:12
AC	xiongxinyao	17ms	520 KiB		294 Bytes	2023-5-26 20:00:37
AC	22029-hqh	17ms	384 KiB		363 Bytes	2023-1-9 11:55:06
AC	毕浩宇 (bihaoyu)	17ms	6.9 MiB		330 Bytes	2023-6-17 16:33:08
AC	huanglu	17ms	6.8 MiB		381 Bytes	2023-6-17 8:37:47
AC	时代一校-曾科智 (曾科智)	17ms	512 KiB		352 Bytes	2022-9-25 10:23:06
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	17ms	392 KiB		375 Bytes	2023-1-9 11:46:26
AC	新壹街校区-陈品烨 (陈品烨)	17ms	6.6 MiB		457 Bytes	2023-6-3 20:54:49
AC	22029-hqh	17ms	408 KiB		363 Bytes	2023-1-9 11:55:07
AC	Jack	17ms	384 KiB		314 Bytes	2023-5-24 18:19:35
AC	时代2校+施皓宬 (shihaocheng)	17ms	7.2 MiB		297 Bytes	2023-6-17 16:55:18
AC	RanHao	17ms	6.9 MiB		281 Bytes	2023-7-25 15:30:33
AC	22029-hqh	17ms	384 KiB		363 Bytes	2023-1-9 11:55:15
AC	刘政君 (lzj)	17ms	512 KiB		295 Bytes	2022-8-31 13:08:15
AC	你猜呀	17ms	6.9 MiB		275 Bytes	2023-6-30 14:29:27
AC	22029-hqh	17ms	384 KiB		363 Bytes	2023-1-9 11:55:01
AC	没有此人 (akm)	17ms	6.9 MiB		364 Bytes	2023-7-2 19:05:44
AC	ganlin1	17ms	6.9 MiB		296 Bytes	2023-8-14 13:46:41
AC	22029-hqh	17ms	440 KiB		363 Bytes	2023-1-9 11:55:15
AC	22029-hqh	17ms	392 KiB		363 Bytes	2023-1-9 11:54:55
AC	许律天	17ms	7 MiB		316 Bytes	2023-12-23 17:20:00
AC	zhouxifei	17ms	512 KiB		384 Bytes	2022-10-15 9:30:02
AC	22029-hqh	17ms	384 KiB		363 Bytes	2023-1-9 11:55:01
AC	bilbil	18ms	6.9 MiB		315 Bytes	2023-6-17 16:44:56
AC	22029-hqh	18ms	384 KiB		363 Bytes	2023-1-9 11:55:06
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	512 KiB		443 Bytes	2023-1-9 11:35:36
AC	无尽的想象 (谭仕高)	18ms	436 KiB		297 Bytes	2022-12-14 14:50:11
AC	爱琴海校区-刁钲洋 (刁钲洋)	18ms	6.9 MiB		433 Bytes	2023-7-26 20:19:03
AC	22029-hqh	18ms	392 KiB		363 Bytes	2023-1-9 11:55:06
AC	chen (peter)	18ms	6.8 MiB		549 Bytes	2023-6-17 9:39:04
AC	ycy	18ms	436 KiB		425 Bytes	2022-9-29 20:55:58
AC	三差学生(尘埃蓝莓) (白佳睿)	18ms	7.1 MiB		294 Bytes	2023-7-11 10:20:55
AC	hrz	19ms	7.1 MiB		309 Bytes	2023-12-17 15:42:07
AC	22029-hqh	19ms	436 KiB		363 Bytes	2023-1-9 11:55:01
AC	scallway	19ms	512 KiB		268 Bytes	2022-12-10 14:38:35
AC	Tender. (05c05-zhou)	19ms	436 KiB		319 Bytes	2022-10-18 11:50:31
AC	在煎鱼的肖大总铳 (肖宇航)	19ms	6.8 MiB		320 Bytes	2023-9-24 11:22:50
AC	CK (李弘毅)	19ms	432 KiB		328 Bytes	2022-12-17 11:12:38
AC	时代一校-赵彦博 (zyb)	20ms	6.8 MiB		278 Bytes	2023-8-26 15:03:38
AC	wangjun	20ms	7.2 MiB		297 Bytes	2023-11-30 12:59:17
AC	郑驭辰	20ms	7.2 MiB		303 Bytes	2023-12-27 19:50:30
AC	tcx	21ms	392 KiB		313 Bytes	2023-2-19 10:01:10
AC	陈廷恩	21ms	6.9 MiB		366 Bytes	2023-12-14 22:14:06
AC	wanghuaiying	24ms	7.2 MiB		279 Bytes	2023-12-29 19:17:54
AC	tcx	25ms	512 KiB		313 Bytes	2023-2-19 10:01:12
AC	zyl	28ms	7 MiB		295 Bytes	2024-1-6 13:20:33
AC	陌生人 (涂玉龙)	29ms	7.2 MiB		291 Bytes	2023-12-17 15:57:35
AC	秦兴润	36ms	6.9 MiB		298 Bytes	2023-11-26 10:28:56
AC	yuchenyi23017	67ms	532 KiB		283 Bytes	2024-1-28 15:27:32
AC	Billy52013 (李子轩)	69ms	548 KiB		303 Bytes	2024-3-15 21:25:03
AC	杨骏逸	71ms	576 KiB		271 Bytes	2024-3-15 21:48:10
AC	ReFly (NKZKY)	72ms	580 KiB		374 Bytes	2024-2-1 16:59:22
AC	阮 (媚狐不吃道旁李)	73ms	804 KiB		353 Bytes	2024-4-13 10:18:19
AC	曹雅萱	75ms	764 KiB	C++11	376 Bytes	2024-9-3 9:41:24
AC	曾麟	76ms	768 KiB	C++11	284 Bytes	2024-9-3 15:59:21
AC	fcxin	130ms	9.3 MiB	Python 3	327 Bytes	2024-8-17 11:45:07
AC	cola	203ms	3.9 MiB	Python 3	246 Bytes	2022-12-27 18:16:16
AC	谭红中 (不知道)	207ms	3.9 MiB	Python 3	295 Bytes	2022-4-9 22:42:53
AC	姚宏逸	209ms	4 MiB	Python 3	201 Bytes	2022-5-29 11:47:16
AC	梨冻亿 (wiueh)	214ms	4 MiB	Python 3	345 Bytes	2022-1-23 18:26:28
AC	wangruibo20xh	216ms	4 MiB	Python 3	201 Bytes	2022-2-12 19:07:26
AC	wangzihang	338ms	9.8 MiB	Python 3	210 Bytes	2023-12-16 20:47:00
AC	高俊	340ms	9.8 MiB	Python 3	210 Bytes	2023-11-22 15:23:14