炸鸡窗口

状态	递交者	时间	内存	语言	代码	递交时间
AC	姚宏逸	146ms	6.2 MiB		491 Bytes	2022-7-4 11:37:14
AC	chen (peter)	149ms	6.1 MiB		465 Bytes	2022-11-27 9:18:04
AC	刘老师 (图书管理员)	173ms	440 KiB		450 Bytes	2022-7-2 18:28:29
AC	CK (李弘毅)	433ms	7 MiB	C++11(O2)	317 Bytes	2024-6-2 13:07:40
AC	CK (李弘毅)	475ms	7 MiB	C++11(O2)	316 Bytes	2024-6-2 13:04:59
AC	新壹街——陈学彬 (BUG)	604ms	6.9 MiB		254 Bytes	2023-6-30 11:33:37
AC	疯神芭芭脱丝 (李卓修)	637ms	6.1 MiB		372 Bytes	2022-7-14 19:03:47
AC	新壹街——陈学彬 (BUG)	664ms	6.9 MiB		258 Bytes	2023-6-30 11:33:05
AC	赵泳鑫 (zhaoyongxin)	670ms	4.9 MiB		399 Bytes	2022-7-15 14:49:08
AC	刘老师 (图书管理员)	767ms	4.2 MiB		262 Bytes	2022-7-2 18:28:48
AC	樊竣熠 (lft1114)	778ms	6.2 MiB		372 Bytes	2022-8-25 12:02:26
AC	不怎么聪明的家伙 (贺俊楠)	947ms	11.3 MiB	C++98(O2)	215 Bytes	2024-6-30 11:25:01
AC	李彦臻	958ms	6.8 MiB	C++98	221 Bytes	2024-6-30 9:43:05
AC	新壹街校区-陈琬舒 (空空大师)	1085ms	7.5 MiB	C++98	226 Bytes	2024-6-30 10:59:30
AC	CK (李弘毅)	1156ms	7 MiB	C++11(O2)	264 Bytes	2024-6-2 13:04:08
AC	刘老师 (图书管理员)	1257ms	4.1 MiB		280 Bytes	2022-7-2 18:22:18
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)	1319ms	11 MiB		278 Bytes	2023-6-11 10:10:04
AC	Randy Marsh (杨子腾)	1324ms	6.1 MiB		281 Bytes	2022-7-19 15:07:42
AC	你猜我是谁 (king)	1370ms	7.2 MiB		328 Bytes	2023-6-30 17:51:29
AC	爱琴海校区-刁钲洋 (刁钲洋)	1375ms	7.2 MiB		373 Bytes	2023-7-26 19:39:15
AC	杜俊宏	1390ms	6.1 MiB		242 Bytes	2022-8-9 9:55:10
AC	NJL (NJlL)	1393ms	6.1 MiB		274 Bytes	2022-7-6 14:10:42
AC	刘老师 (图书管理员)	1411ms	4.2 MiB		280 Bytes	2022-7-2 18:28:20
AC	旷山 (15213268688)	1467ms	7.2 MiB		262 Bytes	2023-6-30 17:52:26
AC	tongxiao	1874ms	4.2 MiB		263 Bytes	2024-3-12 18:58:34
AC	弹射起飞 ? 冲 ! (吴周周)	2627ms	11 MiB		303 Bytes	2024-1-22 16:31:12
AC	Jack	2696ms	11 MiB		317 Bytes	2024-1-18 12:11:49
AC	时代2校+施皓宬 (shihaocheng)	2700ms	7.3 MiB		228 Bytes	2024-1-22 16:32:28
AC	chenkerun	2753ms	11 MiB		328 Bytes	2024-1-18 10:05:47
AC	时代2校-程俊燃 (chengjunran)	2869ms	4.1 MiB		267 Bytes	2024-1-31 16:27:23
AC	张智洋	2966ms	6.2 MiB		222 Bytes	2024-3-16 16:28:13
AC	ReFly (NKZKY)	2975ms	8 MiB		290 Bytes	2024-2-2 10:21:11
AC	新壹街校区-冉睦阳 (冉睦阳)	3129ms	10.1 MiB	C++98	372 Bytes	2024-9-12 15:50:33