花园的周长和面积

状态	递交者	时间	内存	代码	递交时间
AC	旷山 (15213268688)	8ms	8.2 MiB	236 Bytes	2022-1-22 11:29:26
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:19:18
AC	liusihan	8ms	8.2 MiB	138 Bytes	2022-5-22 18:29:36
AC	冯梓轩	8ms	8.2 MiB	148 Bytes	2022-2-25 20:21:00
AC	kkksc03 (彭士锋)	8ms	8.2 MiB	124 Bytes	2022-1-20 9:00:44
AC	wuqi	8ms	8.2 MiB	131 Bytes	2022-1-25 20:06:24
AC	綰綰(HHYT)	8ms	7.3 MiB	113 Bytes	2024-1-21 16:59:44
AC	唐钰豪	8ms	8.2 MiB	120 Bytes	2022-1-22 9:58:08
AC	霍弈丞	8ms	8.1 MiB	144 Bytes	2022-5-22 15:53:51
AC	傅翊航 (fyh)	8ms	8.2 MiB	124 Bytes	2023-5-8 11:06:59
AC	吴佳智 (AWM)	8ms	7.7 MiB	134 Bytes	2023-2-18 9:51:54
AC	源著校区-宋昊成 (马冬梅)	8ms	7.8 MiB	158 Bytes	2023-2-3 17:32:19
AC	_add	8ms	8.2 MiB	126 Bytes	2022-1-15 20:01:49
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:11:42
AC	李彭宋代诗人 (ljy123456)	8ms	8.2 MiB	136 Bytes	2023-3-21 12:06:55
AC	ycy	8ms	8.2 MiB	235 Bytes	2022-8-21 19:54:56
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:19:19
AC	xiangsiyu	8ms	8.2 MiB	124 Bytes	2022-6-12 16:50:50
AC	fhc	8ms	8 MiB	118 Bytes	2023-3-7 18:22:34
AC	雷文博（帅哥） (18983951391)	8ms	8.2 MiB	124 Bytes	2023-1-15 17:51:12
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:21:10
AC	黎湘渝	8ms	8.2 MiB	129 Bytes	2023-3-7 18:31:15
AC	老六（王牌） (mhc)	8ms	8.2 MiB	113 Bytes	2023-4-30 14:36:59
AC	05c05-lyx	8ms	8.1 MiB	127 Bytes	2022-6-5 15:28:07
AC	罗晨睿 (luochenrui)	8ms	8.2 MiB	138 Bytes	2022-6-26 13:20:48
AC	乐伟祺 (yueweiqi)	8ms	8.2 MiB	144 Bytes	2021-12-31 19:33:38
AC	黄立信	8ms	8 MiB	113 Bytes	2022-12-1 16:19:44
AC	A小涂	8ms	6.7 MiB	133 Bytes	2023-9-8 20:18:24
AC	dengbowen	8ms	8.2 MiB	156 Bytes	2023-8-23 17:04:12
AC	姚宏逸	8ms	8.2 MiB	130 Bytes	2022-6-4 23:15:14
AC	潘佑实	8ms	7.4 MiB	154 Bytes	2023-2-19 17:17:29
AC	陈红恺 (chk)	8ms	8.2 MiB	143 Bytes	2022-5-27 19:16:04
AC	zyp (wangjunling23010)	8ms	8.2 MiB	142 Bytes	2023-3-24 20:15:39
AC	喵 (蹇心悦)	8ms	8.2 MiB	142 Bytes	2022-4-5 14:00:32
AC	李荣轩	8ms	8 MiB	129 Bytes	2023-3-7 18:27:03
AC	黎湘渝	8ms	8 MiB	129 Bytes	2023-3-7 18:27:27
AC	吴佳智 (AWM)	8ms	7.7 MiB	134 Bytes	2023-2-18 9:52:00
AC	凌肯 (lingken22006)	8ms	8.1 MiB	135 Bytes	2022-5-27 19:09:02
AC	chaikexu	8ms	8.2 MiB	122 Bytes	2022-6-16 20:43:22
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:11:39
AC	05c05-cwd1	8ms	8.2 MiB	128 Bytes	2022-4-17 14:33:45
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)	8ms	8.2 MiB	141 Bytes	2023-3-25 10:34:06
AC	林昱霏	8ms	8.2 MiB	119 Bytes	2022-6-28 19:08:25
AC	徐宛婷	8ms	8.2 MiB	131 Bytes	2023-3-7 18:30:21
AC	彭嘉豪 (pengjiahao)	8ms	8.2 MiB	114 Bytes	2022-7-9 16:46:21
AC	曹恩瑞 (shen_mi_hei_ke1)	8ms	8.2 MiB	137 Bytes	2022-1-15 11:17:32
AC	CYT	8ms	8 MiB	112 Bytes	2022-12-1 20:20:08
AC	zhouyuxiang	8ms	8.2 MiB	121 Bytes	2022-11-29 18:48:15
AC	我谢谢你全家	8ms	8.2 MiB	119 Bytes	2022-2-27 18:21:28
AC	许炜铭 (xuweiming)	8ms	8.2 MiB	172 Bytes	2023-3-19 15:16:22
AC	yh1	8ms	8.2 MiB	211 Bytes	2023-3-19 15:36:06
AC	05c35-hhw	8ms	8.1 MiB	121 Bytes	2022-6-6 15:16:42
AC	啊...这 (炼狱杏寿郎)	8ms	8.2 MiB	120 Bytes	2022-6-29 11:43:07
AC	唐钰豪	8ms	8.2 MiB	120 Bytes	2022-1-22 9:58:03
AC	zhangyh (张育菡)	8ms	8.2 MiB	120 Bytes	2022-5-15 8:51:08
AC	陈思源	8ms	8.2 MiB	129 Bytes	2023-3-7 18:33:03
AC	赵彬鸿	8ms	8.2 MiB	124 Bytes	2022-8-12 14:18:43
AC	梁程翔	8ms	7 MiB	180 Bytes	2024-1-19 15:21:58
AC	本人天生贪生pass (05c41-cqs)	8ms	8.2 MiB	153 Bytes	2022-3-14 19:19:24
AC	唐钰豪	8ms	8.2 MiB	120 Bytes	2022-1-22 9:58:09
AC	雷中鑫123456	8ms	6.7 MiB	119 Bytes	2023-8-24 14:40:47
AC	一片落叶 (yeyuhao)	8ms	8 MiB	149 Bytes	2023-8-24 11:17:56
AC	龙沁均 (我是S神)	8ms	8.2 MiB	128 Bytes	2022-3-6 16:11:19
AC	李荣轩	8ms	8 MiB	129 Bytes	2023-3-7 18:27:01
AC	MacrozClick_ (蒋淞霖)	8ms	8.2 MiB	128 Bytes	2022-1-22 10:05:32
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:20:09
AC	谢佳辰	8ms	8.2 MiB	166 Bytes	2022-3-27 9:51:29
AC	1324341445	8ms	8.2 MiB	154 Bytes	2023-7-5 20:16:15
AC	唐钰豪	8ms	8.2 MiB	136 Bytes	2022-1-22 9:57:16
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:12:23
AC	qinyi	8ms	8.2 MiB	121 Bytes	2022-2-13 15:17:07
AC	陈思源	8ms	8.2 MiB	129 Bytes	2023-3-7 18:32:59
AC	彭嘉豪 (pengjiahao)	8ms	8.2 MiB	114 Bytes	2022-7-9 16:46:18
AC	李禹衡 (liyuheng22006)	8ms	8.2 MiB	134 Bytes	2022-3-27 16:32:14
AC	lihaoyi	8ms	8.2 MiB	131 Bytes	2023-2-12 11:40:26
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	8ms	8.2 MiB	145 Bytes	2022-3-3 19:33:57
AC	唐钰豪	8ms	8.2 MiB	120 Bytes	2022-1-22 9:58:09
AC	雷文博（帅哥） (18983951391)	8ms	8.2 MiB	124 Bytes	2023-1-15 17:51:12
AC	余晨浩 (yuchenhao)	8ms	8.2 MiB	150 Bytes	2022-8-24 15:16:02
AC	old_doctor	8ms	8.2 MiB	140 Bytes	2022-1-1 13:10:26
AC	刘思邑	8ms	8.2 MiB	125 Bytes	2023-3-7 18:30:55
AC	吴佳智 (AWM)	8ms	7.7 MiB	134 Bytes	2023-2-18 9:52:01
AC	唐钰豪	8ms	8.2 MiB	120 Bytes	2022-1-22 9:58:03
AC	吴佳智 (AWM)	8ms	7.7 MiB	134 Bytes	2023-2-18 9:51:57
AC	(05c35-cyd)	8ms	8.2 MiB	158 Bytes	2022-3-6 12:03:28
AC	新壹街陈科言 (cky)	8ms	8.2 MiB	132 Bytes	2023-7-18 8:21:09
AC	游智棋	8ms	8.2 MiB	142 Bytes	2022-7-2 8:41:58
AC	曾子墨	8ms	8.2 MiB	140 Bytes	2023-7-15 8:35:38
AC	姚宏逸	8ms	8.2 MiB	120 Bytes	2022-3-5 17:54:25
AC	李荣轩	8ms	8.2 MiB	129 Bytes	2023-3-7 18:31:08
AC	时代二校+王吕棪 (wanglvyan)	8ms	8.2 MiB	143 Bytes	2023-2-25 15:52:40
AC	余多多29	8ms	8.2 MiB	123 Bytes	2023-4-18 22:37:43
AC	呵呵呵 (陈思琦)	8ms	8.2 MiB	146 Bytes	2022-8-11 20:30:51
AC	谢靳骁 (XJX)	8ms	8.2 MiB	130 Bytes	2023-3-19 17:58:45
AC	郑栋文	8ms	8.2 MiB	124 Bytes	2022-1-25 20:01:09
AC	(05c35-cyd)	8ms	8.2 MiB	158 Bytes	2022-3-6 12:03:50
AC	黄歆恬 (teresac)	8ms	8.2 MiB	197 Bytes	2022-6-12 16:07:46
AC	<让我看看谁在皮>	8ms	8.2 MiB	108 Bytes	2022-3-3 18:21:41
AC	yangbinyu	8ms	8.2 MiB	159 Bytes	2022-9-12 21:11:23
AC	kkksc03 (彭士锋)	8ms	8.2 MiB	124 Bytes	2022-1-20 9:00:36