同行列对角线的格子

状态	递交者	时间	内存	语言	代码	递交时间
AC	MoonLight ( aaa)	7ms	256 KiB		823 Bytes	2022-1-26 20:25:13
AC	胡宸华 (huchenhua)	7ms	316 KiB		628 Bytes	2022-2-14 19:22:31
AC	wangzihang	7ms	304 KiB	C	511 Bytes	2023-3-4 13:42:08
AC	朱泽晟	7ms	312 KiB		511 Bytes	2022-9-5 10:26:22
AC	GYZ	12ms	384 KiB		646 Bytes	2022-5-26 13:12:47
AC	张瑞博	12ms	7 MiB	C++11	498 Bytes	2024-5-28 21:13:47
AC	汪致卉 (wangzh)	12ms	384 KiB		740 Bytes	2022-1-23 19:56:02
AC	赵沛喆	12ms	392 KiB		556 Bytes	2022-5-22 10:12:10
AC	陈杰晟	13ms	392 KiB		846 Bytes	2022-3-26 13:39:59
AC	Qinxiu	13ms	6.6 MiB	C++20(O2)	503 Bytes	2024-7-25 19:30:07
AC	11111	13ms	392 KiB		1 KiB	2022-5-25 19:24:57
AC	陈秋石	13ms	392 KiB		577 Bytes	2022-6-15 21:10:44
AC	安闵煜 (anzai)	13ms	6.8 MiB	C++11	839 Bytes	2024-8-14 15:23:08
AC	李树崑 (lishukun)	13ms	384 KiB		658 Bytes	2022-3-26 13:21:25
AC	爱琴海校区-刁钲洋 (刁钲洋)	13ms	420 KiB		646 Bytes	2023-5-8 21:59:24
AC	三藏的痔疮 (不会玩是原罪)	13ms	384 KiB		481 Bytes	2022-1-21 20:24:31
AC	Erin	13ms	7 MiB	C++98	535 Bytes	2024-5-30 15:04:18
AC	李倾城的忠实假粉 (向熠可)	13ms	384 KiB		539 Bytes	2022-3-26 10:59:55
AC	梨冻亿 (wiueh)	13ms	392 KiB		620 Bytes	2022-1-23 18:24:23
AC	朱老师 (zyp)	13ms	400 KiB		470 Bytes	2022-8-4 17:00:33
AC	赵泳鑫 (zhaoyongxin)	13ms	512 KiB		638 Bytes	2022-7-12 11:26:12
AC	朱老师 (zyp)	13ms	7 MiB	C++11	898 Bytes	2024-5-28 21:05:48
AC	爱琴海校区jzn (jzn)	13ms	6.4 MiB	C++98	648 Bytes	2024-7-5 15:44:22
AC	疯神芭芭脱丝 (李卓修)	13ms	392 KiB		607 Bytes	2022-6-5 18:45:59
AC	qinjin11	13ms	384 KiB		553 Bytes	2022-7-10 11:02:23
AC	. (Pig)	13ms	392 KiB		646 Bytes	2022-6-5 14:18:11
AC	ttt123	13ms	412 KiB		783 Bytes	2023-2-4 10:45:53
AC	姚宏逸	13ms	384 KiB		658 Bytes	2022-2-15 19:36:37
AC	22029-zjs	13ms	384 KiB		807 Bytes	2023-2-3 19:37:39
AC	谢延灏 (xeiyanhao---a handsome boy)	13ms	512 KiB		556 Bytes	2022-7-31 14:10:16
AC	Zongzi1	13ms	6.8 MiB	C++17(O2)	603 Bytes	2024-8-4 17:01:46
AC	zcx	13ms	440 KiB		546 Bytes	2023-1-29 10:57:35
AC	22029-lsl	13ms	384 KiB		554 Bytes	2023-2-4 11:45:07
AC	安闵煜 (anzai)	13ms	6.8 MiB	C++11	816 Bytes	2024-8-14 15:34:04
AC	郭人瑀作业号	13ms	436 KiB		642 Bytes	2022-8-2 16:14:34
AC	谭懿轩 (yanyixuan)	13ms	440 KiB		514 Bytes	2022-8-6 17:26:47
AC	文硕 (文硕1)	13ms	412 KiB		638 Bytes	2022-7-12 11:46:42
AC	xmw318046	13ms	7.1 MiB	C++98	684 Bytes	2024-4-24 12:57:27
AC	张祖名	13ms	6.9 MiB	C++98(O2)	715 Bytes	2024-6-14 23:24:13
AC	yang	13ms	436 KiB		606 Bytes	2022-8-19 17:12:24
AC	谁陪訫牞（杀手） (22029-zys)	13ms	384 KiB		922 Bytes	2023-2-3 19:53:31
AC	SYC0226	14ms	384 KiB		631 Bytes	2022-3-20 14:12:14
AC	希蒙 (zhengxingya)	14ms	6.9 MiB	C++98	665 Bytes	2024-6-15 8:54:55
AC	喵 (蹇心悦)	14ms	436 KiB		641 Bytes	2022-8-15 11:14:55
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	14ms	7.2 MiB	C++98	607 Bytes	2024-5-18 20:58:20
AC	chen (peter)	14ms	384 KiB		1009 Bytes	2022-3-6 19:33:13
AC	贾博涵	14ms	7 MiB		705 Bytes	2023-12-19 12:54:09
AC	伍行念 (wuxingnian)	14ms	6.8 MiB		783 Bytes	2023-10-27 13:37:44
AC	11451254188 (22029-mjh)	14ms	392 KiB		502 Bytes	2023-2-4 11:09:37
AC	邹曜丞 (13983097018)	14ms	6.8 MiB		469 Bytes	2023-10-3 14:49:28
AC	zhangyh (张育菡)	14ms	432 KiB		548 Bytes	2022-6-10 22:42:38
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	6.8 MiB		653 Bytes	2023-10-26 19:04:14
AC	枉哲锐	14ms	384 KiB		497 Bytes	2022-1-26 20:04:28
AC	xiangsiyu	14ms	392 KiB		461 Bytes	2022-8-4 17:00:22
AC	贾鑫豪 (Mr Sam)	14ms	392 KiB		533 Bytes	2022-3-8 18:42:16
AC	欧俊阳	14ms	6.9 MiB		638 Bytes	2023-7-28 10:51:45
AC	yuqihao	14ms	7.3 MiB		416 Bytes	2024-1-6 11:47:10
AC	Jose (反恐皮蛋)	14ms	436 KiB		748 Bytes	2022-7-12 14:54:01
AC	周琪渃	14ms	412 KiB		742 Bytes	2023-3-8 21:47:34
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)	14ms	384 KiB		610 Bytes	2023-2-4 11:35:32
AC	樊竣熠 (lft1114)	14ms	436 KiB		533 Bytes	2022-2-23 21:37:11
AC	zcx	14ms	424 KiB		529 Bytes	2023-2-3 19:19:11
AC	Nico	14ms	6.9 MiB		564 Bytes	2023-10-3 17:58:15
AC	dengfeng	14ms	440 KiB		637 Bytes	2022-3-17 14:17:24
AC	王乐仪	14ms	444 KiB		649 Bytes	2022-2-6 19:32:16
AC	chen (peter)	14ms	384 KiB		1009 Bytes	2022-3-6 19:30:24
AC	芒苒忧 (廖迦南)	14ms	436 KiB		495 Bytes	2022-2-26 9:54:23
AC	ddz	14ms	424 KiB		629 Bytes	2022-4-10 16:39:29
AC	Tender. (05c05-zhou)	15ms	440 KiB		558 Bytes	2023-2-23 19:59:51
AC	luoluonuoya	15ms	436 KiB		580 Bytes	2022-8-12 15:59:20
AC	时代二校+王吕棪 (wanglvyan)	15ms	7 MiB		477 Bytes	2023-6-17 18:03:42
AC	任童(rentong)	15ms	440 KiB		639 Bytes	2023-2-2 17:56:10
AC	毕浩宇 (bihaoyu)	15ms	6.9 MiB		524 Bytes	2023-6-17 17:59:57
AC	zhouxifei	15ms	384 KiB		534 Bytes	2022-10-14 20:55:39
AC	马渝杭 (mayuhang)	15ms	436 KiB		584 Bytes	2022-9-29 18:28:23
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	392 KiB		642 Bytes	2023-2-4 10:05:29
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB		506 Bytes	2023-9-10 10:34:49
AC	时代二校-焦雨齐 (Angel)	15ms	6.9 MiB		507 Bytes	2023-6-17 17:56:32
AC	周琪渃	15ms	428 KiB		632 Bytes	2023-3-8 21:44:17
AC	时代二校-陈天成 (鸭缩毛巾)	15ms	6.9 MiB		514 Bytes	2023-6-17 18:02:28
AC	胡澜之 (666hlz666)	15ms	6.8 MiB		700 Bytes	2023-6-23 10:06:02
AC	hrz	15ms	7.1 MiB		539 Bytes	2024-1-24 10:48:48
AC	时代2校-程俊燃 (chengjunran)	15ms	6.9 MiB		638 Bytes	2023-6-17 18:01:25
AC	无尽的想象 (谭仕高)	15ms	384 KiB		564 Bytes	2022-12-14 12:54:02
AC	RanHao	15ms	6.9 MiB		723 Bytes	2023-7-23 19:42:53
AC	时代二校+马嘉宸 (majiachen)	16ms	7 MiB		518 Bytes	2023-6-17 18:03:56
AC	金沙校区-康瀚文 (开朗的康)	16ms	6.9 MiB		482 Bytes	2023-12-13 20:59:35
AC	时代2校+施皓宬 (shihaocheng)	16ms	6.9 MiB		541 Bytes	2023-6-17 18:09:25
AC	jdy	16ms	440 KiB		451 Bytes	2022-10-7 12:55:23
AC	时代2校+涂彦迪 (tuyandi)	16ms	8.3 MiB		466 Bytes	2023-7-11 17:09:09
AC	可爱的小花狗	16ms	6.9 MiB		514 Bytes	2023-6-17 18:11:29
AC	弹射起飞 ? 冲 ! (吴周周)	16ms	6.9 MiB		712 Bytes	2023-6-17 17:55:44
AC	周琪渃	16ms	436 KiB		742 Bytes	2023-3-8 21:47:23
AC	时代一校-赵彦博 (zyb)	16ms	6.7 MiB		455 Bytes	2023-8-26 14:39:09
AC	ganlin1	16ms	6.9 MiB		442 Bytes	2023-8-3 16:38:00
AC	zhm123	16ms	6.9 MiB		580 Bytes	2023-6-17 17:58:39
AC	zzzrrrxxx	17ms	6.7 MiB		480 Bytes	2023-8-23 19:10:29
AC	杨坤霖 (steven)	17ms	512 KiB		491 Bytes	2023-1-15 15:25:44
AC	金沙校区-李嘉齐 (李嘉齐)	18ms	7 MiB		618 Bytes	2023-12-4 20:46:55
AC	唐彬献	19ms	7.3 MiB		433 Bytes	2024-1-6 11:59:12