药房管理

状态	递交者	时间	内存	语言	代码	递交时间
AC	孙烽轶 (sfy)	15ms	384 KiB		210 Bytes	2022-10-15 17:28:59
AC	wangzihang	15ms	7.1 MiB		236 Bytes	2023-11-11 16:16:44
AC	陈家齐 (陈家齐1)	15ms	440 KiB		263 Bytes	2023-4-8 17:35:28
AC	谭懿轩 (yanyixuan)	15ms	512 KiB		188 Bytes	2022-3-18 15:00:30
AC	没有此人 (akm)	15ms	440 KiB		307 Bytes	2023-3-16 21:23:36
AC	无尽的想象 (谭仕高)	15ms	436 KiB		188 Bytes	2023-2-22 16:10:37
AC	pandap&a王皓宸 (WANGHAOCHEN)	15ms	384 KiB		329 Bytes	2023-2-25 11:34:00
AC	赵启程 (赵启程1)	15ms	384 KiB		255 Bytes	2023-4-1 20:27:07
AC	马渝杭 (mayuhang)	15ms	432 KiB		213 Bytes	2022-11-1 21:31:28
AC	yiqiuyu	15ms	392 KiB		232 Bytes	2023-4-15 19:06:11
AC	wangzihang	15ms	512 KiB		323 Bytes	2023-4-1 18:10:04
AC	laiyouming22031	15ms	440 KiB		193 Bytes	2022-11-27 13:24:34
AC	wangjun	15ms	6.8 MiB		222 Bytes	2023-11-25 16:11:04
AC	昌文迪 (05c05-cwd2)	15ms	440 KiB		216 Bytes	2022-12-3 11:20:44
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)	15ms	448 KiB		282 Bytes	2022-11-30 19:04:15
AC	22029-hqh	15ms	432 KiB		224 Bytes	2022-11-26 11:22:33
AC	22029-lyh	15ms	384 KiB		268 Bytes	2022-12-3 17:17:03
AC	周琪渃	15ms	6.7 MiB		308 Bytes	2023-9-8 23:42:40
AC	时代2校-程俊燃 (chengjunran)	15ms	6.7 MiB		271 Bytes	2023-8-27 11:05:33
AC	李彭宋代诗人 (ljy123456)	15ms	428 KiB		411 Bytes	2023-3-22 16:08:22
AC	杜是贤 (dushixian)	15ms	440 KiB		227 Bytes	2023-6-1 11:50:25
AC	CK (李弘毅)	16ms	384 KiB		270 Bytes	2022-10-15 17:27:37
AC	ttt123	16ms	512 KiB		268 Bytes	2022-11-30 16:02:05
AC	余彦瑞	16ms	392 KiB		203 Bytes	2022-8-25 12:05:36
AC	任希贤	16ms	512 KiB		189 Bytes	2023-3-7 20:43:41
AC	zlx (xiao)	16ms	440 KiB		304 Bytes	2022-11-26 19:47:15
AC	scallway	16ms	520 KiB		299 Bytes	2022-9-7 15:30:09
AC	soha (武夷岩)	16ms	420 KiB		245 Bytes	2022-10-15 17:25:46
AC	scallway	16ms	440 KiB		296 Bytes	2022-10-14 15:56:14
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	16ms	424 KiB		219 Bytes	2022-9-30 19:50:59
AC	dengduxi	16ms	436 KiB		261 Bytes	2023-1-16 19:34:20
AC	时代二校-王盼兮 (wangpanxi)	16ms	7 MiB		243 Bytes	2023-12-24 11:03:25
AC	肖钦文 (xiaoqinwen)	16ms	392 KiB		217 Bytes	2022-8-25 12:08:41
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	17ms	444 KiB		276 Bytes	2022-12-2 21:45:13
AC	1396013295	17ms	448 KiB		210 Bytes	2023-1-8 11:26:37
AC	11451254188 (22029-mjh)	17ms	512 KiB		299 Bytes	2022-12-1 13:32:41
AC	朱老师 (zyp)	17ms	444 KiB		244 Bytes	2022-7-23 9:55:29
AC	灵光sans (wangchihao)	17ms	384 KiB		248 Bytes	2022-10-15 17:29:23
AC	黄梓轩 (huangzixuan)	17ms	384 KiB		270 Bytes	2022-10-15 17:29:42
AC	RanHao	18ms	6.9 MiB		361 Bytes	2023-8-8 15:45:03
AC	许嘉恩 (xje22031)	18ms	440 KiB		206 Bytes	2022-12-1 18:20:49
AC	zhm123	19ms	512 KiB		291 Bytes	2022-11-11 16:27:08
AC	新壹街朱启航 (zhuqihang)	20ms	7.1 MiB		225 Bytes	2024-1-23 8:38:19
AC	霍弈丞小号	20ms	384 KiB		272 Bytes	2022-8-25 11:50:45
AC	scallway1	20ms	440 KiB		249 Bytes	2022-10-15 17:23:36
AC	伍芷函	20ms	384 KiB		222 Bytes	2022-8-25 12:10:13
AC	zyl	22ms	7.3 MiB		198 Bytes	2024-1-6 10:47:01
AC	高彬月	22ms	7 MiB		199 Bytes	2023-11-10 20:43:29
AC	我推的乱破 (贺俊楠)	23ms	7.3 MiB		330 Bytes	2023-12-31 15:36:37
AC	在煎鱼的肖大总铳 (肖宇航)	25ms	7.1 MiB		270 Bytes	2023-12-24 11:08:33
AC	刘老师 (图书管理员)	26ms	408 KiB		275 Bytes	2022-8-25 12:06:03
AC	邵冠铖 (shaoguancheng22031)	35ms	448 KiB		210 Bytes	2022-11-28 20:32:36
AC	黄立信	35ms	7 MiB		370 Bytes	2024-1-10 21:35:34
AC	新壹街校区-冉睦阳 (冉睦阳)	60ms	548 KiB	C++98	262 Bytes	2024-9-24 18:19:30
AC	张梓浩 (zhangzihao)	64ms	764 KiB		344 Bytes	2024-3-24 10:48:42
AC	时代二校+马嘉宸 (majiachen)	64ms	540 KiB		201 Bytes	2024-3-24 9:54:50
AC	张智洋	67ms	756 KiB		244 Bytes	2024-3-16 16:56:20
AC	牟淳雅	68ms	532 KiB	C++98	233 Bytes	2024-9-15 9:08:14
AC	爱琴海校区-穆宏斌 (穆宏斌)	68ms	552 KiB	C++20(O2)	273 Bytes	2024-9-28 10:49:09
AC	Mr_D	68ms	532 KiB	C++17	298 Bytes	2024-9-9 15:59:44
AC	陌生人 (涂玉龙)	69ms	544 KiB		211 Bytes	2024-3-17 15:23:44
AC	Him (李俊熙)	70ms	768 KiB	C++98	248 Bytes	2024-10-26 16:13:22
AC	weixingyu	70ms	548 KiB	C++11	264 Bytes	2024-10-1 9:47:44
AC	yuchenyi23017	70ms	552 KiB		243 Bytes	2024-1-28 15:40:26
AC	崔欧辰	71ms	764 KiB	C++11	298 Bytes	2024-9-9 16:21:34
AC	zvt_132 (任子轩)	71ms	764 KiB	C++98	222 Bytes	2024-10-13 11:15:04
AC	cainuoyan	73ms	776 KiB	C++98	232 Bytes	2024-10-16 20:08:20
AC	刘老师 (图书管理员)	217ms	3.9 MiB	Python 3	282 Bytes	2022-4-26 18:48:21