你的身材标准吗？

状态	递交者	时间	内存	语言	代码	递交时间
AC	在煎鱼的肖大总铳 (肖宇航)	7ms	7 MiB		240 Bytes	2023-9-24 10:48:36
AC	Billy52013 (李子轩)	7ms	6.8 MiB		232 Bytes	2023-10-6 14:24:38
AC	六 (江智昕)	7ms	392 KiB		247 Bytes	2022-12-30 19:26:40
AC	呵呵呵 (陈思琦)	7ms	384 KiB		206 Bytes	2022-7-2 17:36:59
AC	龙思颖 (lsy)	7ms	432 KiB		219 Bytes	2023-3-7 20:22:39
AC	邵冠铖 (shaoguancheng22031)	7ms	392 KiB		217 Bytes	2022-10-16 10:14:34
AC	六 (江智昕)	7ms	392 KiB		247 Bytes	2022-12-30 19:26:41
AC	bvvd	7ms	7 MiB	C++98	243 Bytes	2024-6-14 15:47:31
AC	郑尧 (zhengyao)	7ms	6.7 MiB		210 Bytes	2023-9-7 19:47:30
AC	zzzrrrxxx	7ms	6.9 MiB		242 Bytes	2023-7-18 19:18:53
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	384 KiB		266 Bytes	2022-10-2 19:34:01
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	7ms	392 KiB		241 Bytes	2022-10-16 10:12:04
AC	AC[谭赫奕] (tanheyi)	7ms	432 KiB		213 Bytes	2023-3-1 20:42:24
AC	赵启程 (赵启程1)	7ms	384 KiB		292 Bytes	2023-3-9 20:27:56
AC	杨淇瑞 (杨淇瑞29)	7ms	392 KiB		301 Bytes	2023-4-24 20:12:15
AC	赵彬鸿	7ms	384 KiB		200 Bytes	2022-8-12 15:56:09
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:39
AC	赵彬鸿	7ms	392 KiB		200 Bytes	2022-8-12 15:56:11
AC	新壹街校区-周士杰 (zsj)	7ms	436 KiB		223 Bytes	2022-3-4 19:36:15
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:41
AC	huanglinyi	7ms	384 KiB		233 Bytes	2023-2-11 17:33:44
AC	黄诗童 (hst01)	7ms	6.6 MiB		300 Bytes	2023-6-3 19:52:19
AC	yangbinyu	7ms	392 KiB		269 Bytes	2022-9-25 9:19:57
AC	xiangsiyu	7ms	436 KiB		273 Bytes	2022-6-23 19:33:54
AC	陈杰晟	7ms	440 KiB		280 Bytes	2022-2-18 13:32:08
AC	吃小孩的viv_	7ms	384 KiB		240 Bytes	2022-7-24 16:05:23
AC	chenrunxiang22031	7ms	428 KiB		291 Bytes	2022-10-16 10:13:28
AC	xflt_dyp	7ms	412 KiB		268 Bytes	2022-9-25 9:16:37
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	7ms	384 KiB		241 Bytes	2022-10-16 10:11:45
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:39
AC	六 (江智昕)	7ms	388 KiB		247 Bytes	2022-12-30 19:26:37
AC	爱琴海校区-刁钲洋 (刁钲洋)	7ms	512 KiB		297 Bytes	2023-1-29 22:12:24
AC	赵彬鸿	7ms	384 KiB		200 Bytes	2022-8-12 15:56:13
AC	曹埊睿 (caodirui)	7ms	384 KiB		239 Bytes	2023-4-16 10:33:38
AC	刘沄熙	7ms	448 KiB		279 Bytes	2022-3-6 10:59:56
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:42
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:37
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:40
AC	wangxingyue	7ms	384 KiB		209 Bytes	2023-3-26 17:08:57
AC	陈秋石	7ms	384 KiB		251 Bytes	2022-3-6 11:19:36
AC	Guest	7ms	6.8 MiB		252 Bytes	2023-11-26 17:57:08
AC	德克萨斯做的到吗 (liyangbao)	7ms	512 KiB		283 Bytes	2022-10-30 23:35:55
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:38
AC	暗蛆突围 (lzh)	7ms	6.8 MiB		310 Bytes	2023-10-29 0:12:08
AC	三差学生(尘埃蓝莓) (白佳睿)	7ms	384 KiB		262 Bytes	2023-2-7 21:08:28
AC	马渝杭 (mayuhang)	7ms	384 KiB		236 Bytes	2023-3-24 18:55:29
AC	赵彬鸿	7ms	384 KiB		200 Bytes	2022-8-12 15:56:19
AC	chenrunxiang22031	7ms	384 KiB		291 Bytes	2022-10-16 10:27:02
AC	jiangjc	7ms	6.9 MiB		210 Bytes	2023-6-18 15:59:26
AC	六 (江智昕)	7ms	512 KiB		247 Bytes	2022-12-30 19:26:39
AC	tyx_9192596	7ms	384 KiB		238 Bytes	2023-3-19 7:47:14
AC	BJ6180C8CTD (Fan)	7ms	6.7 MiB		266 Bytes	2023-9-16 13:51:46
AC	刘昊臻 (liuhaozhen)	7ms	512 KiB		230 Bytes	2023-2-21 20:19:18
AC	王彬羽 (wby)	7ms	7.2 MiB		291 Bytes	2023-6-24 11:21:39
AC	肖添宇	7ms	424 KiB		261 Bytes	2022-4-23 17:32:39
AC	我很6 (zjj22031)	7ms	412 KiB		271 Bytes	2022-10-20 20:11:58
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:38
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:40
AC	余多多29	7ms	480 KiB		272 Bytes	2023-4-17 22:16:37
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:41
AC	bvvd	7ms	7.1 MiB	C++20(O2)	243 Bytes	2024-4-19 17:06:56
AC	奇怪的正义人！ (leweiqi)	7ms	384 KiB		274 Bytes	2023-3-12 16:26:54
AC	新壹街——陈学彬 (BUG)	7ms	6.8 MiB		223 Bytes	2023-6-24 9:56:27
AC	韩思辰 (hansichen)	7ms	440 KiB		242 Bytes	2022-11-26 9:12:37
AC	星野光 (Hoshino Hikari)	7ms	6.8 MiB		385 Bytes	2023-10-20 22:15:42
AC	不怎么聪明的家伙 (贺俊楠)	7ms	420 KiB		260 Bytes	2023-3-26 17:00:46
AC	yxj	7ms	432 KiB		260 Bytes	2022-10-20 15:19:51
AC	时代二校-陈天成 (鸭缩毛巾)	7ms	6.7 MiB		247 Bytes	2023-6-6 22:58:03
AC	六 (江智昕)	7ms	392 KiB		247 Bytes	2022-12-30 19:26:38
AC	赵彬鸿	7ms	384 KiB		200 Bytes	2022-8-12 15:56:13
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:39
AC	tsc_ (杨悦堃)	7ms	512 KiB		270 Bytes	2023-3-11 15:41:07
AC	^_^ (ctc)	7ms	6.8 MiB		234 Bytes	2023-10-18 20:07:06
AC	伍行念 (wuxingnian)	7ms	6.7 MiB		274 Bytes	2023-9-20 11:13:04
AC	李山水	7ms	436 KiB		329 Bytes	2022-8-28 19:37:45
AC	wzzjnb2012	7ms	428 KiB		269 Bytes	2022-9-26 22:31:37
AC	leisixian (22029-lyh)	7ms	428 KiB		306 Bytes	2023-3-23 18:45:13
AC	王祎辰 (wangyichen)	7ms	6.9 MiB		274 Bytes	2023-7-16 14:17:39
AC	zjm	7ms	384 KiB		289 Bytes	2022-10-16 10:18:24
AC	时代一校蒋帛希 (13983392730)	7ms	504 KiB		209 Bytes	2022-9-28 19:03:28
AC	pwf	7ms	384 KiB		240 Bytes	2022-4-9 17:03:05
AC	胡澜之 (666hlz666)	7ms	384 KiB		323 Bytes	2023-4-24 19:50:17
AC	徐梓尧 (xuziyao001)	7ms	512 KiB		213 Bytes	2022-9-10 21:42:19
AC	崔欧辰	7ms	6.8 MiB	C++11	303 Bytes	2024-8-6 10:28:34
AC	源著校区-宋昊成 (马冬梅)	7ms	512 KiB		227 Bytes	2023-2-25 17:17:58
AC	wangjun	7ms	6.9 MiB		272 Bytes	2023-11-10 22:46:57
AC	chen (peter)	7ms	512 KiB		242 Bytes	2022-2-20 19:01:03
AC	爱琴海校区-刁钲洋 (刁钲洋)	7ms	384 KiB		244 Bytes	2022-12-23 22:24:26
AC	yangyutong22003	7ms	392 KiB		297 Bytes	2023-2-25 17:54:07
AC	新壹街校区-陈峻熙 (陈峻熙)	7ms	7.1 MiB		222 Bytes	2023-10-28 11:34:13
AC	刘锦航	7ms	436 KiB		354 Bytes	2022-8-28 20:19:23
AC	liusitong	7ms	384 KiB		199 Bytes	2022-12-25 16:05:01
AC	时代2校-程俊燃 (chengjunran)	7ms	6.9 MiB		246 Bytes	2023-6-29 11:40:19
AC	六 (江智昕)	7ms	384 KiB		247 Bytes	2022-12-30 19:26:39
AC	谁陪訫牞（杀手） (22029-zys)	8ms	436 KiB		281 Bytes	2022-12-28 18:04:19
AC	hyh	8ms	384 KiB		243 Bytes	2023-5-10 19:20:47
AC	赵彬鸿	8ms	384 KiB		200 Bytes	2022-8-12 15:56:11
AC	小忙果 (王昱杰)	8ms	436 KiB		230 Bytes	2023-2-11 17:26:23
AC	杨瀚霖 (yanghanlin)	8ms	436 KiB		256 Bytes	2022-11-19 13:49:55
AC	林子沫awa (linziyue)	8ms	384 KiB		266 Bytes	2023-3-16 22:34:24