求三角形面积

状态	递交者	时间	内存	语言	代码	递交时间
AC	21035-wyf	1ms	384 KiB		281 Bytes	2022-5-1 12:03:15
AC	新一街校区Jason_LuoYouZheng (罗友峥)	1ms	384 KiB		408 Bytes	2023-3-13 21:39:42
AC	新壹街-曾浩坤 (曾浩坤)	1ms	6.8 MiB		180 Bytes	2023-9-9 11:31:29
AC	ttz	1ms	384 KiB		264 Bytes	2022-3-9 21:08:18
AC	时代一校-王宥量 (wangyouliang)	1ms	384 KiB		152 Bytes	2022-9-12 13:58:18
AC	UsMt1 (jiangyuan)	1ms	6.9 MiB		178 Bytes	2023-7-22 21:58:06
AC	金沙校区-蓝祥与 (蓝祥与)	1ms	384 KiB		184 Bytes	2022-11-29 16:47:15
AC	wangzhijie	1ms	384 KiB		176 Bytes	2022-1-24 15:43:44
AC	邹曜丞 (13983097018)	1ms	6.7 MiB		194 Bytes	2023-7-18 10:21:48
AC	周莀熙	1ms	6.9 MiB	C++11	218 Bytes	2024-8-18 16:24:44
AC	李睿杰	1ms	436 KiB		192 Bytes	2022-9-4 9:42:35
AC	爱琴海校区-黄辰浩 (huangchenhao)	1ms	384 KiB		197 Bytes	2023-4-2 14:51:11
AC	张家豪 (zhangjiahao)	1ms	432 KiB		179 Bytes	2023-4-15 22:37:37
AC	付博plus	1ms	436 KiB		208 Bytes	2023-2-12 17:14:16
AC	陈秋石	1ms	384 KiB		182 Bytes	2022-5-31 22:10:05
AC	qinjin11	1ms	440 KiB		209 Bytes	2022-7-19 10:58:59
AC	李睿杰	1ms	384 KiB		192 Bytes	2022-9-4 9:42:39
AC	zhangzhimo	1ms	384 KiB		400 Bytes	2022-9-15 19:28:20
AC	马渝杭 (mayuhang)	1ms	384 KiB		136 Bytes	2022-5-5 19:26:07
AC	cheers 戴 (daizhuorun)	1ms	384 KiB		229 Bytes	2022-2-20 20:55:16
AC	NJL (NJlL)	1ms	384 KiB		191 Bytes	2022-3-13 18:26:35
AC	诸禹吉 (zhuyuji)	1ms	384 KiB		146 Bytes	2022-3-6 20:27:18
AC	22029-zjs	1ms	384 KiB		197 Bytes	2022-11-12 11:42:44
AC	谭懿轩 (yanyixuan)	1ms	428 KiB		179 Bytes	2022-3-17 15:33:47
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		186 Bytes	2022-3-12 18:12:35
AC	叶哲宇 (yzy)	1ms	6.8 MiB		206 Bytes	2023-7-4 8:29:59
AC	肖添宇	1ms	384 KiB		196 Bytes	2022-3-12 18:13:05
AC	hrz923	1ms	6.7 MiB		190 Bytes	2023-8-6 15:02:19
AC	新壹街.曾祥睿 (zxr)	1ms	6.9 MiB		235 Bytes	2023-8-17 19:55:03
AC	xzf	1ms	6.9 MiB		411 Bytes	2023-10-21 19:48:46
AC	时代校区-刘臣原 (微笑王子)	1ms	384 KiB		146 Bytes	2022-11-29 19:50:38
AC	经常消失 (小萝卜)	1ms	384 KiB		207 Bytes	2022-3-26 13:20:01
AC	郑尧 (zhengyao)	1ms	7 MiB		196 Bytes	2023-6-29 20:22:36
AC	陈骏逸 (chenjunyi)	1ms	352 KiB		212 Bytes	2022-8-14 11:26:12
AC	张皓南2	1ms	384 KiB		258 Bytes	2022-8-28 15:52:25
AC	时代一校-赵彦博 (zyb)	1ms	6.9 MiB		174 Bytes	2023-7-11 21:30:40
AC	我是周靖松长得帅 (mouyunqi)	1ms	384 KiB		184 Bytes	2023-4-29 15:52:41
AC	王晨志 (wangchenzhi)	1ms	384 KiB		420 Bytes	2022-1-31 17:13:19
AC	吕淼 (05c41-lm)	1ms	384 KiB		219 Bytes	2022-3-17 19:13:46
AC	张玉坚 (zhangyuian)	1ms	440 KiB		179 Bytes	2022-6-29 13:34:34
AC	zhangyouze (张佑泽)	1ms	7 MiB	C++98	178 Bytes	2024-8-25 9:52:33
AC	xxteacher	1ms	384 KiB		242 Bytes	2022-1-25 13:48:55
AC	杨颂恩 (yangsongen)	1ms	6.8 MiB		203 Bytes	2023-11-8 17:56:25
AC	王宇桐 (我是外挂)	1ms	384 KiB		235 Bytes	2022-1-23 16:22:01
AC	时代一校黄誉翔 (huang)	1ms	384 KiB		230 Bytes	2022-9-28 20:17:57
AC	许炜铭 (xuweiming)	1ms	364 KiB		207 Bytes	2023-3-26 14:55:16
AC	张子扬	1ms	384 KiB		270 Bytes	2022-1-24 18:10:38
AC	梦之泪伤	1ms	392 KiB		198 Bytes	2022-3-6 11:49:40
AC	罗宇凡 (吴彦祖)	1ms	384 KiB		192 Bytes	2022-3-3 20:04:19
AC	yxj	1ms	436 KiB		141 Bytes	2022-10-20 13:40:32
AC	火星伞宾——刘晏恺 (刘晏恺)	1ms	6.7 MiB		191 Bytes	2023-8-16 11:15:29
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	1ms	384 KiB		228 Bytes	2022-1-23 16:23:21
AC	司雨来 (siyulai)	1ms	440 KiB		194 Bytes	2022-10-6 16:22:46
AC	zhanghaoran	1ms	424 KiB		181 Bytes	2022-3-16 19:35:02
AC	6 (HIMMZXC1)	1ms	384 KiB		162 Bytes	2023-5-21 14:49:25
AC	old_doctor	1ms	428 KiB		160 Bytes	2022-6-6 14:01:30
AC	灿灿 (CAN)	1ms	384 KiB		394 Bytes	2022-5-12 18:41:34
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	384 KiB		92 Bytes	2022-9-6 20:13:56
AC	wangxingyue	1ms	400 KiB		134 Bytes	2023-3-28 18:38:56
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	1ms	384 KiB		187 Bytes	2022-1-23 9:44:16
AC	杜是贤 (dushixian)	1ms	384 KiB		220 Bytes	2022-1-23 15:12:35
AC	谭懿轩 (yanyixuan)	1ms	384 KiB		181 Bytes	2022-1-16 15:46:47
AC	xzf	1ms	6.9 MiB		232 Bytes	2023-7-9 11:54:39
AC	wuqi	1ms	384 KiB		342 Bytes	2022-5-8 18:09:29
AC	ttz	1ms	384 KiB		264 Bytes	2022-3-9 21:08:17
AC	hzm	1ms	432 KiB		190 Bytes	2022-8-12 17:14:37
AC	杜是贤 (dushixian)	1ms	384 KiB		220 Bytes	2022-3-9 19:55:14
AC	(-v-)ikun ((-v-))	1ms	428 KiB		190 Bytes	2022-9-11 12:51:58
AC	张峻尘 (zjc)	1ms	424 KiB		186 Bytes	2022-4-10 11:29:01
AC	SHY20091224	1ms	440 KiB		209 Bytes	2022-8-17 15:12:28
AC	鲜榨大肠汁	1ms	384 KiB		216 Bytes	2022-3-9 20:52:21
AC	杨镇宇	1ms	6.8 MiB	C++98	198 Bytes	2024-6-14 19:33:14
AC	张祖名	1ms	6.9 MiB		194 Bytes	2023-7-7 20:10:04
AC	dengfeng	1ms	384 KiB		258 Bytes	2022-2-10 16:42:18
AC	_daa	1ms	384 KiB		111 Bytes	2022-1-22 17:52:00
AC	wangjunhan	1ms	384 KiB		167 Bytes	2022-1-23 17:22:19
AC	希蒙 (zhengxingya)	1ms	6.7 MiB		225 Bytes	2023-6-22 10:50:27
AC	欧俊阳	1ms	6.9 MiB		172 Bytes	2023-7-23 14:09:12
AC	王韵淮	1ms	384 KiB		116 Bytes	2022-4-17 9:35:34
AC	陈杰晟	1ms	404 KiB		223 Bytes	2022-2-13 10:10:17
AC	cheers 戴 (daizhuorun)	1ms	388 KiB		229 Bytes	2022-3-1 21:38:53
AC	chen (peter)	1ms	384 KiB		198 Bytes	2022-3-13 18:30:46
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)	1ms	384 KiB		235 Bytes	2022-11-12 16:19:34
AC	杜俊宏	1ms	428 KiB		158 Bytes	2022-3-23 20:46:22
AC	凌肯 (lingken22006)	1ms	388 KiB		195 Bytes	2022-7-31 21:46:12
AC	谢欣霖 (xiexinlin)	1ms	432 KiB		199 Bytes	2022-3-12 15:21:56
AC	宋金龙 (songjl0421)	1ms	384 KiB		243 Bytes	2022-1-22 12:12:42
AC	huyinuo	1ms	432 KiB		196 Bytes	2022-2-16 21:37:16
AC	傅博涛	1ms	392 KiB		221 Bytes	2022-1-22 10:34:35
AC	luoluonuoya	1ms	336 KiB		215 Bytes	2022-1-23 16:29:55
AC	ttz	1ms	384 KiB		264 Bytes	2022-3-9 21:08:14
AC	CK (李弘毅)	1ms	384 KiB		208 Bytes	2022-7-13 20:10:10
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	1ms	384 KiB		195 Bytes	2022-2-6 12:23:33
AC	Ronnie	1ms	384 KiB		262 Bytes	2022-3-6 22:06:32
AC	时代二校-焦雨齐 (Angel)	1ms	6.9 MiB		150 Bytes	2023-6-28 18:04:37
AC	Aphrode	1ms	6.8 MiB		243 Bytes	2023-6-20 15:18:08
AC	摩拉克斯	1ms	6.8 MiB		234 Bytes	2023-7-7 10:11:08
AC	李林峰 (金克拉)	1ms	436 KiB		215 Bytes	2022-12-9 18:57:22
AC	任希贤	1ms	384 KiB		191 Bytes	2022-12-31 15:33:12
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	1ms	384 KiB		191 Bytes	2022-3-3 20:25:43