与圆相关的计算

状态	递交者	时间	内存	语言	代码	递交时间
AC	源著校区-宋昊成 (马冬梅)	14ms	436 KiB		194 Bytes	2023-3-5 19:31:15
AC	呵呵呵 (陈思琦)	14ms	384 KiB		192 Bytes	2022-8-31 19:40:13
AC	王义苇 (wangyiwei)	14ms	512 KiB		208 Bytes	2023-3-12 14:14:02
AC	李卓燃 (李卓燃1)	14ms	512 KiB		192 Bytes	2023-3-13 19:12:52
AC	杨宇航1	14ms	384 KiB		203 Bytes	2023-3-12 14:01:06
AC	CK (李弘毅)	14ms	384 KiB		207 Bytes	2022-8-31 20:05:23
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)	14ms	432 KiB		199 Bytes	2022-11-30 19:39:47
AC	李禹衡 (liyuheng22006)	14ms	392 KiB		172 Bytes	2022-6-5 20:22:24
AC	SHY20091224	14ms	436 KiB		260 Bytes	2022-8-15 15:44:16
AC	王义苇 (wangyiwei)	14ms	384 KiB		208 Bytes	2023-3-12 14:14:02
AC	hnd (陈皓洋)	14ms	384 KiB		308 Bytes	2022-8-31 9:29:36
AC	王义苇 (wangyiwei)	14ms	384 KiB		208 Bytes	2023-3-12 13:56:29
AC	谢靳骁 (XJX)	14ms	392 KiB		173 Bytes	2023-5-19 18:21:59
AC	王义苇 (wangyiwei)	14ms	384 KiB		208 Bytes	2023-3-12 14:13:52
AC	王义苇 (wangyiwei)	14ms	384 KiB		208 Bytes	2023-3-12 14:13:46
AC	王义苇 (wangyiwei)	14ms	392 KiB		208 Bytes	2023-3-12 14:13:55
AC	付博plus	14ms	512 KiB		256 Bytes	2022-8-30 19:15:45
AC	胡熙景	14ms	512 KiB		243 Bytes	2022-9-8 21:36:29
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	392 KiB		220 Bytes	2022-11-5 19:42:03
AC	张颢瀛	14ms	436 KiB		250 Bytes	2022-6-8 22:16:36
AC	马渝杭 (mayuhang)	14ms	392 KiB		182 Bytes	2023-3-21 19:35:10
AC	王义苇 (wangyiwei)	14ms	384 KiB		208 Bytes	2023-3-12 14:14:01
AC	呵呵呵 (陈思琦)	14ms	384 KiB		192 Bytes	2022-8-31 19:40:11
AC	郑尧 (zhengyao)	14ms	6.9 MiB		214 Bytes	2023-7-1 20:27:10
AC	SHY20091224	14ms	428 KiB		260 Bytes	2022-8-31 15:56:10
AC	王义苇 (wangyiwei)	14ms	384 KiB		208 Bytes	2023-3-12 13:56:30
AC	hnd (陈皓洋)	14ms	384 KiB		308 Bytes	2022-8-31 10:10:37
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:14:08
AC	金沙校区-先珂熠 (九转大肠)	15ms	6.9 MiB	C++20(O2)	227 Bytes	2024-6-23 17:22:11
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:00
AC	缥 (王硕2012)	15ms	512 KiB		263 Bytes	2022-11-20 20:54:41
AC	周琪渃	15ms	392 KiB		275 Bytes	2022-12-2 22:29:34
AC	SHY20091224	15ms	520 KiB		263 Bytes	2022-9-1 14:39:06
AC	朱柯羽	15ms	440 KiB		204 Bytes	2022-9-10 15:15:30
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:13:51
AC	汪致卉 (wangzh)	15ms	512 KiB		219 Bytes	2022-6-24 20:22:40
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 13:56:30
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:14:12
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:13:50
AC	孙FY	15ms	512 KiB		210 Bytes	2022-8-31 20:34:17
AC	huyinuo	15ms	512 KiB		267 Bytes	2022-7-6 16:29:09
AC	王义苇 (wangyiwei)	15ms	412 KiB		208 Bytes	2023-3-12 14:14:08
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:09
AC	杨淇瑞 (杨淇瑞29)	15ms	6.8 MiB		271 Bytes	2023-9-20 20:33:25
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:10
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:13:46
AC	胡熙景	15ms	392 KiB		231 Bytes	2022-9-15 22:00:21
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:14:10
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:14:01
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:13:53
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:14:03
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:14:00
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:07
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:00
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:13:57
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:13:55
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:13:59
AC	hnd (陈皓洋)	15ms	384 KiB		308 Bytes	2022-8-31 10:10:37
AC	许峻浩	15ms	392 KiB		191 Bytes	2023-3-12 14:19:02
AC	wuqilin	15ms	432 KiB		213 Bytes	2022-9-14 18:21:38
AC	王义苇 (wangyiwei)	15ms	388 KiB		208 Bytes	2023-3-12 13:56:29
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:14:10
AC	王义苇 (wangyiwei)	15ms	512 KiB		208 Bytes	2023-3-12 14:14:07
AC	廖永亨	15ms	512 KiB		218 Bytes	2022-11-30 18:46:18
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:01
AC	朱老师 (zyp)	15ms	392 KiB		170 Bytes	2022-10-27 22:23:11
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:13:59
AC	王义苇 (wangyiwei)	15ms	384 KiB		208 Bytes	2023-3-12 14:13:53
AC	昌文迪 (05c05-cwd2)	15ms	384 KiB		218 Bytes	2022-12-3 11:35:19
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:08
AC	王义苇 (wangyiwei)	15ms	400 KiB		208 Bytes	2023-3-9 21:23:40
AC	scallway1	15ms	384 KiB		195 Bytes	2022-8-31 20:05:01
AC	chenxiyu	15ms	512 KiB		222 Bytes	2022-12-3 16:39:29
AC	王义苇 (wangyiwei)	15ms	392 KiB		208 Bytes	2023-3-12 14:14:01
AC	王义苇 (wangyiwei)	15ms	512 KiB		208 Bytes	2023-3-12 14:14:09
AC	yang	15ms	432 KiB		377 Bytes	2022-9-2 11:02:55
AC	邵冠铖 (shaoguancheng22031)	15ms	420 KiB		168 Bytes	2022-12-8 14:10:37
AC	11451254188 (22029-mjh)	16ms	512 KiB		218 Bytes	2022-11-30 22:55:35
AC	王义苇 (wangyiwei)	16ms	520 KiB		208 Bytes	2023-3-12 14:14:11
AC	王义苇 (wangyiwei)	16ms	384 KiB		208 Bytes	2023-3-12 14:13:54
AC	王义苇 (wangyiwei)	16ms	384 KiB		208 Bytes	2023-3-12 14:13:57
AC	王义苇 (wangyiwei)	16ms	384 KiB		208 Bytes	2023-3-12 14:13:53
AC	黄梓轩 (huangzixuan)	16ms	384 KiB		210 Bytes	2022-8-31 20:07:26
AC	王义苇 (wangyiwei)	16ms	384 KiB		208 Bytes	2023-3-12 14:14:12
AC	伍芷函	16ms	384 KiB		176 Bytes	2022-8-25 11:35:42
AC	疯神芭芭脱丝 (李卓修)	16ms	424 KiB		241 Bytes	2022-7-16 13:47:54
AC	王义苇 (wangyiwei)	16ms	392 KiB		208 Bytes	2023-3-12 14:14:07
AC	王义苇 (wangyiwei)	16ms	384 KiB		208 Bytes	2023-3-12 14:14:06
AC	王义苇 (wangyiwei)	16ms	392 KiB		208 Bytes	2023-3-12 14:13:59
AC	弹射起飞 ? 冲 ! (吴周周)	16ms	6.8 MiB		294 Bytes	2023-7-1 16:40:08
AC	leisixian (22029-lyh)	16ms	384 KiB		230 Bytes	2022-11-30 15:50:54
AC	王义苇 (wangyiwei)	16ms	384 KiB		208 Bytes	2023-3-12 14:14:11
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	436 KiB		220 Bytes	2022-11-5 19:41:52
AC	王义苇 (wangyiwei)	16ms	512 KiB		208 Bytes	2023-3-12 13:56:29
AC	肖钦文 (xiaoqinwen)	16ms	400 KiB		222 Bytes	2022-8-25 11:33:02
AC	伍芷函	16ms	512 KiB		188 Bytes	2022-8-25 19:45:07
AC	徐正旺 (xzw)	16ms	512 KiB		148 Bytes	2022-11-30 18:22:58
AC	周琪渃	16ms	432 KiB		275 Bytes	2022-12-9 20:10:56
AC	爱琴海校区-黄辰浩 (huangchenhao)	16ms	432 KiB		160 Bytes	2023-3-6 20:07:15
AC	许嘉恩 (xje22031)	16ms	512 KiB		212 Bytes	2022-12-1 18:00:04