优美数

状态	递交者	时间	内存	语言	代码	递交时间
AC	xzf	39ms	6.9 MiB		175 Bytes	2023-7-1 20:55:39
AC	杨颂恩 (yangsongen)	39ms	6.8 MiB		155 Bytes	2023-11-8 18:12:36
AC	yanxiaosong	39ms	512 KiB		174 Bytes	2022-11-5 13:55:36
AC	余彦瑞	39ms	512 KiB		189 Bytes	2022-8-29 16:15:38
AC	希蒙 (zhengxingya)	39ms	6.9 MiB		270 Bytes	2023-8-14 14:46:10
AC	陈泰羽 (chentaiyu)	39ms	436 KiB		182 Bytes	2023-3-13 19:48:16
AC	郑尧 (zhengyao)	39ms	440 KiB		172 Bytes	2022-10-15 17:51:25
AC	繁星 (05c35-zzm)	39ms	512 KiB		181 Bytes	2022-11-26 9:27:25
AC	Stephen Stevenson	39ms	384 KiB		129 Bytes	2023-1-15 17:41:11
AC	李歆颜 (llxy)	39ms	6.9 MiB		152 Bytes	2023-8-4 19:33:21
AC	杨在云 (yangzaiyun001)	39ms	512 KiB		145 Bytes	2022-8-27 15:36:54
AC	xflt_dyp	39ms	6.9 MiB		159 Bytes	2023-7-22 16:14:26
AC	刘昱廷	39ms	6.7 MiB		158 Bytes	2023-9-19 19:50:59
AC	hangge	39ms	512 KiB		188 Bytes	2023-5-30 19:10:38
AC	soha (武夷岩)	39ms	448 KiB		151 Bytes	2022-9-10 16:50:15
AC	22029-lyh	39ms	384 KiB		176 Bytes	2022-12-3 9:43:33
AC	pandap&a王皓宸 (WANGHAOCHEN)	40ms	512 KiB		170 Bytes	2022-12-2 21:13:08
AC	dengduxi	40ms	520 KiB		150 Bytes	2022-11-27 13:22: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)	40ms	440 KiB		191 Bytes	2022-10-16 16:45:26
AC	朱老师 (zyp)	40ms	512 KiB		147 Bytes	2022-7-28 10:19:36
AC	Nico	40ms	512 KiB		157 Bytes	2022-12-24 13:46:46
AC	scallway	40ms	384 KiB		171 Bytes	2023-1-13 11:31:23
AC	zyp (wangjunling23010)	40ms	512 KiB		194 Bytes	2023-3-24 20:24:11
AC	啊...这 (炼狱杏寿郎)	40ms	512 KiB		183 Bytes	2022-9-10 16:34:03
AC	我全家SB！！！我没母！！！ (baijinlin)	40ms	512 KiB		157 Bytes	2023-3-18 17:52:47
AC	司雨来 (siyulai)	40ms	512 KiB		179 Bytes	2022-10-6 16:38:38
AC	xzf	40ms	7 MiB		175 Bytes	2023-7-1 20:54:29
AC	新壹街——陈学彬 (BUG)	40ms	6.9 MiB		151 Bytes	2023-6-29 17:57:25
AC	江坤锜	40ms	512 KiB		193 Bytes	2023-3-8 19:48:51
AC	yanglang	40ms	512 KiB		151 Bytes	2022-10-21 16:19:49
AC	罗翌珂 (dangdang)	40ms	440 KiB		152 Bytes	2022-8-27 19:08:53
AC	Randy Marsh (杨子腾)	40ms	448 KiB		177 Bytes	2022-9-28 19:10:13
AC	三差学生(尘埃蓝莓) (白佳睿)	40ms	6.9 MiB		171 Bytes	2023-7-7 20:11:08
AC	UsMt1 (jiangyuan)	40ms	6.7 MiB		156 Bytes	2023-9-17 10:57:48
AC	曹埊睿 (caodirui)	40ms	512 KiB		163 Bytes	2023-4-17 19:13:56
AC	何星震 (Jacob)	40ms	444 KiB		154 Bytes	2022-10-9 20:23:27
AC	yxj	40ms	512 KiB		159 Bytes	2022-10-20 15:23:12
AC	yangbinyu	40ms	512 KiB		181 Bytes	2022-10-2 12:11:53
AC	Him神	41ms	7.1 MiB		150 Bytes	2023-11-14 19:53:27
AC	代尚函笛卡尔 (daishanghan)	41ms	384 KiB		159 Bytes	2022-8-26 15:19:59
AC	金天翊	41ms	7.3 MiB		155 Bytes	2024-1-22 15:57:54
AC	伍芷函	41ms	512 KiB		192 Bytes	2022-8-24 12:37:10
AC	新一街校区Jason_LuoYouZheng (罗友峥)	41ms	512 KiB		252 Bytes	2023-3-15 20:44:13
AC	lafuzbc	41ms	384 KiB		168 Bytes	2022-8-20 17:46:36
AC	sb (吴振宇)	42ms	512 KiB		198 Bytes	2023-1-6 21:45:08
AC	缥 (王硕2012)	42ms	436 KiB		263 Bytes	2022-10-16 10:48:01
AC	colin1112 (墙凌可)	42ms	424 KiB		198 Bytes	2023-1-22 12:29:27
AC	liangyuntian23003	42ms	512 KiB		225 Bytes	2023-3-23 18:47:37
AC	秦兴润	42ms	6.8 MiB		186 Bytes	2023-6-8 19:14:15
AC	时代1校-杨宇轩 (杨宇轩)	42ms	7.9 MiB		155 Bytes	2023-8-21 13:01:08
AC	金沙校区-蓝祥与 (蓝祥与)	42ms	512 KiB		169 Bytes	2022-11-30 21:21:47
AC	wuzhenghan	42ms	512 KiB		177 Bytes	2023-2-3 14:11:54
AC	时代1校-杨宇轩 (杨宇轩)	42ms	8.2 MiB		155 Bytes	2023-8-21 13:00:54
AC	金沙校区-先珂熠 (九转大肠)	42ms	7.1 MiB		154 Bytes	2024-1-1 19:27:05
AC	马渝杭 (mayuhang)	42ms	436 KiB		156 Bytes	2023-1-14 12:04:23
AC	sunsihan	42ms	6.7 MiB		149 Bytes	2023-8-23 15:14:50
AC	这是非常▦▦▦的 (段秉辰)	43ms	7.3 MiB		171 Bytes	2024-1-22 15:53:19
AC	马渝杭 (mayuhang)	43ms	512 KiB		156 Bytes	2023-3-21 19:01:07
AC	raozheng	43ms	432 KiB		220 Bytes	2023-1-18 10:29:40
AC	周琪渃	43ms	512 KiB		156 Bytes	2022-12-9 19:45:36
AC	杜启苇 (duqiwei)	43ms	7 MiB		209 Bytes	2023-6-17 15:37:12
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	43ms	444 KiB		153 Bytes	2023-1-13 15:46:46
AC	11451254188 (22029-mjh)	44ms	408 KiB		173 Bytes	2022-12-3 9:45:05
AC	黄彦熹 (AK-203)	44ms	6.9 MiB		169 Bytes	2023-7-17 18:43:58
AC	shenyushun2	44ms	512 KiB		156 Bytes	2022-12-2 17:47:20
AC	SHY20091224	44ms	384 KiB		146 Bytes	2022-8-25 15:40:20
AC	陈诺	45ms	7 MiB		151 Bytes	2023-12-19 16:48:53
AC	付博plus	45ms	444 KiB		187 Bytes	2022-8-26 11:31:47
AC	蒋晟睿	45ms	7.1 MiB		161 Bytes	2023-12-17 20:59:14
AC	22029-zjs	45ms	440 KiB		179 Bytes	2022-12-3 9:42:42
AC	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	45ms	7 MiB		139 Bytes	2023-12-17 16:41:43
AC	amr (董子溪)	46ms	7 MiB		156 Bytes	2023-12-24 15:49:53
AC	新壹街校区--税崇峻 (税崇峻)	46ms	6.9 MiB		146 Bytes	2023-7-28 20:26:03
AC	RanHao	47ms	7.2 MiB		161 Bytes	2023-7-20 17:17:01
AC	丛林 (conglin)	50ms	512 KiB		183 Bytes	2022-12-2 17:17:45
AC	杜雨泽	52ms	7.3 MiB		173 Bytes	2024-1-22 16:09:06
AC	梁程翔	53ms	7.3 MiB		191 Bytes	2024-1-22 16:00:55
AC	0724	53ms	7.2 MiB		175 Bytes	2023-12-17 16:15:22
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	54ms	7.1 MiB		219 Bytes	2023-12-9 12:11:07
AC	葛琮扬	54ms	6.9 MiB		152 Bytes	2023-7-20 12:54:16
AC	K517	54ms	7.2 MiB		177 Bytes	2023-12-17 16:11:06
AC	没有此人 (akm)	55ms	7 MiB		143 Bytes	2023-11-30 20:46:18
AC	付博plus	56ms	444 KiB		187 Bytes	2022-8-26 14:17:51
AC	OJ00001 (陈帅)	59ms	7.3 MiB		170 Bytes	2024-1-22 15:47:18
AC	陈雨泽1	59ms	6.8 MiB		180 Bytes	2023-11-23 22:26:28
AC	暗蛆突围 (lzh)	63ms	7.1 MiB		193 Bytes	2023-11-27 15:29:34
AC	zhy123	159ms	764 KiB	C++11(O2)	150 Bytes	2024-11-23 14:02:38
AC	盛稚涵 (shengzhihan)	159ms	548 KiB	C++11	171 Bytes	2024-11-24 16:30:39
AC	查大禹	161ms	764 KiB	C++98(O2)	157 Bytes	2024-11-22 21:19:30
AC	宋坤霖	161ms	540 KiB		160 Bytes	2024-3-1 19:19:53
AC	曹雅萱	164ms	764 KiB	C++11	191 Bytes	2024-9-2 18:54:50
AC	wangzihang3	164ms	764 KiB		213 Bytes	2024-3-29 20:26:20
AC	安一谦	164ms	764 KiB		152 Bytes	2024-2-26 20:02:38
AC	邱越	164ms	548 KiB		179 Bytes	2024-2-7 10:48:44
AC	孔崇安	165ms	764 KiB	C++11(O2)	134 Bytes	2024-11-6 19:56:53
AC	新壹街罗田雨 (罗田雨29)	165ms	768 KiB		161 Bytes	2024-3-30 13:16:42
AC	新壹街—熊轩杭 (xiongxuanhang)	166ms	764 KiB		181 Bytes	2024-3-16 18:35:52
AC	Noah (mwx)	166ms	764 KiB		1.3 KiB	2024-3-17 16:36:34
AC	张睎宇	166ms	536 KiB		167 Bytes	2024-1-26 11:21:40
AC	綰綰(HHYT)	166ms	764 KiB		154 Bytes	2024-4-9 21:11:12