等腰三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	6.7 MiB		205 Bytes	2023-8-29 22:45:15
AC	kim	15ms	384 KiB		225 Bytes	2023-3-10 20:03:37
AC	谁陪訫牞（杀手） (22029-zys)	15ms	384 KiB		244 Bytes	2023-1-13 17:54:03
AC	甄一阳 (22016-zyy)	15ms	512 KiB		245 Bytes	2022-9-25 9:51:39
AC	刘蕤箎	15ms	7.8 MiB		219 Bytes	2023-8-25 17:09:13
AC	稻妻第一深情 (喝酒の吟游诗人)	15ms	428 KiB		1.3 KiB	2023-3-11 23:47:43
AC	陈诺	15ms	7 MiB		249 Bytes	2023-12-27 17:12:47
AC	kim	15ms	384 KiB		225 Bytes	2023-3-10 20:03:29
AC	ganlin1	15ms	6.9 MiB		208 Bytes	2023-7-28 13:25:33
AC	杨瀚霖 (yanghanlin)	15ms	384 KiB		275 Bytes	2023-3-11 10:47:00
AC	三差学生(尘埃蓝莓) (白佳睿)	15ms	6.9 MiB		244 Bytes	2023-8-13 10:11:27
AC	文硕 (文硕1)	16ms	512 KiB		372 Bytes	2022-7-12 11:41:12
AC	尹浩宁2077	16ms	6.9 MiB		247 Bytes	2023-6-30 10:15:10
AC	陈泰羽 (chentaiyu)	16ms	444 KiB		216 Bytes	2023-3-17 18:33:48
AC	22029-lyh	16ms	384 KiB		250 Bytes	2023-1-7 11:09:33
AC	Jack	16ms	420 KiB		218 Bytes	2023-3-28 21:05:29
AC	科比.布莱恩特 (董浩琰)	16ms	7.7 MiB		238 Bytes	2023-7-20 19:21:12
AC	新壹街校区-陈琬舒 (空空大师)	16ms	7.1 MiB		252 Bytes	2023-12-8 20:11:28
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	16ms	384 KiB		242 Bytes	2023-1-7 11:13:56
AC	22029-hqh	16ms	384 KiB		230 Bytes	2023-1-7 12:03:13
AC	刘昊臻 (liuhaozhen)	16ms	7 MiB		256 Bytes	2023-12-8 20:07:23
AC	谁陪訫牞（杀手） (22029-zys)	16ms	384 KiB		263 Bytes	2023-1-13 17:57:46
AC	杨浩灵 (金坷拉)	16ms	436 KiB		389 Bytes	2022-10-28 22:54:53
AC	新壹街校区-吴鑫鹏 (吴鑫鹏)	16ms	7 MiB		267 Bytes	2023-12-8 20:23:39
AC	10255	16ms	6.8 MiB		234 Bytes	2023-6-19 19:47:01
AC	时代1校-杨宇轩 (杨宇轩)	16ms	6.7 MiB		243 Bytes	2023-8-22 12:29:25
AC	chenrunxiang22031	16ms	420 KiB		254 Bytes	2023-3-24 18:55:37
AC	郑尧 (zhengyao)	16ms	552 KiB		226 Bytes	2023-2-18 20:56:14
AC	22029-hqh	16ms	392 KiB		230 Bytes	2023-1-7 12:03:12
AC	RanHao	16ms	6.9 MiB		312 Bytes	2023-7-22 19:09:40
AC	我很6 (zjj22031)	16ms	384 KiB		308 Bytes	2023-1-9 11:29:33
AC	BJ6180C8CTD (Fan)	16ms	6.7 MiB		255 Bytes	2023-9-9 17:06:54
AC	22029-hqh	16ms	392 KiB		230 Bytes	2023-1-7 12:03:12
AC	陈红恺 (chk)	16ms	432 KiB		291 Bytes	2022-8-25 15:18:20
AC	王晴萱	16ms	6.9 MiB		244 Bytes	2023-7-14 15:41:41
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)	16ms	384 KiB		372 Bytes	2023-1-7 11:13:32
AC	CK (李弘毅)	16ms	512 KiB		211 Bytes	2022-11-22 11:24:58
AC	22029-lsl	17ms	384 KiB		263 Bytes	2023-1-7 11:06:32
AC	22029-hqh	17ms	384 KiB		230 Bytes	2023-1-7 12:03:13
AC	chenrunxiang22031	17ms	436 KiB		254 Bytes	2023-1-9 11:32:16
AC	叶哲宇 (yzy)	17ms	7.1 MiB		231 Bytes	2023-6-29 11:08:17
AC	葛琮扬	17ms	6.9 MiB		247 Bytes	2023-7-21 12:17:42
AC	郑岐蔚	17ms	512 KiB		241 Bytes	2023-1-26 14:36:11
AC	^_^ (ctc)	17ms	6.8 MiB		247 Bytes	2023-6-19 19:46:29
AC	kim	17ms	384 KiB		225 Bytes	2023-3-10 20:03:23
AC	zhengjiaxiang	17ms	432 KiB		214 Bytes	2023-3-10 20:27:12
AC	Tender. (05c05-zhou)	17ms	512 KiB		261 Bytes	2022-10-18 11:38:38
AC	谁陪訫牞（杀手） (22029-zys)	17ms	512 KiB		563 Bytes	2023-1-13 17:52:22
AC	偽艺術家 (chenyanchi22006)	17ms	436 KiB		246 Bytes	2022-8-21 22:18:01
AC	时代一校-赵彦博 (zyb)	17ms	7.2 MiB		229 Bytes	2023-8-23 16:52:35
AC	陌生人 (涂玉龙)	18ms	7.1 MiB		229 Bytes	2023-12-3 15:13:18
AC	中岛敦 (黄麒瑞)	18ms	7 MiB		259 Bytes	2023-12-8 20:29:34
AC	新壹街校区-冉睦阳 (冉睦阳)	20ms	7 MiB		216 Bytes	2023-12-8 20:26:13
AC	zyl	24ms	7.3 MiB		231 Bytes	2024-1-5 13:31:24
AC	贾博涵	24ms	7 MiB		226 Bytes	2023-12-5 9:45:35
AC	许律天	27ms	7 MiB		255 Bytes	2023-12-23 16:30:07
AC	wangjun	30ms	6.9 MiB		229 Bytes	2023-11-29 20:19:08
AC	时代校区-孔令皓 (konglinghao)	56ms	536 KiB		421 Bytes	2024-2-15 12:45:16
AC	拥抱幸福小熊(吴沛篪)	68ms	532 KiB		275 Bytes	2024-3-17 17:39:34
AC	jdy	68ms	532 KiB		267 Bytes	2024-3-6 15:29:44
AC	JOKER (hhy)	68ms	536 KiB		246 Bytes	2024-2-16 19:50:49
AC	zhongjunxuan	68ms	532 KiB		295 Bytes	2024-3-7 16:29:14
AC	冉诩然	68ms	544 KiB	C++11	266 Bytes	2024-10-18 18:20:46
AC	时代2校+施皓宬 (shihaocheng)	69ms	536 KiB	C++11	239 Bytes	2024-10-27 11:27:04
AC	王渝钦	69ms	544 KiB	C++11	236 Bytes	2024-10-24 22:53:38
AC	曹雅萱	70ms	764 KiB	C++11	266 Bytes	2024-9-2 20:28:16
AC	孙烽轶 (sfy)	70ms	544 KiB		245 Bytes	2024-3-14 15:49:27
AC	cupy战士 (05c05-dkf)	71ms	764 KiB		232 Bytes	2024-3-2 9:39:22
AC	赵奕铭	72ms	532 KiB	C++11	317 Bytes	2024-10-10 22:23:12
AC	xzf	74ms	764 KiB	C++98	225 Bytes	2024-9-22 21:15:47
AC	fcxin	125ms	9.4 MiB	Python 3	268 Bytes	2024-8-11 11:51:33
AC	xxteacher	176ms	9 MiB	Python 3	90 Bytes	2023-7-23 14:20:51
AC	猫不理包子	176ms	9.1 MiB	Python 3	127 Bytes	2023-11-4 14:49:23
AC	高俊	177ms	9 MiB	Python 3	117 Bytes	2023-10-27 13:49:03
AC	Rocketboy	194ms	9 MiB	Python 3	103 Bytes	2023-8-5 14:00:48
AC	杨坤霖 (steven)	198ms	3.9 MiB	Python 3	96 Bytes	2022-7-5 19:07:40
AC	谭红中 (不知道)	200ms	9.1 MiB	Python 3	137 Bytes	2023-8-28 12:28:20
AC	majinhui	204ms	4 MiB	Python 3	70 Bytes	2022-7-16 14:02:04
AC	19598	204ms	9.1 MiB	Python 3	103 Bytes	2023-9-7 14:27:55
AC	杨坤霖 (steven)	205ms	3.9 MiB	Python 3	96 Bytes	2022-7-5 19:07:41
AC	杨坤霖 (steven)	207ms	3.9 MiB	Python 3	96 Bytes	2022-7-5 19:07:41
AC	范老师	208ms	4 MiB	Python 3	157 Bytes	2022-12-15 16:11:37
AC	杨坤霖 (steven)	213ms	3.9 MiB	Python 3	96 Bytes	2022-7-5 19:07:41
AC	杨坤霖 (steven)	213ms	3.9 MiB	Python 3	96 Bytes	2022-7-5 19:07:38
AC	cola	213ms	4 MiB	Python 3	74 Bytes	2022-12-21 15:55:20
AC	杨坤霖 (steven)	215ms	3.9 MiB	Python 3	96 Bytes	2022-7-5 19:07:40
AC	1396013295	217ms	3.9 MiB	Python 3	90 Bytes	2022-1-22 18:30:49
AC	kongql	220ms	4.2 MiB	Python 3	226 Bytes	2022-7-22 14:07:08
AC	Qinxiu	542ms	3.9 MiB	Python 3	137 Bytes	2024-2-12 14:51:22