希蒙的捕鱼计划-2

状态	递交者	时间	内存	语言	代码	递交时间
AC	芒苒忧 (廖迦南)	42ms	8.1 MiB		307 Bytes	2022-4-3 16:01:42
AC	zlx (xiao)	43ms	8.1 MiB		328 Bytes	2022-11-26 20:09:37
AC	jdy	43ms	8.1 MiB		561 Bytes	2022-8-18 13:28:18
AC	赵沛喆	44ms	8.1 MiB		333 Bytes	2022-11-20 9:51:30
AC	汪致卉 (wangzh)	44ms	8.1 MiB		408 Bytes	2022-2-18 18:47:56
AC	1396013295	45ms	8.1 MiB		395 Bytes	2022-1-23 19:18:05
AC	王晨志 (wangchenzhi)	46ms	8.1 MiB		522 Bytes	2022-2-6 17:30:14
AC	x0l0x	61ms	7.3 MiB		332 Bytes	2024-1-2 20:33:06
AC	朱老师 (zyp)	88ms	7.9 MiB		319 Bytes	2023-5-18 18:14:17
AC	xiangsiyu	89ms	8.1 MiB		314 Bytes	2022-7-12 10:37:35
AC	RanHao	90ms	6.7 MiB		268 Bytes	2023-9-5 17:23:16
AC	Guest	90ms	6.9 MiB	C++98(O2)	387 Bytes	2024-5-25 20:59:25
AC	GYZ	90ms	8.1 MiB		560 Bytes	2022-5-26 13:12:03
AC	杨坤霖 (steven)	92ms	6.7 MiB		316 Bytes	2023-8-31 14:31:06
AC	tongxiao	93ms	7.2 MiB	C++20(O2)	385 Bytes	2024-5-5 18:09:00
AC	luoluonuoya	93ms	8.1 MiB		281 Bytes	2022-8-22 15:05:11
AC	陈杰晟	93ms	8.1 MiB		395 Bytes	2022-2-13 13:52:58
AC	新壹街校区-付宇轩 (fyx)	93ms	7.3 MiB		356 Bytes	2023-7-28 15:10:19
AC	zzzrrrxxx	93ms	7 MiB	C++98	361 Bytes	2024-8-24 13:59:25
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	93ms	8.1 MiB		576 Bytes	2022-2-14 11:49:27
AC	huanglu	93ms	7.8 MiB		514 Bytes	2023-6-2 10:09:16
AC	李倾城的忠实假粉 (向熠可)	93ms	8.1 MiB		262 Bytes	2022-3-29 21:24:55
AC	(张洛诚)	94ms	7.7 MiB		334 Bytes	2023-6-15 19:20:47
AC	关博源	94ms	8.1 MiB		293 Bytes	2023-2-18 11:20:13
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)	94ms	7.2 MiB		355 Bytes	2023-8-12 13:57:22
AC	文硕 (文硕1)	94ms	8.1 MiB		252 Bytes	2022-12-10 17:37:55
AC	LUKHE (LukeHu)	94ms	8.1 MiB		284 Bytes	2022-4-16 16:28:03
AC	Tender. (05c05-zhou)	94ms	7.8 MiB		287 Bytes	2023-5-21 16:20:08
AC	姚宏逸	95ms	8.1 MiB		299 Bytes	2022-5-30 16:37:00
AC	leisixian (22029-lyh)	95ms	7.3 MiB		247 Bytes	2023-7-10 14:35:32
AC	纪承熙 (jcx001)	95ms	6.9 MiB		333 Bytes	2023-11-4 15:25:41
AC	火爆肥肠（杨弘毅） (火爆肥肠)	95ms	8.1 MiB		343 Bytes	2022-5-20 22:51:13
AC	qinyi	96ms	8.1 MiB		287 Bytes	2022-2-13 13:52:42
AC	时代一校 - 冯隆浩 (冯隆浩)	96ms	8 MiB		263 Bytes	2023-4-11 21:09:39
AC	文硕 (文硕1)	96ms	8.1 MiB		252 Bytes	2022-12-10 17:37:39
AC	CPL	96ms	8.1 MiB		264 Bytes	2022-5-20 20:12:01
AC	李哲 (lizhe)	97ms	6.7 MiB		309 Bytes	2023-8-23 14:23:17
AC	zhm123	97ms	8.1 MiB		308 Bytes	2023-1-3 15:46:30
AC	黄梓轩 (huangzixuan)	99ms	7.2 MiB		313 Bytes	2023-9-3 15:52:43
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	99ms	8.1 MiB		576 Bytes	2022-2-14 11:49:24
AC	牟淳雅	100ms	6.9 MiB		383 Bytes	2023-9-24 11:43:59
AC	执剑人罗辑 (Jasson)	100ms	6.7 MiB		322 Bytes	2023-9-2 19:50:14
AC	朱老师 (zyp)	101ms	7.8 MiB		277 Bytes	2023-5-23 20:05:54
AC	没有此人 (akm)	101ms	6.9 MiB		412 Bytes	2023-9-16 14:18:16
AC	小土豆 (liuzirui2)	102ms	6.7 MiB		274 Bytes	2023-9-30 14:13:43
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	102ms	7.9 MiB		288 Bytes	2023-4-29 19:12:27
AC	于宝泽 (于谋泽)	102ms	8.1 MiB		370 Bytes	2022-4-1 17:48:50
AC	陈雨泽1	104ms	7.7 MiB		380 Bytes	2023-6-28 9:34:36
AC	经常消失 (小萝卜)	104ms	8.1 MiB		287 Bytes	2022-5-14 13:29:44
AC	_PXY_	105ms	8.1 MiB		393 Bytes	2022-1-26 14:02:46
AC	MoonLight ( aaa)	105ms	8.1 MiB		294 Bytes	2022-1-25 12:35:39
AC	wangruibo20xh	105ms	8.1 MiB		213 Bytes	2022-2-11 19:40:28
AC	zhangyh (张育菡)	110ms	8.1 MiB		367 Bytes	2022-11-8 22:28:43
AC	时代一校-赵彦博 (zyb)	110ms	6.8 MiB		531 Bytes	2023-10-5 19:54:42
AC	林凡童 (lft)	130ms	22.9 MiB		263 Bytes	2023-7-19 10:50:53
AC	胡宸华 (huchenhua)	136ms	22.8 MiB		287 Bytes	2023-7-19 10:48:59
AC	新壹街校区-陈琬舒 (空空大师)	166ms	6.9 MiB		464 Bytes	2023-12-2 11:21:41
AC	周浩楠 (开朗的周好难)	180ms	7.4 MiB		480 Bytes	2023-12-30 11:16:15
AC	时代二校-王盼兮 (wangpanxi)	224ms	1 MiB		266 Bytes	2024-3-9 16:06:23
AC	Jose (反恐皮蛋)	225ms	804 KiB		554 Bytes	2024-3-2 18:00:31
AC	时代2校-程俊燃 (chengjunran)	227ms	852 KiB		273 Bytes	2024-3-2 18:18:47
AC	赵奕铭	229ms	816 KiB		290 Bytes	2024-3-10 17:48:07
AC	新壹街朱启航 (zhuqihang)	231ms	716 KiB		386 Bytes	2024-3-10 9:21:39
AC	My name is Man (钟卓劭)	233ms	808 KiB		275 Bytes	2024-4-4 15:20:29
AC	zyl	236ms	788 KiB		433 Bytes	2024-3-2 16:58:11
AC	新壹街校区-冉睦阳 (冉睦阳)	238ms	764 KiB		412 Bytes	2024-3-10 10:21:07
AC	不怎么聪明的家伙 (贺俊楠)	239ms	768 KiB		419 Bytes	2024-3-3 10:59:39
AC	弹射起飞 ? 冲 ! (吴周周)	239ms	696 KiB		347 Bytes	2024-3-2 16:15:42
AC	张智洋	240ms	664 KiB		260 Bytes	2024-3-16 16:24:56
AC	zyl	245ms	640 KiB		397 Bytes	2024-2-28 10:26:30
AC	时代二校-焦雨齐 (Angel)	251ms	832 KiB		255 Bytes	2024-3-5 19:34:32
AC	猫不理包子	252ms	13.1 MiB	Python 3	175 Bytes	2023-8-3 9:50:36
AC	梨冻亿 (wiueh)	265ms	14.7 MiB	Python 3	182 Bytes	2022-1-23 20:15:33
AC	江泽栋	267ms	804 KiB	C++11	415 Bytes	2024-9-8 12:12:03
AC	新壹街—熊轩杭 (xiongxuanhang)	285ms	1.6 MiB		547 Bytes	2024-3-16 16:17:31
AC	Billy52013 (李子轩)	291ms	1 MiB		430 Bytes	2024-3-9 20:13:42