疯狂生长的贪吃蛇

状态	递交者	时间	内存	代码	递交时间
AC	wangjun	10ms	6.7 MiB	469 Bytes	2023-11-15 14:07:18
AC	zyl	11ms	7.1 MiB	404 Bytes	2024-1-23 14:57:08
AC	陈杰晟	15ms	408 KiB	379 Bytes	2022-7-21 8:52:33
AC	漆星语 (qixingyu)	15ms	7.2 MiB	393 Bytes	2023-10-14 11:24:48
AC	22016-yzq	15ms	384 KiB	393 Bytes	2023-4-9 9:42:44
AC	唐良瑞 (22016-tlr01)	15ms	384 KiB	424 Bytes	2023-4-9 9:42:02
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	384 KiB	344 Bytes	2023-5-18 22:01:23
AC	喻文博 (22016-ywb)	15ms	512 KiB	389 Bytes	2023-4-9 9:41:42
AC	王浚西 (22016-wjx)	15ms	384 KiB	380 Bytes	2023-4-9 9:44:25
AC	ttt123	16ms	384 KiB	489 Bytes	2023-4-9 9:40:13
AC	章愉霖	16ms	384 KiB	349 Bytes	2023-5-14 17:52:47
AC	22016-lyj	16ms	392 KiB	384 Bytes	2023-4-9 9:43:24
AC	龙思颖 (lsy)	16ms	7 MiB	338 Bytes	2023-10-14 11:14:00
AC	林昱霏	16ms	7.4 MiB	303 Bytes	2023-10-14 11:25:42
AC	22029-zjs	16ms	440 KiB	365 Bytes	2023-4-8 11:51:08
AC	霍弈丞小号	16ms	384 KiB	460 Bytes	2023-2-19 17:52:16
AC	13808364288	16ms	384 KiB	389 Bytes	2023-2-25 19:16:18
AC	三差学生(尘埃蓝莓) (白佳睿)	16ms	7.1 MiB	396 Bytes	2023-10-14 11:21:02
AC	朱老师 (zyp)	16ms	444 KiB	376 Bytes	2023-5-18 16:30:50
AC	王子昕(scallway)	16ms	7.1 MiB	334 Bytes	2024-1-23 15:02:33
AC	小翔的粉丝	16ms	6.9 MiB	348 Bytes	2023-10-14 11:15:15
AC	原著校区巫映秋 (巫映秋1a)	16ms	384 KiB	361 Bytes	2023-5-14 18:06:40
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)	16ms	392 KiB	443 Bytes	2023-4-8 12:16:56
AC	俞伏羲	16ms	7 MiB	287 Bytes	2023-10-14 11:19:37
AC	甄一阳 (22016-zyy)	16ms	432 KiB	362 Bytes	2023-4-9 9:27:24
AC	maobohan	16ms	6.9 MiB	331 Bytes	2023-10-14 11:17:19
AC	无尽的想象 (谭仕高)	17ms	512 KiB	603 Bytes	2023-2-22 17:07:44
AC	张梓浩 (zhangzihao)	17ms	6.9 MiB	331 Bytes	2023-10-14 11:16:12
AC	余彦瑞	17ms	512 KiB	354 Bytes	2023-2-26 12:05:03
AC	AC[谭赫奕] (tanheyi)	17ms	7 MiB	369 Bytes	2023-10-14 11:14:09
AC	22029-lsl	17ms	384 KiB	404 Bytes	2023-4-8 11:51:12
AC	乐瀚阳 (yuehanyang)	17ms	6.9 MiB	287 Bytes	2023-8-19 15:52:02
AC	城市之光1	17ms	7.5 MiB	339 Bytes	2023-10-14 11:29:22
AC	时代1校-杨宇轩 (杨宇轩)	17ms	6.9 MiB	325 Bytes	2023-10-14 11:18:20
AC	殷语函	17ms	7.1 MiB	403 Bytes	2023-10-14 11:22:14
AC	11451254188 (22029-mjh)	17ms	436 KiB	382 Bytes	2023-4-8 11:51:09
AC	煞笔笔	17ms	6.8 MiB	311 Bytes	2023-9-28 20:02:03
AC	22016-lyj	17ms	512 KiB	378 Bytes	2023-4-9 14:02:55
AC	ttt123	17ms	512 KiB	402 Bytes	2023-3-31 17:00:13
AC	何昊宇 (22016-hhy)	17ms	432 KiB	379 Bytes	2023-4-9 9:40:18
AC	时代一校-赵彦博 (zyb)	17ms	6.7 MiB	283 Bytes	2023-8-25 16:34:26
AC	zcx	18ms	392 KiB	381 Bytes	2023-4-8 11:51:20
AC	爱琴海校区-刁钲洋 (刁钲洋)	19ms	7.3 MiB	474 Bytes	2023-7-4 10:51:23
AC	scallway	19ms	6.9 MiB	358 Bytes	2023-8-19 15:38:02
AC	zzl	19ms	440 KiB	311 Bytes	2023-2-24 15:28:44
AC	SYH.邵允涵 (Zoe邵)	19ms	6.6 MiB	352 Bytes	2023-3-17 21:43:40
AC	乐瀚阳 (yuehanyang)	19ms	6.7 MiB	287 Bytes	2023-8-21 19:04:08
AC	乐瀚阳 (yuehanyang)	20ms	6.9 MiB	287 Bytes	2023-8-23 19:46:21
AC	乐瀚阳 (yuehanyang)	22ms	6.9 MiB	283 Bytes	2023-8-23 19:49:15
AC	姚宏逸	24ms	7 MiB	364 Bytes	2023-12-3 9:32:08