二维数字排列

状态	递交者	时间	内存	语言	代码	递交时间
AC	Erin	14ms	7.2 MiB	C++98	197 Bytes	2024-5-26 11:26:31
AC	雷文博（帅哥） (18983951391)	14ms	384 KiB		215 Bytes	2023-2-19 15:23:49
AC	李山水	14ms	428 KiB		231 Bytes	2022-7-28 18:45:39
AC	任童(rentong)	14ms	432 KiB		225 Bytes	2022-7-2 14:58:28
AC	lzq	14ms	440 KiB		222 Bytes	2022-3-9 22:41:12
AC	wangjun	14ms	6.9 MiB		193 Bytes	2023-11-29 20:12:41
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	384 KiB		256 Bytes	2023-2-4 9:08:33
AC	王韵淮	14ms	436 KiB		174 Bytes	2022-6-9 21:30:44
AC	piter	14ms	384 KiB		234 Bytes	2022-2-26 14:48:33
AC	时代一校 - 冯隆浩 (冯隆浩)	14ms	384 KiB		198 Bytes	2022-9-3 20:11:51
AC	chenjunyao	14ms	6.8 MiB		197 Bytes	2023-8-26 11:27:23
AC	雷文博（帅哥） (18983951391)	14ms	384 KiB		215 Bytes	2023-2-19 15:23:57
AC	时代一校林星宇 (lxy)	14ms	384 KiB		193 Bytes	2022-9-3 20:14:00
AC	wuzhenghan	14ms	428 KiB		241 Bytes	2023-2-5 21:08:54
AC	范宜灵	14ms	388 KiB		244 Bytes	2022-6-21 15:58:26
AC	黄梓桐 (HuangZiTong)	14ms	384 KiB		183 Bytes	2022-8-7 10:36:34
AC	新壹街校区-陈品烨 (陈品烨)	14ms	6.8 MiB		194 Bytes	2023-10-3 9:49:03
AC	罗翌珂 (dangdang)	14ms	424 KiB		256 Bytes	2022-9-1 9:34:00
AC	李卓燃 (李卓燃1)	14ms	392 KiB		192 Bytes	2023-3-10 20:23:55
AC	SYC0226	14ms	384 KiB		228 Bytes	2022-3-20 13:39:56
AC	伍芷函	14ms	436 KiB		223 Bytes	2022-9-12 13:41:18
AC	吕同学是傻逼 (黄立信)	14ms	6.8 MiB		256 Bytes	2023-10-20 22:25:42
AC	雷文博（帅哥） (18983951391)	14ms	384 KiB		215 Bytes	2023-2-19 15:23:50
AC	李树崑 (lishukun)	14ms	384 KiB		268 Bytes	2022-2-26 15:02:53
AC	bvvd	14ms	7 MiB	C++98	227 Bytes	2024-6-19 15:24:13
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	14ms	392 KiB		247 Bytes	2022-1-28 16:03:49
AC	疯神芭芭脱丝 (李卓修)	14ms	384 KiB		238 Bytes	2022-1-25 18:19:44
AC	雷文博（帅哥） (18983951391)	14ms	384 KiB		215 Bytes	2023-2-19 15:23:49
AC	文硕 (文硕1)	14ms	512 KiB		296 Bytes	2022-7-12 11:41:29
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	14ms	440 KiB		188 Bytes	2023-2-1 18:00:25
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	7.1 MiB		229 Bytes	2023-9-24 11:09:22
AC	zvt_132 (任子轩)	14ms	6.7 MiB		200 Bytes	2023-9-2 0:01:12
AC	tsc_ (杨悦堃)	14ms	512 KiB		244 Bytes	2023-5-13 20:14:20
AC	高国瑞	14ms	6.9 MiB		224 Bytes	2023-7-17 11:03:17
AC	炸鱼4000+ (dxc)	14ms	7.1 MiB		196 Bytes	2023-11-14 21:54:49
AC	yuhaodi	14ms	384 KiB		240 Bytes	2023-5-22 16:54:52
AC	樊竣熠 (lft1114)	14ms	432 KiB		214 Bytes	2022-8-18 9:30:25
AC	zhm123	14ms	432 KiB		190 Bytes	2023-2-12 19:30:32
AC	三差学生(尘埃蓝莓) (白佳睿)	14ms	6.9 MiB		199 Bytes	2023-8-13 10:10:37
AC	MoonLight ( aaa)	14ms	512 KiB		337 Bytes	2022-2-19 9:38:28
AC	雷文博（帅哥） (18983951391)	14ms	448 KiB		215 Bytes	2023-2-19 15:23:51
AC	zhanghaoran	14ms	384 KiB		260 Bytes	2022-2-26 11:05:25
AC	孙烽轶 (sfy)	14ms	6.8 MiB	C++98	183 Bytes	2024-8-11 20:27:23
AC	繁星 (05c35-zzm)	14ms	436 KiB		227 Bytes	2022-12-2 11:40:06
AC	yanglang	14ms	512 KiB		200 Bytes	2023-2-12 9:19:53
AC	周琪渃	14ms	432 KiB		251 Bytes	2022-12-31 17:11:58
AC	伍行念 (wuxingnian)	14ms	6.8 MiB		238 Bytes	2023-10-8 14:15:26
AC	雷文博（帅哥） (18983951391)	14ms	384 KiB		215 Bytes	2023-2-19 15:23:49
AC	李龙腾 (llt)	14ms	384 KiB		206 Bytes	2022-9-3 20:10:42
AC	ganlin1	14ms	6.9 MiB		205 Bytes	2023-7-28 13:23:28
AC	经常消失 (小萝卜)	14ms	512 KiB		205 Bytes	2022-2-26 14:57:27
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	436 KiB		247 Bytes	2022-6-29 17:36:07
AC	王重道	14ms	420 KiB		208 Bytes	2022-4-16 18:19:44
AC	雷文博（帅哥） (18983951391)	14ms	400 KiB		215 Bytes	2023-2-19 15:23:54
AC	hulang	15ms	440 KiB		286 Bytes	2022-2-14 17:49:58
AC	刘蕤箎	15ms	6.8 MiB		191 Bytes	2023-8-26 11:27:39
AC	雷文博（帅哥） (18983951391)	15ms	384 KiB		215 Bytes	2023-2-19 15:23:56
AC	谭懿轩 (yanyixuan)	15ms	440 KiB		187 Bytes	2022-2-19 9:57:23
AC	xuniaoyin (徐袅音)	15ms	436 KiB		208 Bytes	2023-2-19 15:23:11
AC	时代校区-刘臣原 (微笑王子)	15ms	440 KiB		185 Bytes	2022-9-3 20:09:18
AC	王义苇 (wangyiwei)	15ms	384 KiB		200 Bytes	2023-2-19 15:24:07
AC	铁牛杰哥官方频道	15ms	424 KiB		216 Bytes	2022-3-9 20:16:19
AC	王宇桐 (我是外挂)	15ms	420 KiB		267 Bytes	2022-8-14 20:08:19
AC	colin1112 (墙凌可)	15ms	6.7 MiB		225 Bytes	2023-9-4 21:13:06
AC	(张洛诚)	15ms	440 KiB		267 Bytes	2023-4-28 20:40:24
AC	雷文博（帅哥） (18983951391)	15ms	384 KiB		215 Bytes	2023-2-19 15:23:51
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	384 KiB		231 Bytes	2022-12-13 22:59:16
AC	陈骏逸 (chenjunyi)	15ms	392 KiB		194 Bytes	2022-9-11 11:57:02
AC	稻妻第一深情 (喝酒の吟游诗人)	15ms	512 KiB		1.3 KiB	2023-3-11 23:46:45
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)	15ms	436 KiB		253 Bytes	2023-5-16 20:06:31
AC	cupy战士 (05c05-dkf)	15ms	6.9 MiB		223 Bytes	2023-9-24 11:31:31
AC	王祎辰 (wangyichen)	15ms	432 KiB		256 Bytes	2023-3-26 21:19:28
AC	希蒙 (zhengxingya)	15ms	6.8 MiB		284 Bytes	2023-10-11 17:15:26
AC	chenyantong	15ms	392 KiB		200 Bytes	2023-3-10 20:25:20
AC	印昭旭（412） (印昭旭)	15ms	392 KiB		189 Bytes	2023-4-2 10:55:25
AC	杨瀚霖 (yanghanlin)	15ms	384 KiB		224 Bytes	2023-3-11 11:07:29
AC	朱老师 (zyp)	15ms	384 KiB		223 Bytes	2022-8-7 11:12:55
AC	阮 (媚狐不吃道旁李)	15ms	7.3 MiB	C++98	223 Bytes	2024-5-25 16:39:31
AC	李廷旭 (litingxu)	15ms	6.8 MiB		215 Bytes	2023-10-22 16:28:26
AC	张梓辰 (DiaoDesi屌德斯)	15ms	440 KiB		234 Bytes	2022-7-18 19:45:10
AC	牟淳雅	15ms	6.7 MiB		190 Bytes	2023-9-24 14:49:37
AC	zhengjiaxiang	15ms	392 KiB		199 Bytes	2023-3-10 20:22:49
AC	时代二校-陈天成 (鸭缩毛巾)	15ms	6.5 MiB		205 Bytes	2023-6-3 21:49:54
AC	kim	15ms	384 KiB		223 Bytes	2023-3-10 20:23:22
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.9 MiB		181 Bytes	2023-7-26 18:27:07
AC	wangzihang	15ms	6.7 MiB		226 Bytes	2023-8-29 11:38:35
AC	陈泰羽 (chentaiyu)	16ms	420 KiB		195 Bytes	2023-3-10 20:29:00
AC	源著校区-宋昊成 (马冬梅)	16ms	432 KiB		256 Bytes	2023-2-25 18:30:59
AC	算法战神 (konglinghao)	16ms	7.2 MiB	C++98	847 Bytes	2024-5-18 15:09:42
AC	尹浩宁2077	16ms	6.9 MiB		199 Bytes	2023-6-30 7:47:50
AC	chenyantong	16ms	384 KiB		200 Bytes	2023-3-10 20:25:17
AC	秦子越 (13883322087)	16ms	424 KiB		267 Bytes	2022-2-18 18:52:23
AC	胡宸华 (huchenhua)	16ms	512 KiB		211 Bytes	2023-1-7 15:20:11
AC	没有此人 (akm)	16ms	6.9 MiB		245 Bytes	2023-7-2 19:04:27
AC	时代1校-杨宇轩 (杨宇轩)	16ms	6.7 MiB		211 Bytes	2023-8-22 12:21:33
AC	偽艺術家 (chenyanchi22006)	16ms	440 KiB		186 Bytes	2022-8-21 22:12:22
AC	彭嘉豪 (pengjiahao)	16ms	432 KiB		200 Bytes	2022-8-27 17:21:44
AC	葛琮扬	16ms	6.9 MiB		223 Bytes	2023-7-23 14:39:46
AC	时代一校-赵彦博 (zyb)	16ms	6.9 MiB		220 Bytes	2023-8-5 14:38:58
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	16ms	440 KiB		231 Bytes	2022-12-13 22:59:16