身高排序

状态	递交者	时间	内存	语言	代码	递交时间
AC	李山水	26ms	384 KiB		250 Bytes	2022-6-11 9:48:09
AC	金沙校区-先珂熠 (九转大肠)	27ms	6.7 MiB	C++20(O2)	202 Bytes	2024-8-2 17:05:33
AC	zvt_132 (任子轩)	29ms	6.6 MiB	C++98	237 Bytes	2024-7-24 19:31:12
AC	雷诺伊尔 (崔金鹏)	29ms	6.8 MiB	C++98	276 Bytes	2024-8-9 20:05:05
AC	zhangyouze (张佑泽)	31ms	6.9 MiB	C++98	232 Bytes	2024-6-3 22:03:29
AC	NJL (NJlL)	32ms	452 KiB		225 Bytes	2022-5-8 16:23:44
AC	傅博涛	32ms	556 KiB		205 Bytes	2022-6-5 10:43:40
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)	32ms	7.1 MiB		296 Bytes	2023-11-12 11:28:06
AC	姚宏逸	32ms	384 KiB		685 Bytes	2022-5-4 19:44:58
AC	时代二校-陈天成 (鸭缩毛巾)	32ms	6.8 MiB		198 Bytes	2023-9-16 16:19:45
AC	1396013295	33ms	428 KiB		254 Bytes	2022-5-8 9:07:26
AC	冒牌陈杰晟【MOD】 (wed)	33ms	496 KiB		288 Bytes	2022-5-1 17:24:14
AC	新壹街朱启航 (zhuqihang)	33ms	7.2 MiB	C++98	954 Bytes	2024-5-1 8:16:01
AC	xuniaoyin (徐袅音)	33ms	6.7 MiB		229 Bytes	2023-8-30 10:49:56
AC	GYZ	33ms	448 KiB		302 Bytes	2022-5-25 19:46:33
AC	胡瀚文	34ms	512 KiB		206 Bytes	2022-7-19 20:39:10
AC	colin1112 (墙凌可)	34ms	524 KiB		266 Bytes	2023-3-19 16:11:51
AC	杜俊宏	34ms	580 KiB		232 Bytes	2022-7-6 21:11:06
AC	荣耀	34ms	6.7 MiB		207 Bytes	2023-8-30 12:39:41
AC	何昊宇 (22016-hhy)	34ms	6.9 MiB		218 Bytes	2023-6-29 10:12:51
AC	我推的乱破 (贺俊楠)	34ms	6.7 MiB		261 Bytes	2023-8-30 16:18:50
AC	CPL	35ms	560 KiB		587 Bytes	2023-3-8 18:18:45
AC	张瑞博	35ms	6.8 MiB	C++11	212 Bytes	2024-8-14 21:17:20
AC	疯神芭芭脱丝 (李卓修)	36ms	456 KiB		273 Bytes	2022-7-14 17:33:16
AC	李树崑 (lishukun)	36ms	472 KiB		345 Bytes	2022-8-5 15:23:05
AC	赵泳鑫 (zhaoyongxin)	36ms	512 KiB		292 Bytes	2022-7-15 14:37:11
AC	曹埊睿 (caodirui)	36ms	468 KiB		249 Bytes	2023-5-10 21:43:18
AC	没有此人 (akm)	38ms	6.7 MiB		309 Bytes	2023-9-16 13:32:42
AC	新壹街校区-张振灏 (张振灏)	46ms	7.3 MiB		274 Bytes	2024-1-21 14:42:23
AC	新壹街—熊轩杭 (xiongxuanhang)	50ms	7.1 MiB		274 Bytes	2024-1-13 18:07:48
AC	张雯皓 (zhangwenhao)	60ms	7.3 MiB		214 Bytes	2023-12-30 10:52:11
AC	zyl	61ms	7.3 MiB		247 Bytes	2024-1-5 14:54:22
AC	朱老师 (zyp)	104ms	788 KiB		217 Bytes	2024-2-1 16:45:53
AC	Billy52013 (李子轩)	104ms	576 KiB		807 Bytes	2024-3-20 20:04:26
AC	廖梓棋23025	109ms	764 KiB		221 Bytes	2024-2-1 16:48:20
AC	yanyuhan	111ms	572 KiB		231 Bytes	2024-3-16 11:04:34
AC	zhy123	111ms	584 KiB		198 Bytes	2024-2-1 16:45:26
AC	牟淳雅	113ms	768 KiB		653 Bytes	2024-3-31 10:02:05
AC	我推的乱破 (贺俊楠)	114ms	808 KiB		663 Bytes	2024-3-17 11:13:33
AC	新壹街校区-冉睦阳 (冉睦阳)	114ms	576 KiB		674 Bytes	2024-3-17 11:15:08
AC	拥抱幸福小熊(吴沛篪)	204ms	6.9 MiB	C++98	316 Bytes	2024-6-22 10:26:01
AC	弹射起飞 ? 冲 ! (吴周周)	235ms	6.8 MiB		438 Bytes	2023-9-16 16:25:21
AC	赵沛喆	269ms	5.1 MiB	Python 3	147 Bytes	2022-6-26 11:09:36
AC	龚信丞	291ms	436 KiB		359 Bytes	2023-5-13 19:47:54
AC	爱琴海校区-刁钲洋 (刁钲洋)	301ms	452 KiB		519 Bytes	2023-5-22 20:17:38
AC	cxk123 (tanzixuan)	301ms	448 KiB		353 Bytes	2023-5-13 19:50:30
AC	郑尧 (zhengyao)	329ms	500 KiB		345 Bytes	2023-5-13 19:41:08
AC	时代2校-程俊燃 (chengjunran)	389ms	6.8 MiB		381 Bytes	2023-9-16 16:27:39
AC	时代2校+涂彦迪 (tuyandi)	389ms	6.8 MiB		340 Bytes	2023-9-16 16:21:37
AC	时代二校-焦雨齐 (Angel)	390ms	6.8 MiB		362 Bytes	2023-9-16 16:17:04
AC	毕浩宇 (bihaoyu)	395ms	6.8 MiB		363 Bytes	2023-9-16 16:17:49
AC	王祎辰 (wangyichen)	395ms	428 KiB		321 Bytes	2023-5-13 19:48:57
AC	张景豪	396ms	452 KiB		391 Bytes	2023-5-13 19:43:02
AC	时代2校+施皓宬 (shihaocheng)	397ms	6.8 MiB		340 Bytes	2023-9-16 16:18:16
AC	huyinuo	398ms	480 KiB		421 Bytes	2022-5-19 22:00:45
AC	可爱的小花狗	398ms	6.8 MiB		416 Bytes	2023-9-16 16:24:34
AC	bilbil	399ms	6.8 MiB		420 Bytes	2023-9-16 16:26:05
AC	三差学生 (尘埃蓝莓)	399ms	448 KiB		327 Bytes	2023-5-13 19:46:32
AC	zhm123	400ms	512 KiB		342 Bytes	2023-5-6 16:02:34
AC	时代二校+王吕棪 (wanglvyan)	403ms	6.8 MiB		338 Bytes	2023-9-16 16:24:02
AC	周琪渃	404ms	468 KiB		375 Bytes	2023-4-8 17:29:46
AC	Randy Marsh (杨子腾)	619ms	512 KiB		367 Bytes	2023-1-7 14:11:24
AC	xiangsiyu	777ms	492 KiB		363 Bytes	2022-7-31 14:37:50
AC	新壹街校区-杨轩懿 (杨轩懿1)	812ms	6.7 MiB		296 Bytes	2023-8-30 11:26:09
AC	唐一航	814ms	788 KiB	C++11	350 Bytes	2024-9-10 14:17:12
AC	新壹街-桂梦文 (桂梦文)	906ms	7 MiB		358 Bytes	2024-1-24 10:12:47
AC	孙熠晨	914ms	7 MiB		353 Bytes	2024-1-24 10:13:07
AC	老六在此	987ms	780 KiB	C++20	528 Bytes	2024-9-10 14:09:21
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1143ms	552 KiB		363 Bytes	2022-10-13 18:20:39
AC	刘老师 (图书管理员)	1164ms	456 KiB		341 Bytes	2022-4-23 16:43:37
AC	刘老师 (图书管理员)	1456ms	6.7 MiB		322 Bytes	2023-6-8 16:56:48
AC	yuchenyi23017	2581ms	764 KiB		333 Bytes	2024-1-28 16:07:09