简单的输入1

状态	递交者	时间	内存	语言	代码	递交时间
AC	何昊宇 (22016-hhy)	8ms	6.9 MiB		115 Bytes	2023-7-29 21:31:52
AC	除了我全部人都是SB (车涌樯)	8ms	6.9 MiB		98 Bytes	2023-7-18 11:22:27
AC	弹射起飞 ? 冲 ! (吴周周)	8ms	436 KiB		104 Bytes	2023-4-17 18:02:08
AC	sunsihan	8ms	6.9 MiB		91 Bytes	2023-8-13 13:19:19
AC	刘鹤枫 (liuhefeng)	8ms	512 KiB		108 Bytes	2022-8-7 13:02:47
AC	查大禹	8ms	6.9 MiB	C++98(O2)	120 Bytes	2024-6-14 21:02:21
AC	叶雨昊 (yeyuhao22006)	8ms	440 KiB		98 Bytes	2023-2-15 18:54:29
AC	李旻轩	8ms	428 KiB		134 Bytes	2023-3-2 19:08:17
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)	8ms	444 KiB		111 Bytes	2023-4-26 18:23:05
AC	我是周靖松长得帅 (mouyunqi)	8ms	400 KiB		103 Bytes	2023-5-27 13:40:18
AC	wangzihan	8ms	440 KiB		106 Bytes	2022-10-30 14:30:03
AC	高国瑞	8ms	6.9 MiB		106 Bytes	2023-8-8 19:40:26
AC	谢靳骁 (XJX)	8ms	432 KiB		100 Bytes	2023-3-19 18:30:33
AC	李晨希	8ms	432 KiB		95 Bytes	2023-3-21 16:53:59
AC	科比.布莱恩特 (董浩琰)	8ms	6.9 MiB		511 Bytes	2023-7-20 16:05:46
AC	ycy	8ms	444 KiB		104 Bytes	2023-2-23 19:56:43
AC	曾维思	8ms	7 MiB		124 Bytes	2023-12-16 19:28:42
AC	郑qr	8ms	7 MiB	C++11	104 Bytes	2024-6-2 15:20:52
AC	AAA? Prow max (hechenxuan23005)	8ms	6.9 MiB		113 Bytes	2023-11-23 16:53:02
AC	yuchenyi23017	8ms	6.7 MiB		125 Bytes	2023-9-2 19:28:14
AC	fzx	8ms	440 KiB		111 Bytes	2022-10-24 15:24:24
AC	xzf	8ms	6.9 MiB		131 Bytes	2023-6-10 11:14:11
AC	新壹街校区-杨轩懿 (杨轩懿1)	8ms	6.9 MiB		98 Bytes	2023-7-16 10:23:59
AC	杨在云 (yangzaiyun001)	8ms	512 KiB		91 Bytes	2022-8-23 16:17:20
AC	龚信丞	8ms	7.3 MiB		107 Bytes	2023-7-6 11:32:06
AC	lao_ba	8ms	6.7 MiB		105 Bytes	2023-9-29 16:32:26
AC	奇怪的正义人！ (leweiqi)	8ms	528 KiB		127 Bytes	2022-10-28 21:24:45
AC	老六（王牌） (mhc)	8ms	436 KiB		111 Bytes	2023-3-23 20:00:26
AC	黄梓桐 (HuangZiTong)	8ms	440 KiB		96 Bytes	2022-9-23 20:55:41
AC	高彬月	8ms	7 MiB		99 Bytes	2023-12-10 22:18:53
AC	Error404sans (焦阳浩云)	8ms	6.9 MiB		104 Bytes	2023-6-30 21:09:09
AC	zzy	8ms	432 KiB		109 Bytes	2023-3-11 16:00:48
AC	胡程禹	8ms	384 KiB		103 Bytes	2023-2-18 20:20:54
AC	wangziji	8ms	432 KiB		91 Bytes	2023-3-11 9:10:51
AC	sb (吴振宇)	8ms	432 KiB		103 Bytes	2022-12-21 14:00:52
AC	pandap&a王皓宸 (WANGHAOCHEN)	8ms	436 KiB		105 Bytes	2022-11-12 10:09:34
AC	何昊宇 (22016-hhy)	8ms	6.9 MiB		115 Bytes	2023-7-29 21:31:44
AC	laiyouming22031	8ms	436 KiB		118 Bytes	2022-12-25 13:48:04
AC	罗竣瀚	8ms	428 KiB		89 Bytes	2022-10-15 19:20:51
AC	王胤钦 (wangyinqin)	8ms	440 KiB		98 Bytes	2022-8-29 17:54:13
AC	徐梓尧 (xuziyao001)	8ms	444 KiB		97 Bytes	2022-8-25 17:47:04
AC	罗元邑2	8ms	6.8 MiB		101 Bytes	2023-6-30 16:11:02
AC	86想要钱 (twt)	8ms	440 KiB		104 Bytes	2022-10-16 11:00:56
AC	wanghuaiying	8ms	6.7 MiB		104 Bytes	2023-9-16 9:47:25
AC	綰綰(HHYT)	8ms	7.4 MiB		95 Bytes	2024-1-20 20:24:38
AC	何昊宇 (22016-hhy)	8ms	6.9 MiB		115 Bytes	2023-7-29 19:47:25
AC	摩拉克斯	8ms	7.2 MiB		98 Bytes	2023-7-7 17:04:16
AC	zhongjunxuan	8ms	7 MiB		106 Bytes	2023-12-29 21:42:09
AC	huanglu	8ms	6.9 MiB		107 Bytes	2023-7-15 11:37:22
AC	梦之泪伤	8ms	6.7 MiB		109 Bytes	2023-6-8 16:41:04
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	8ms	436 KiB		115 Bytes	2023-1-10 16:36:03
AC	Accepted (周芷乐)	8ms	7.2 MiB		112 Bytes	2023-11-25 11:23:12
AC	李清城 (朱瀚文集训号)	8ms	444 KiB		94 Bytes	2023-3-9 16:25:14
AC	我很6 (zjj22031)	8ms	440 KiB		113 Bytes	2023-1-10 11:22:32
AC	wangmulai	8ms	6.9 MiB		111 Bytes	2023-8-2 10:08:50
AC	陈诺	8ms	7.3 MiB		96 Bytes	2023-12-16 16:57:56
AC	周米骐 (zsb)	8ms	6.8 MiB		94 Bytes	2023-7-19 9:14:39
AC	朱彦搏	8ms	440 KiB		91 Bytes	2022-11-10 8:54:23
AC	K517	8ms	7 MiB		106 Bytes	2023-12-2 20:13:51
AC	杨馨涵	8ms	6.8 MiB		94 Bytes	2023-12-14 18:27:47
AC	希蒙 (zhengxingya)	8ms	6.9 MiB		104 Bytes	2023-7-20 13:34:55
AC	金沙校区-李嘉齐 (李嘉齐)	8ms	6.7 MiB		114 Bytes	2023-8-21 17:56:04
AC	六 (江智昕)	8ms	440 KiB		89 Bytes	2022-12-1 16:07:30
AC	赵志陶 (zztzzt)	8ms	436 KiB		98 Bytes	2022-11-6 9:43:33
AC	曹埊睿 (caodirui)	8ms	512 KiB		103 Bytes	2023-4-16 10:38:48
AC	煞笔笔	8ms	256 KiB		116 Bytes	2023-5-12 19:34:50
AC	miku (阳沐珊)	8ms	6.4 MiB		106 Bytes	2023-6-3 17:55:22
AC	毕源博	8ms	6.8 MiB		106 Bytes	2023-6-28 12:48:53
AC	何定谦 (hdq)	8ms	7.1 MiB		101 Bytes	2023-7-6 11:01:27
AC	AI创客	8ms	6.5 MiB		98 Bytes	2023-11-16 21:25:35
AC	小操哥	8ms	436 KiB		97 Bytes	2023-5-29 19:39:37
AC	56 (13883454928)	8ms	440 KiB		103 Bytes	2023-3-16 23:06:18
AC	江科毅 (jky)	8ms	6.8 MiB		123 Bytes	2023-6-7 20:02:00
AC	王强 (wangqiangge)	8ms	7.2 MiB		107 Bytes	2023-7-10 19:27:55
AC	三差学生(尘埃蓝莓) (白佳睿)	8ms	6.9 MiB		107 Bytes	2023-7-7 19:32:20
AC	叶雨昊 (yeyuhao22006)	8ms	512 KiB		98 Bytes	2023-1-7 17:55:05
AC	UsMt1 (jiangyuan)	8ms	6.9 MiB		144 Bytes	2023-7-21 21:38:25
AC	zzzhhhooonnnggg	8ms	556 KiB		112 Bytes	2023-3-19 18:24:21
AC	我是个s* (lijinze)	8ms	420 KiB		100 Bytes	2023-3-6 21:42:26
AC	三差学生 (尘埃蓝莓)	8ms	7.2 MiB		91 Bytes	2023-7-7 14:45:46
AC	毕浩宇 (bihaoyu)	8ms	7 MiB		107 Bytes	2023-7-14 16:29:42
AC	孙烽轶 (sfy)	8ms	6.9 MiB		95 Bytes	2023-8-7 12:58:19
AC	RanHao	8ms	7 MiB		116 Bytes	2023-7-20 15:53:58
AC	协信校区-田煜帆 (tianyufan23010)	9ms	6.9 MiB		108 Bytes	2023-6-16 20:50:32
AC	彭子彦	9ms	6.9 MiB		121 Bytes	2023-12-2 14:12:13
AC	U城校区-董思羽 (董思羽)	9ms	6.9 MiB		105 Bytes	2023-7-28 19:35:40
AC	熊海阳 (xiongxaiyang)	9ms	7.1 MiB		99 Bytes	2023-7-7 9:20:00
AC	Nico	9ms	416 KiB		103 Bytes	2022-12-23 16:44:53
AC	曲奇饼干	9ms	392 KiB		110 Bytes	2022-12-18 10:21:24
AC	葛琮扬	9ms	6.9 MiB		137 Bytes	2023-7-19 20:59:15
AC	时代一校蒋帛希 (13983392730)	9ms	436 KiB		98 Bytes	2022-9-15 21:09:15
AC	陈于硕(我™的) (chenyu)	9ms	7.4 MiB		118 Bytes	2023-7-7 10:44:00
AC	杨淇瑞 (杨淇瑞29)	9ms	512 KiB		104 Bytes	2022-12-25 14:42:10
AC	13594655719	9ms	8.3 MiB		94 Bytes	2023-7-14 10:01:43
AC	wuqilin	10ms	6.9 MiB		103 Bytes	2023-6-29 12:03:50
AC	tyx_9192596	10ms	420 KiB		93 Bytes	2023-3-16 7:39:35
AC	OJ00001 (陈帅)	10ms	7 MiB		136 Bytes	2024-1-19 14:33:13
AC	zhs23017	10ms	7.2 MiB		96 Bytes	2023-12-9 10:49:10
AC	许嘉恩 (xje22031)	11ms	384 KiB		110 Bytes	2022-10-18 21:17:37
AC	陌生人 (涂玉龙)	11ms	7 MiB		97 Bytes	2023-12-3 15:40:58