三角形组成判断

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡程禹	9ms	392 KiB		182 Bytes	2023-2-25 20:34:24
AC	苏庭毅	9ms	384 KiB		190 Bytes	2023-2-25 20:26:15
AC	刘锦航	9ms	404 KiB		214 Bytes	2022-1-22 18:50:16
AC	chenyifei	9ms	384 KiB		227 Bytes	2022-1-22 20:08:02
AC	时代一校黄誉翔 (huang)	9ms	440 KiB		178 Bytes	2022-6-30 20:55:06
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)	9ms	436 KiB		220 Bytes	2022-11-20 16:47:22
AC	刘沄熙	9ms	384 KiB		292 Bytes	2022-3-13 11:31:27
AC	苏信泽	9ms	384 KiB		163 Bytes	2023-2-25 20:14:08
AC	苏庭毅	9ms	384 KiB		190 Bytes	2023-2-25 20:26:16
AC	罗晨睿 (luochenrui)	9ms	396 KiB		166 Bytes	2022-6-26 16:18:44
AC	赵彬鸿	9ms	384 KiB		185 Bytes	2022-8-13 10:04:22
AC	吴俊成 (wujuncheng)	9ms	440 KiB		467 Bytes	2022-7-9 22:14:09
AC	李禹衡 (liyuheng22006)	9ms	384 KiB		180 Bytes	2023-4-24 20:09:40
AC	杜是贤 (dushixian)	9ms	448 KiB		173 Bytes	2022-7-17 14:30:25
AC	苏庭毅	9ms	400 KiB		190 Bytes	2023-2-25 20:26:19
AC	zyp (wangjunling23010)	9ms	388 KiB		235 Bytes	2023-4-14 18:13:09
AC	叶雨昊 (yeyuhao22006)	9ms	384 KiB		175 Bytes	2022-6-13 20:41:48
AC	赵鑫宸 (xiaoxiao721)	9ms	432 KiB		222 Bytes	2022-2-20 5:31:17
AC	张祖名	9ms	7 MiB	C++98(O2)	184 Bytes	2024-6-9 10:19:04
AC	Erin	9ms	7.2 MiB	C++98	174 Bytes	2024-5-2 16:24:06
AC	余多多29	9ms	432 KiB		207 Bytes	2023-4-25 21:37:18
AC	你爹 (郭铠嘉)	9ms	384 KiB		214 Bytes	2022-1-26 18:51:59
AC	苏庭毅	9ms	384 KiB		190 Bytes	2023-2-25 20:26:20
AC	赵彬鸿	9ms	384 KiB		185 Bytes	2022-8-13 10:04:23
AC	程子杰 (05c41-czj)	9ms	440 KiB		218 Bytes	2022-7-27 10:36:39
AC	WHWHWHWHWHW (OP AI)	9ms	7 MiB	C++98	203 Bytes	2024-6-17 20:46:10
AC	陈家齐 (陈家齐1)	9ms	384 KiB		165 Bytes	2023-2-25 20:24:14
AC	杨颂恩 (yangsongen)	9ms	384 KiB		209 Bytes	2023-5-6 21:29:52
AC	李玥漪	9ms	384 KiB		239 Bytes	2022-3-13 11:33:49
AC	新壹街校区-周士杰 (zsj)	9ms	436 KiB		156 Bytes	2022-6-9 20:40:32
AC	曲奇饼干	9ms	384 KiB		202 Bytes	2022-12-11 10:58:43
AC	呵呵呵 (陈思琦)	9ms	384 KiB		171 Bytes	2022-9-3 17:05:30
AC	chen (peter)	9ms	440 KiB		217 Bytes	2022-7-19 11:05:49
AC	傅博涛	9ms	384 KiB		164 Bytes	2022-1-30 17:13:50
AC	无尽的想象 (谭仕高)	9ms	436 KiB		179 Bytes	2022-7-15 15:21:00
AC	苏庭毅	9ms	384 KiB		190 Bytes	2023-2-25 20:26:18
AC	时代校区-刘臣原 (微笑王子)	9ms	392 KiB		159 Bytes	2022-5-23 19:42:07
AC	蒲梓勋 (puzixun)	9ms	392 KiB		163 Bytes	2022-9-14 22:12:14
AC	杨佳葆	9ms	392 KiB		205 Bytes	2022-4-4 16:12:39
AC	侯治鋆	9ms	444 KiB		164 Bytes	2022-5-6 18:50:33
AC	longhao	9ms	384 KiB		171 Bytes	2022-1-24 15:47:42
AC	hulang	9ms	448 KiB		231 Bytes	2022-2-13 18:30:32
AC	你爹 (郭铠嘉)	9ms	384 KiB		189 Bytes	2022-3-19 13:39:47
AC	dmh (丁墨涵)	9ms	388 KiB		192 Bytes	2022-2-26 14:56:19
AC	时代2校+施皓宬 (shihaocheng)	9ms	384 KiB		166 Bytes	2023-2-25 17:52:28
AC	江坤锜	9ms	384 KiB		207 Bytes	2023-2-25 20:20:54
AC	苏庭毅	9ms	392 KiB		190 Bytes	2023-2-25 20:26:17
AC	谢博文	9ms	428 KiB		243 Bytes	2022-2-19 11:13:49
AC	吃小孩的viv_	9ms	440 KiB		185 Bytes	2022-7-31 11:54:35
AC	张梓辰 (DiaoDesi屌德斯)	9ms	420 KiB		179 Bytes	2022-9-14 19:28:19
AC	xxteacher	9ms	384 KiB		285 Bytes	2022-1-28 13:48:11
AC	不怎么聪明的家伙 (贺俊楠)	9ms	432 KiB		211 Bytes	2023-2-17 18:48:37
AC	刘昱辰	9ms	384 KiB		192 Bytes	2022-9-2 19:24:51
AC	苏庭毅	9ms	384 KiB		190 Bytes	2023-2-25 20:26:16
AC	赵彬鸿	9ms	392 KiB		185 Bytes	2022-8-13 10:04:19
AC	xuniaoyin (徐袅音)	9ms	6.8 MiB		197 Bytes	2023-10-10 21:46:10
AC	赵彬鸿	9ms	392 KiB		185 Bytes	2022-8-13 10:04:19
AC	苏庭毅	9ms	384 KiB		190 Bytes	2023-2-25 20:26:21
AC	CK (李弘毅)	9ms	384 KiB		197 Bytes	2022-8-14 11:34:34
AC	200800	9ms	6.8 MiB		183 Bytes	2023-10-5 12:36:36
AC	贾博涵	10ms	6.8 MiB		154 Bytes	2023-11-7 15:17:09
AC	任远宁 (renyuanning)	10ms	392 KiB		188 Bytes	2022-10-15 19:16:15
AC	赵泳鑫 (zhaoyongxin)	10ms	440 KiB		174 Bytes	2022-4-23 17:40:27
AC	洛阳锦程 (郭思利)	10ms	7.3 MiB	C++98	177 Bytes	2024-5-19 9:39:01
AC	牟淳雅	10ms	7 MiB		178 Bytes	2023-9-24 10:46:26
AC	中岛敦 (黄麒瑞)	10ms	6.7 MiB		211 Bytes	2023-9-30 21:30:22
AC	苏庭毅	10ms	400 KiB		190 Bytes	2023-2-25 20:26:22
AC	食不食油饼（点主页康康） (Nemo)	10ms	512 KiB		169 Bytes	2022-9-2 19:29:36
AC	郑尧 (zhengyao)	10ms	6.8 MiB		168 Bytes	2023-10-16 19:05:56
AC	18523558128zcn	10ms	436 KiB		190 Bytes	2022-4-23 14:34:12
AC	曹埊睿 (caodirui)	10ms	456 KiB		190 Bytes	2023-4-17 18:54:33
AC	heyuzhe	10ms	6.8 MiB	C++98	234 Bytes	2024-8-15 18:03:56
AC	谁陪訫牞（杀手） (22029-zys)	10ms	384 KiB		205 Bytes	2023-1-4 17:21:29
AC	苏庭毅	10ms	440 KiB		190 Bytes	2023-2-25 20:24:02
AC	Z.饮月君 (张皓南)	10ms	424 KiB		239 Bytes	2022-3-16 22:25:24
AC	黄立信	10ms	6.8 MiB		218 Bytes	2023-10-12 20:45:23
AC	时代一校-曾科智 (曾科智)	10ms	424 KiB		174 Bytes	2023-2-25 19:36:22
AC	陈秋石	10ms	388 KiB		222 Bytes	2022-3-13 11:50:44
AC	陈家齐 (陈家齐1)	10ms	440 KiB		165 Bytes	2023-3-3 21:42:06
AC	炸鱼4000+ (dxc)	10ms	384 KiB		199 Bytes	2023-2-25 20:24:00
AC	wangjun	10ms	7.1 MiB		177 Bytes	2023-11-12 19:58:05
AC	霍弈丞	10ms	436 KiB		236 Bytes	2022-3-17 17:29:43
AC	王若衡 (wangruoheng)	10ms	384 KiB		158 Bytes	2023-5-25 21:27:07
AC	lafuzbc	10ms	384 KiB		184 Bytes	2022-8-7 16:10:49
AC	冒牌陈杰晟【MOD】 (wed)	10ms	512 KiB		147 Bytes	2022-2-26 12:47:02
AC	苏庭毅	10ms	384 KiB		190 Bytes	2023-2-25 20:26:18
AC	赵彬鸿	10ms	384 KiB		185 Bytes	2022-8-13 10:04:21
AC	Accepted (周芷乐)	10ms	7 MiB	C++14	187 Bytes	2024-6-18 11:41:46
AC	李清城 (朱瀚文集训号)	10ms	436 KiB		184 Bytes	2023-2-2 17:15:29
AC	赵彬鸿	10ms	384 KiB		185 Bytes	2022-8-13 10:04:18
AC	金沙校区-蓝祥与 (蓝祥与)	10ms	440 KiB		179 Bytes	2023-3-5 21:32:22
AC	明哲瀚 (18580067605)	10ms	392 KiB		194 Bytes	2022-10-1 14:14:50
AC	yangyutong22003	10ms	384 KiB		208 Bytes	2023-3-11 17:56:29
AC	zhanglianjie	10ms	384 KiB		184 Bytes	2023-3-11 17:56:13
AC	许徐非凡 (非同凡响)	10ms	384 KiB		231 Bytes	2022-10-7 20:02:36
AC	南坪校区-郑力博 (zhenglibo23003)	10ms	424 KiB		160 Bytes	2023-3-11 17:52:44
AC	李山水	10ms	384 KiB		288 Bytes	2022-8-27 18:46:52
AC	苏庭毅	10ms	384 KiB		190 Bytes	2023-2-25 20:26:20
AC	新一街校区Jason_LuoYouZheng (罗友峥)	10ms	424 KiB		273 Bytes	2023-5-22 22:06:11
AC	芒苒忧 (廖迦南)	10ms	512 KiB		280 Bytes	2022-1-25 15:21:53