希蒙和鸡兔同笼

状态	递交者	时间	内存	语言	代码	递交时间
AC	wangtan	12ms	384 KiB		151 Bytes	2023-5-9 14:43:21
AC	wangtan	12ms	384 KiB		151 Bytes	2023-5-9 14:43:27
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:20
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:29
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:45:25
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:05
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:28
AC	wangtan	13ms	388 KiB		151 Bytes	2023-5-9 14:43:22
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:20
AC	wangtan	13ms	408 KiB		151 Bytes	2023-5-9 14:43:21
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:03
AC	wangtan	13ms	392 KiB		151 Bytes	2023-5-9 14:43:26
AC	wangtan	13ms	392 KiB		151 Bytes	2023-5-9 14:43:32
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:25
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:06
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	13ms	6.7 MiB	C++98	168 Bytes	2024-8-1 22:51:46
AC	wangtan	13ms	384 KiB		151 Bytes	2023-5-9 14:43:33
AC	时代二校-焦雨齐 (Angel)	13ms	6.6 MiB	C++11	208 Bytes	2024-7-17 11:33:36
AC	wangtan	14ms	384 KiB		151 Bytes	2023-5-9 14:45:02
AC	wangtan	14ms	392 KiB		151 Bytes	2023-5-9 14:43:31
AC	wangtan	14ms	392 KiB		151 Bytes	2023-5-9 14:43:21
AC	wangtan	14ms	384 KiB		151 Bytes	2023-5-9 14:43:23
AC	wangtan	14ms	384 KiB		151 Bytes	2023-5-9 14:43:24
AC	wangtan	14ms	388 KiB		151 Bytes	2023-5-9 14:33:00
AC	wangtan	14ms	392 KiB		151 Bytes	2023-5-9 14:43:27
AC	wangtan	14ms	384 KiB		151 Bytes	2023-5-9 14:43:26
AC	wangtan	14ms	512 KiB		151 Bytes	2023-5-9 14:45:14
AC	wangtan	14ms	384 KiB		151 Bytes	2023-5-9 14:43:24
AC	wangtan	14ms	392 KiB		151 Bytes	2023-5-9 14:43:24
AC	wangtan	14ms	384 KiB		151 Bytes	2023-5-9 14:43:25
AC	wangtan	15ms	508 KiB		151 Bytes	2023-5-9 14:43:30
AC	星野光 (Hoshino Hikari)	15ms	6.8 MiB		285 Bytes	2023-10-22 21:47:37
AC	wangtan	15ms	408 KiB		151 Bytes	2023-5-9 14:45:17
AC	wangtan	15ms	384 KiB		151 Bytes	2023-5-9 14:43:07
AC	朱老师 (zyp)	15ms	7.4 MiB		178 Bytes	2023-7-12 17:17:57
AC	wangtan	15ms	384 KiB		151 Bytes	2023-5-9 14:43:23
AC	wangtan	15ms	392 KiB		151 Bytes	2023-5-9 14:43:25
AC	爱琴海校区-刁钲洋 (刁钲洋)	16ms	6.7 MiB		220 Bytes	2023-6-5 20:34:18
AC	Alduin	16ms	396 KiB		180 Bytes	2023-1-7 14:47:57
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	6.8 MiB		218 Bytes	2023-6-24 12:08:43
AC	wangtan	17ms	392 KiB		151 Bytes	2023-5-9 14:43:30
AC	赵毕岑	18ms	8.1 MiB		164 Bytes	2023-7-7 18:35:00