简单的输入2

状态	递交者	时间	内存	语言	代码	递交时间
AC	zyq1	7ms	384 KiB		127 Bytes	2023-3-27 21:48:10
AC	叶哲宇 (yzy)	7ms	392 KiB		116 Bytes	2023-3-29 20:56:53
AC	罗元邑2	7ms	6.8 MiB		101 Bytes	2023-6-30 16:11:31
AC	李山水	7ms	392 KiB		162 Bytes	2022-1-29 13:10:03
AC	zhangxinyue	7ms	384 KiB		103 Bytes	2022-11-19 10:33:39
AC	任舒尧	7ms	440 KiB		121 Bytes	2023-2-1 9:59:10
AC	张皓南2	7ms	512 KiB		159 Bytes	2022-10-30 12:52:05
AC	22029-lsl	7ms	428 KiB		122 Bytes	2022-12-2 18:38:58
AC	田开蕊	7ms	6.8 MiB		124 Bytes	2023-10-15 19:14:44
AC	范昊燃	7ms	6.8 MiB	C++98	108 Bytes	2024-8-14 8:52:08
AC	邵冠铖 (shaoguancheng22031)	7ms	424 KiB		91 Bytes	2022-10-23 12:02:13
AC	罗宇凡 (吴彦祖)	7ms	384 KiB		117 Bytes	2022-1-19 11:02:32
AC	雷承翰1	7ms	440 KiB		111 Bytes	2023-2-18 20:36:45
AC	ReFly (NKZKY)	7ms	6.8 MiB		108 Bytes	2023-11-29 21:14:56
AC	草\|\|草 (陈星佑)	7ms	384 KiB		128 Bytes	2022-4-16 11:00:00
AC	许徐非凡 (非同凡响)	7ms	384 KiB		91 Bytes	2022-9-30 21:24:46
AC	文硕 (文硕1)	7ms	392 KiB		104 Bytes	2022-1-29 21:19:22
AC	时代一校石博文 (shibowen)	7ms	7 MiB		122 Bytes	2023-12-21 21:19:55
AC	邬文博 (wwb)	7ms	432 KiB		100 Bytes	2023-5-15 20:33:13
AC	朱泽晟	7ms	392 KiB		109 Bytes	2022-2-8 17:01:11
AC	江政含	7ms	6.9 MiB		127 Bytes	2023-7-5 19:22:24
AC	金沙校区 - 刘昱辰 (liuyuchen002)	7ms	7.2 MiB	C++98	107 Bytes	2024-5-12 10:14:09
AC	徐梓尧 (xuziyao001)	7ms	440 KiB		103 Bytes	2022-8-25 17:47:32
AC	xflt_dyp	7ms	6.9 MiB		165 Bytes	2023-7-22 15:20:35
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)	7ms	440 KiB		111 Bytes	2023-4-26 18:26:12
AC	yanglang	7ms	436 KiB		109 Bytes	2022-10-16 11:57:45
AC	彭崇鑫	7ms	392 KiB		101 Bytes	2022-10-15 15:01:32
AC	金沙校区-先珂熠 (九转大肠)	7ms	7.1 MiB		105 Bytes	2023-12-31 15:04:22
AC	杨瀚霖 (yanghanlin)	7ms	440 KiB		110 Bytes	2022-11-26 10:09:25
AC	zvt_132 (任子轩)	7ms	6.7 MiB		114 Bytes	2023-9-2 0:17:29
AC	罗伟杰 (13308275065)	7ms	420 KiB		109 Bytes	2022-7-16 11:45:36
AC	许嘉恩 (xje22031)	7ms	440 KiB		116 Bytes	2022-10-18 21:24:54
AC	唐梓竣	7ms	460 KiB		489 Bytes	2023-4-15 20:18:43
AC	源著校区-宋昊成 (马冬梅)	7ms	428 KiB		117 Bytes	2023-2-25 17:00:18
AC	冉浩然	7ms	6.9 MiB		104 Bytes	2023-10-15 18:06:51
AC	嘉宝 (王淳恺)	7ms	6.8 MiB		112 Bytes	2023-10-25 21:49:16
AC	爱琴海校区-王宥喆 (王宥喆)	7ms	6.9 MiB		123 Bytes	2023-7-5 19:15:07
AC	我是周靖松长得帅 (mouyunqi)	7ms	392 KiB		109 Bytes	2023-5-27 13:40:47
AC	李金泽 (aaaaaaa)	7ms	440 KiB		109 Bytes	2022-7-9 15:11:25
AC	xzf	7ms	6.9 MiB		136 Bytes	2023-6-10 11:17:52
AC	老六（王牌）	7ms	440 KiB		107 Bytes	2023-3-19 15:38:26
AC	除了我全部人都是SB (车涌樯)	7ms	6.9 MiB		104 Bytes	2023-7-18 15:42:33
AC	江科毅 (jky)	7ms	6.8 MiB		129 Bytes	2023-6-7 20:02:20
AC	86想要钱 (twt)	8ms	420 KiB		110 Bytes	2022-10-16 11:03:24
AC	陈玺宇	8ms	6.7 MiB		123 Bytes	2023-9-7 20:50:37
AC	新壹街-王俊博 (王俊博)	8ms	7.1 MiB		97 Bytes	2023-7-9 9:33:51
AC	靳博然 (jbr)	8ms	436 KiB		138 Bytes	2023-4-9 17:52:02
AC	dhy	8ms	6.8 MiB	C++98(O2)	25.3 KiB	2024-8-9 14:17:58
AC	伍芷函	8ms	420 KiB		115 Bytes	2022-9-5 17:25:31
AC	杨颂恩 (yangsongen)	8ms	6.8 MiB		108 Bytes	2023-7-18 21:23:35
AC	1+1=2 (曹瀚文)	8ms	6.9 MiB		151 Bytes	2023-7-5 19:21:31
AC	蒋丁非凡	8ms	436 KiB		105 Bytes	2023-5-11 18:10:13
AC	yuchenyi23017	8ms	6.7 MiB		144 Bytes	2023-9-2 19:54:10
AC	昌文迪 (05c05-cwd2)	8ms	436 KiB		87 Bytes	2022-7-18 20:07:06
AC	Error404sans (焦阳浩云)	8ms	6.9 MiB		110 Bytes	2023-6-30 21:09:51
AC	( ) (李恺伦)	8ms	6.9 MiB	C++11	109 Bytes	2024-8-23 15:37:24
AC	程曦漫	8ms	6.7 MiB		110 Bytes	2023-9-19 19:14:13
AC	fzx	8ms	512 KiB		119 Bytes	2022-10-24 15:25:00
AC	刘昊臻 (liuhaozhen)	8ms	444 KiB		110 Bytes	2023-2-21 20:10:20
AC	许炜铭 (xuweiming)	8ms	444 KiB		106 Bytes	2023-3-19 15:45:26
AC	WSY	8ms	7.2 MiB		135 Bytes	2023-11-26 15:42:21
AC	张家豪 (zhangjiahao)	8ms	6.9 MiB		101 Bytes	2023-7-1 20:31:11
AC	scallway	8ms	420 KiB		109 Bytes	2023-1-1 11:10:07
AC	龙思颖 (lsy)	8ms	440 KiB		114 Bytes	2023-3-13 19:18:38
AC	wuqilin	8ms	6.9 MiB		109 Bytes	2023-6-29 12:04:20
AC	希蒙 (zhengxingya)	8ms	6.9 MiB		110 Bytes	2023-7-20 13:36:28
AC	毕源博	8ms	6.8 MiB		112 Bytes	2023-6-28 12:50:00
AC	wuzhenghan	8ms	384 KiB		109 Bytes	2022-9-24 18:42:38
AC	allvin	8ms	7.2 MiB		109 Bytes	2023-12-1 20:11:02
AC	南坪-叶梓曦 (yezixi)	8ms	6.7 MiB		264 Bytes	2023-9-2 14:23:26
AC	dengduxi	8ms	416 KiB		109 Bytes	2022-11-27 11:32:31
AC	梦之泪伤	8ms	6.7 MiB		117 Bytes	2023-6-8 16:44:01
AC	司雨来 (siyulai)	8ms	432 KiB		117 Bytes	2022-10-6 16:28:36
AC	缥 (王硕2012)	8ms	384 KiB		124 Bytes	2022-10-4 14:41:48
AC	刘鹤枫 (liuhefeng)	8ms	436 KiB		111 Bytes	2022-8-7 13:03:32
AC	时代二校-陈天成 (鸭缩毛巾)	8ms	408 KiB		124 Bytes	2023-4-1 16:07:44
AC	阮 (媚狐不吃道旁李)	8ms	424 KiB		102 Bytes	2023-3-26 13:36:33
AC	liuyuanxi23017	8ms	6.7 MiB		122 Bytes	2023-9-2 19:59:52
AC	甄一阳 (22016-zyy)	8ms	432 KiB		107 Bytes	2022-10-30 11:11:53
AC	王强 (wangqiangge)	8ms	7.2 MiB		112 Bytes	2023-7-10 19:29:06
AC	熊海阳 (xiongxaiyang)	8ms	7.1 MiB		106 Bytes	2023-7-9 9:35:19
AC	李彦臻	8ms	444 KiB		103 Bytes	2022-11-28 9:39:55
AC	陈红恺 (chk)	8ms	384 KiB		109 Bytes	2022-8-21 17:36:29
AC	罗宇凡 (吴彦祖)	8ms	388 KiB		117 Bytes	2022-1-19 11:02:30
AC	奇怪的正义人！ (leweiqi)	8ms	444 KiB		127 Bytes	2022-10-28 21:25:08
AC	UsMt1 (jiangyuan)	8ms	6.9 MiB		87 Bytes	2023-7-27 9:38:43
AC	yixingyou	8ms	384 KiB		102 Bytes	2022-10-27 16:43:39
AC	刘洋	8ms	6.7 MiB		109 Bytes	2023-8-28 12:31:28
AC	南坪校区-淡昌盛 (Dancs)	8ms	6.8 MiB		99 Bytes	2023-10-26 19:10:43
AC	颜梓宇	8ms	6.8 MiB		101 Bytes	2023-6-22 16:51:43
AC	叶令子	8ms	6.9 MiB		97 Bytes	2023-8-17 16:33:12
AC	K517	8ms	6.9 MiB		110 Bytes	2023-12-2 20:17:42
AC	周浩楠 (开朗的周好难)	8ms	6.9 MiB		114 Bytes	2023-7-27 22:28:16
AC	周米骐 (zsb)	8ms	6.8 MiB		100 Bytes	2023-7-19 9:15:09
AC	colin1112 (墙凌可)	8ms	436 KiB		116 Bytes	2023-1-22 12:21:36
AC	葛琮扬	8ms	7 MiB		123 Bytes	2023-7-20 12:14:06
AC	zhangheyi22006	8ms	436 KiB		106 Bytes	2022-11-6 18:44:01
AC	三差学生(尘埃蓝莓) (白佳睿)	8ms	7 MiB		109 Bytes	2023-7-7 20:01:59
AC	王彬羽 (wby)	8ms	7 MiB		115 Bytes	2023-6-24 11:27:45
AC	南坪校区-龙浩睿 (longhaorui)	8ms	7 MiB		105 Bytes	2023-12-31 15:16:19