简单的输入3

状态	递交者	时间	内存	语言	代码	递交时间
AC	偽艺術家 (chenyanchi22006)	6ms	384 KiB		121 Bytes	2022-3-20 18:58:13
AC	时代一校黄誉翔 (huang)	6ms	384 KiB		138 Bytes	2022-6-30 20:38:01
AC	周琪渃	6ms	388 KiB		116 Bytes	2022-9-24 18:51:12
AC	余彦瑞	6ms	384 KiB		131 Bytes	2022-4-8 18:43:20
AC	chenjunyao	6ms	440 KiB		144 Bytes	2023-4-22 9:15:06
AC	陈家齐 (陈家齐1)	6ms	384 KiB		128 Bytes	2023-2-18 20:23:01
AC	hyh	6ms	7 MiB	C++98	109 Bytes	2024-6-15 11:27:47
AC	金天翊	6ms	7 MiB		123 Bytes	2024-1-19 15:10:25
AC	谢语泽他爹 (qiujunxiang)	6ms	512 KiB		133 Bytes	2022-4-23 19:27:52
AC	无尽的想象 (谭仕高)	6ms	384 KiB		138 Bytes	2022-7-12 15:20:00
AC	yanxiaosong	6ms	384 KiB		139 Bytes	2022-4-30 15:02:34
AC	22029-lsl	6ms	520 KiB		124 Bytes	2022-12-2 18:40:18
AC	(张洛诚)	6ms	384 KiB		159 Bytes	2023-4-3 20:19:28
AC	明哲瀚 (18580067605)	6ms	384 KiB		116 Bytes	2022-9-24 18:41:31
AC	时代一校-王宥量 (wangyouliang)	6ms	440 KiB		131 Bytes	2022-9-12 15:43:30
AC	JSH	6ms	6.5 MiB	C++98(O2)	116 Bytes	2024-8-1 14:25:05
AC	魑归sama	6ms	384 KiB		130 Bytes	2022-7-12 16:00:00
AC	三藏的痔疮 (不会玩是原罪)	6ms	388 KiB		118 Bytes	2022-1-20 15:10:11
AC	朱彦搏	6ms	440 KiB		122 Bytes	2023-4-9 13:05:36
AC	enen	6ms	440 KiB		150 Bytes	2023-4-21 18:12:59
AC	miku (阳沐珊)	6ms	388 KiB		177 Bytes	2022-5-25 19:24:00
AC	陈秋石	6ms	384 KiB		116 Bytes	2022-6-4 14:19:38
AC	明轩 (吕同学)	6ms	392 KiB		135 Bytes	2022-8-27 12:55:54
AC	呵 (mohaoran)	6ms	384 KiB		113 Bytes	2022-6-17 22:17:06
AC	唐梓竣	6ms	440 KiB		500 Bytes	2023-4-15 20:19:44
AC	lch (凌昌瀚)	6ms	412 KiB		124 Bytes	2022-4-23 9:26:41
AC	赵彬鸿	6ms	384 KiB		128 Bytes	2022-4-30 15:03:38
AC	panyan	6ms	392 KiB		131 Bytes	2022-4-30 14:57:28
AC	林小博	6ms	384 KiB		177 Bytes	2022-3-19 11:08:52
AC	强愉堃 (强愉堃1)	6ms	384 KiB		110 Bytes	2023-2-18 20:22:59
AC	王宇桐 (我是外挂)	6ms	384 KiB		182 Bytes	2022-1-23 17:15:57
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)	6ms	444 KiB		119 Bytes	2023-4-29 12:02:13
AC	凌肯 (lingken22006)	6ms	392 KiB		122 Bytes	2022-6-5 16:22:01
AC	德意志第三帝国 (陈远桥)	6ms	384 KiB		133 Bytes	2022-4-17 9:52:38
AC	cainuoyan	6ms	6.7 MiB		120 Bytes	2023-9-2 15:21:24
AC	0721 (龙浩恩)	6ms	6.7 MiB	C++11	117 Bytes	2024-7-17 20:43:10
AC	宋金龙 (songjl0421)	6ms	384 KiB		125 Bytes	2022-1-1 15:40:09
AC	王若衡 (wangruoheng)	6ms	384 KiB		104 Bytes	2023-5-12 21:34:12
AC	Guest	6ms	6.8 MiB	C++98(O2)	137 Bytes	2024-7-2 0:32:06
AC	wangyueru	6ms	384 KiB		119 Bytes	2022-9-24 17:23:16
AC	luoluonuoya	6ms	392 KiB		164 Bytes	2022-1-23 17:17:01
AC	程子杰 (05c41-czj)	6ms	384 KiB		131 Bytes	2022-7-27 10:32:21
AC	赵鑫宸 (xiaoxiao721)	6ms	384 KiB		162 Bytes	2022-2-20 1:19:36
AC	hulang	6ms	384 KiB		138 Bytes	2022-5-8 17:04:57
AC	第五人格启动 (罗子键)	6ms	384 KiB		116 Bytes	2023-2-18 20:26:43
AC	1396013295	6ms	384 KiB		101 Bytes	2022-1-21 19:59:48
AC	kongql	6ms	7 MiB	C++11	122 Bytes	2024-5-11 14:18:40
AC	吴俊成 (wujuncheng)	6ms	392 KiB		147 Bytes	2022-7-8 22:56:53
AC	赵彬鸿	6ms	424 KiB		128 Bytes	2022-4-30 15:04:51
AC	胡程禹	6ms	512 KiB		121 Bytes	2023-2-18 20:24:25
AC	陈风亦 (chenfengyi)	6ms	384 KiB		139 Bytes	2022-4-30 15:00:15
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	6ms	384 KiB		146 Bytes	2022-1-23 17:33:39
AC	old_doctor	6ms	384 KiB		116 Bytes	2022-6-8 13:08:35
AC	liusihan	6ms	384 KiB		112 Bytes	2022-6-5 18:22:47
AC	黄歆恬 (teresac)	6ms	504 KiB		124 Bytes	2022-8-10 9:38:28
AC	程舒然	6ms	6.6 MiB	C++11	117 Bytes	2024-7-10 10:22:14
AC	NJL (NJlL)	6ms	384 KiB		229 Bytes	2022-4-10 17:05:12
AC	曹元明	6ms	384 KiB		127 Bytes	2022-7-25 12:51:46
AC	唐钰豪	6ms	384 KiB		133 Bytes	2022-4-17 9:51:45
AC	longhao	6ms	384 KiB		162 Bytes	2022-1-23 17:21:56
AC	德意志第三帝国 (陈远桥)	6ms	384 KiB		133 Bytes	2022-4-17 9:52:38
AC	蓝色妖姬 (jiangpeiyu)	6ms	384 KiB		136 Bytes	2022-3-13 19:57:29
AC	唐钰豪	6ms	384 KiB		133 Bytes	2022-4-17 9:51:46
AC	李禹衡 (liyuheng22006)	6ms	384 KiB		121 Bytes	2022-7-2 16:45:01
AC	liangyuntian23003	6ms	384 KiB		101 Bytes	2023-3-4 16:30:14
AC	陈杰晟	6ms	384 KiB		129 Bytes	2022-2-17 15:39:55
AC	李金泽 (aaaaaaa)	6ms	428 KiB		116 Bytes	2022-7-9 15:00:34
AC	何星震 (Jacob)	6ms	436 KiB		110 Bytes	2023-2-7 20:56:43
AC	李禹衡 (liyuheng22006)	6ms	384 KiB		121 Bytes	2022-7-2 16:45:00
AC	芒苒忧 (廖迦南)	6ms	400 KiB		138 Bytes	2022-1-25 14:38:54
AC	dafu	6ms	384 KiB		115 Bytes	2023-4-5 11:25:17
AC	朱老师 (zyp)	6ms	384 KiB		120 Bytes	2022-3-27 16:40:05
AC	甘梓琪	6ms	384 KiB		156 Bytes	2022-1-21 17:55:05
AC	郑岐蔚	6ms	392 KiB		115 Bytes	2022-9-24 18:44:32
AC	maomao	6ms	384 KiB		120 Bytes	2022-5-19 13:58:13
AC	zhouziqi	6ms	400 KiB	C++	132 Bytes	2022-4-16 21:31:41
AC	chenpeiling22006	6ms	392 KiB		119 Bytes	2022-3-27 16:43:14
AC	某某 (xuhaotian)	6ms	436 KiB		140 Bytes	2022-2-19 16:06:31
AC	田雨杨 (tianyuyang23010)	6ms	7.1 MiB	C++98	130 Bytes	2024-5-10 20:25:59
AC	杜是贤 (dushixian)	6ms	384 KiB		145 Bytes	2022-3-24 20:52:59
AC	德意志第三帝国 (陈远桥)	6ms	384 KiB		133 Bytes	2022-4-17 9:53:10
AC	德意志第三帝国 (陈远桥)	7ms	384 KiB		133 Bytes	2022-4-17 9:53:06
AC	任瑞的学生 (jiangyadong)	7ms	512 KiB		116 Bytes	2022-6-8 13:06:49
AC	南坪校区-郑力博 (zhenglibo23003)	7ms	440 KiB		108 Bytes	2023-3-4 16:27:11
AC	德意志第三帝国 (陈远桥)	7ms	384 KiB		133 Bytes	2022-4-17 9:53:10
AC	德意志第三帝国 (陈远桥)	7ms	384 KiB		133 Bytes	2022-4-17 9:53:05
AC	唐钰豪	7ms	432 KiB		133 Bytes	2022-4-17 9:52:37
AC	zhangyh (张育菡)	7ms	384 KiB		111 Bytes	2022-5-15 10:00:06
AC	德意志第三帝国 (陈远桥)	7ms	384 KiB		133 Bytes	2022-4-17 9:20:43
AC	王彬羽 (wby)	7ms	6.8 MiB	C++11	122 Bytes	2024-8-15 18:22:08
AC	唐钰豪	7ms	392 KiB		133 Bytes	2022-4-17 9:51:43
AC	傀儡师 (zhujingen)	7ms	6.9 MiB	C++11	117 Bytes	2024-6-20 17:34:22
AC	yanyuhan	7ms	392 KiB		141 Bytes	2023-3-5 14:53:52
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	7ms	384 KiB		138 Bytes	2022-7-9 8:55:10
AC	唐钰豪	7ms	384 KiB		133 Bytes	2022-4-17 9:51:44
AC	殷语函	7ms	7.2 MiB	C++11	133 Bytes	2024-4-23 21:42:10
AC	汤杰尧 (05c05-tjy1)	7ms	392 KiB		132 Bytes	2022-5-8 13:48:23
AC	雷诺伊尔 (崔金鹏)	7ms	6.6 MiB	C++98	116 Bytes	2024-7-25 14:07:26
AC	德意志第三帝国 (陈远桥)	7ms	396 KiB		133 Bytes	2022-4-17 9:53:14
AC	luosifu22006	7ms	424 KiB		121 Bytes	2022-6-12 10:17:51