三角形组成判断

状态	递交者	时间	内存	语言	代码	递交时间
AC	李哲 (lizhe)	4ms	376 KiB		207 Bytes	2022-7-3 21:51:57
AC	李禹衡 (liyuheng22006)	4ms	7.3 MiB		180 Bytes	2023-12-17 10:08:42
AC	姚宏逸	5ms	384 KiB		205 Bytes	2022-7-4 11:41:11
AC	赵沛喆	5ms	304 KiB		197 Bytes	2022-8-3 15:54:09
AC	不怎么聪明的家伙 (贺俊楠)	7ms	7.1 MiB		159 Bytes	2023-11-11 19:56:30
AC	张颢瀛	9ms	384 KiB		165 Bytes	2022-7-22 16:09:15
AC	爱琴海校区-刁钲洋 (刁钲洋)	9ms	392 KiB		209 Bytes	2023-2-27 19:34:36
AC	王泓涵 (whh)	9ms	384 KiB		157 Bytes	2022-7-5 15:55:10
AC	张瑞博	9ms	7 MiB	C++11	169 Bytes	2024-5-31 21:10:55
AC	程子杰 (05c41-czj)	9ms	384 KiB		203 Bytes	2022-7-28 11:06:37
AC	12345	9ms	388 KiB		297 Bytes	2022-8-6 12:09:29
AC	杜俊宏	9ms	384 KiB		171 Bytes	2022-7-3 20:07:38
AC	白祖睿	9ms	6.6 MiB	C++98(O2)	315 Bytes	2024-7-12 12:06:29
AC	坤坤荔枝小黑子 (zhonghaotian22006)	9ms	512 KiB		207 Bytes	2022-7-3 18:13:37
AC	11111	9ms	512 KiB		182 Bytes	2022-7-11 9:08:14
AC	赵泳鑫 (zhaoyongxin)	9ms	512 KiB		203 Bytes	2022-7-15 14:49:38
AC	11451254188 (22029-mjh)	9ms	444 KiB		187 Bytes	2023-2-28 22:22:45
AC	xiangsiyu	9ms	512 KiB		167 Bytes	2022-7-31 14:18:58
AC	ywh	9ms	440 KiB		186 Bytes	2022-7-9 9:25:50
AC	李彭宋代诗人 (ljy123456)	9ms	384 KiB		176 Bytes	2023-4-5 21:32:26
AC	李树崑 (lishukun)	9ms	432 KiB		231 Bytes	2022-8-21 11:44:52
AC	huyinuo	9ms	384 KiB		198 Bytes	2022-7-4 10:13:41
AC	阮 (媚狐不吃道旁李)	9ms	7.2 MiB	C++98	157 Bytes	2024-5-18 20:40:56
AC	1396013295	10ms	432 KiB		216 Bytes	2022-8-11 21:36:47
AC	RanHao	10ms	6.7 MiB		171 Bytes	2023-9-27 11:25:19
AC	疯神芭芭脱丝 (李卓修)	10ms	512 KiB		192 Bytes	2022-7-12 14:48:44
AC	(张洛诚)	10ms	436 KiB		224 Bytes	2023-4-9 9:11:21
AC	马渝杭 (mayuhang)	10ms	384 KiB		176 Bytes	2023-3-7 20:48:41
AC	刘蕤箎	10ms	384 KiB		160 Bytes	2023-4-16 17:20:38
AC	疯神芭芭脱丝 (李卓修)	10ms	428 KiB		192 Bytes	2022-7-12 14:46:44
AC	吴俊成 (wujuncheng)	10ms	436 KiB		467 Bytes	2022-7-11 20:16:19
AC	huyinuo	11ms	512 KiB		198 Bytes	2023-1-5 15:57:11
AC	黄梓桐 (HuangZiTong)	11ms	512 KiB		152 Bytes	2022-11-13 11:39:28
AC	zhangzhimo	11ms	444 KiB		253 Bytes	2022-12-4 13:30:52
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	11ms	448 KiB		161 Bytes	2022-9-30 20:32:32
AC	黄彦熹 (AK-203)	11ms	428 KiB		183 Bytes	2022-10-19 21:36:01
AC	李廷旭 (litingxu)	11ms	384 KiB		192 Bytes	2023-4-19 21:49:18
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	11ms	416 KiB		179 Bytes	2023-1-8 13:25:57
AC	chenjunyao	11ms	6.9 MiB		168 Bytes	2023-6-10 11:17:18
AC	新壹街校区-杨轩懿 (杨轩懿1)	11ms	6.7 MiB		158 Bytes	2023-8-28 13:27:23
AC	赵奕铭	11ms	7.1 MiB	C++98	160 Bytes	2024-6-26 17:11:47
AC	时代一校 - 冯隆浩 (冯隆浩)	11ms	6.7 MiB		172 Bytes	2023-7-21 9:01:08
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)	12ms	6.8 MiB		187 Bytes	2023-6-11 10:14:44
AC	Randy Marsh (杨子腾)	12ms	432 KiB		196 Bytes	2022-12-15 19:14:44
AC	NJL (NJlL)	12ms	432 KiB		199 Bytes	2022-7-6 14:13:30
AC	zlx (xiao)	13ms	432 KiB		195 Bytes	2023-3-23 22:10:26
AC	周琪渃	14ms	512 KiB		388 Bytes	2022-11-7 17:32:28
AC	A小涂	49ms	764 KiB		199 Bytes	2024-3-2 7:55:27
AC	王义苇 (wangyiwei)	50ms	540 KiB	C++98	274 Bytes	2024-9-6 10:43:34
AC	叶梓珺	52ms	556 KiB	C++11	176 Bytes	2024-9-1 11:45:42
AC	王晨志 (wangchenzhi)	141ms	3.9 MiB	Python 3	107 Bytes	2022-7-17 4:17:19
AC	majinhui	151ms	3.9 MiB	Python 3	103 Bytes	2022-7-10 11:12:45