整理药名

状态	递交者	时间	内存	语言	代码	递交时间
AC	李书翰 (lishuhan)	17ms	8.2 MiB		357 Bytes	2022-2-10 13:31:56
AC	周琪渃	17ms	8.2 MiB		395 Bytes	2023-3-9 17:09:53
AC	luosifu22006	17ms	8.2 MiB		321 Bytes	2022-8-19 17:57:22
AC	_PXY_	17ms	8.2 MiB		380 Bytes	2022-1-23 8:29:48
AC	金沙校区-康瀚文 (开朗的康)	17ms	7 MiB		374 Bytes	2023-12-6 20:15:47
AC	SYC0226	17ms	8.2 MiB		452 Bytes	2022-4-10 10:45:48
AC	张梓辰 (DiaoDesi屌德斯)	17ms	8.2 MiB		386 Bytes	2022-9-13 20:14:28
AC	枉哲锐	17ms	8.2 MiB		318 Bytes	2022-1-26 20:09:37
AC	甄一阳 (22016-zyy)	17ms	8.2 MiB		400 Bytes	2022-11-24 16:49:37
AC	chenyifei	17ms	8.2 MiB		462 Bytes	2022-6-12 15:28:40
AC	zhuziyu	17ms	8.2 MiB		366 Bytes	2022-2-19 9:33:22
AC	朱泽晟	18ms	8.2 MiB		362 Bytes	2022-8-25 18:54:13
AC	lch (凌昌瀚)	18ms	8.2 MiB		410 Bytes	2023-2-1 16:42:24
AC	huyinuo	18ms	8.2 MiB		462 Bytes	2022-6-5 19:13:50
AC	https://www.minecraft.net/zh-hans (王振西)	18ms	8.2 MiB		359 Bytes	2023-6-18 22:13:46
AC	肖添宇	18ms	8.2 MiB		294 Bytes	2022-6-5 17:59:43
AC	缥 (王硕2012)	18ms	8.2 MiB		383 Bytes	2023-3-5 19:35:14
AC	zcx	18ms	8.2 MiB		387 Bytes	2022-12-31 11:13:08
AC	嘉宝 (王淳恺)	18ms	8.2 MiB		465 Bytes	2023-7-7 13:36:26
AC	李树崑 (lishukun)	18ms	8.2 MiB		321 Bytes	2022-8-16 12:08:54
AC	zzl	18ms	8.2 MiB		427 Bytes	2022-12-29 18:19:38
AC	朱老师 (zyp)	18ms	8.2 MiB		326 Bytes	2022-8-16 17:31:11
AC	RanHao	18ms	8.2 MiB		585 Bytes	2023-8-2 10:09:48
AC	zlx (xiao)	18ms	8.2 MiB		562 Bytes	2022-5-29 18:39:15
AC	scallway	18ms	8.2 MiB		379 Bytes	2023-4-14 16:53:06
AC	colin1112 (墙凌可)	18ms	8.2 MiB		568 Bytes	2023-1-22 14:06:41
AC	zhangzhimo	18ms	8.2 MiB		416 Bytes	2022-12-3 16:02:22
AC	wuqilin	18ms	8.2 MiB		475 Bytes	2023-2-1 18:42:10
AC	ycy	18ms	8.2 MiB		403 Bytes	2022-10-2 13:10:41
AC	scallway	18ms	8.2 MiB		374 Bytes	2023-4-14 16:51:35
AC	李林峰 (金克拉)	18ms	8.2 MiB		408 Bytes	2022-9-13 20:10:35
AC	scallway	18ms	8.2 MiB		398 Bytes	2023-4-14 16:53:55
AC	赵沛喆	18ms	8.2 MiB		392 Bytes	2022-10-23 11:03:31
AC	ttt123	18ms	8.2 MiB		534 Bytes	2022-12-31 11:12:51
AC	scallway	18ms	8.2 MiB		379 Bytes	2023-4-14 16:53:26
AC	周琪渃	18ms	8.2 MiB		330 Bytes	2023-3-9 17:13:24
AC	LUKHE (LukeHu)	18ms	8.2 MiB		947 Bytes	2022-2-20 13:48:28
AC	林靖明	18ms	8.2 MiB		399 Bytes	2023-1-31 20:12:41
AC	周琪渃	18ms	8.2 MiB		326 Bytes	2023-3-9 17:12:50
AC	11451254188 (22029-mjh)	18ms	8.2 MiB		410 Bytes	2022-12-31 11:13:21
AC	时代二校-焦雨齐 (Angel)	18ms	7 MiB		291 Bytes	2023-11-11 16:48:23
AC	肖添宇	18ms	8.2 MiB		313 Bytes	2022-4-16 20:14:03
AC	刘锦航	18ms	8.2 MiB		475 Bytes	2022-6-8 19:12:11
AC	余彦瑞	18ms	8.2 MiB		349 Bytes	2023-1-31 11:32:13
AC	庹仕杰	18ms	8.2 MiB		466 Bytes	2023-5-13 17:12:18
AC	XYZ303	18ms	8.2 MiB		441 Bytes	2022-5-29 20:24:31
AC	徐子恩 (Cow)	18ms	8.2 MiB		495 Bytes	2022-5-29 20:59:28
AC	缥 (王硕2012)	18ms	8.2 MiB		407 Bytes	2023-3-5 19:37:34
AC	时代一校林星宇 (lxy)	18ms	8.2 MiB		423 Bytes	2023-2-8 21:21:39
AC	暗蛆突围 (lzh)	18ms	7 MiB		403 Bytes	2023-12-4 15:07:02
AC	德意志第三帝国 (陈远桥)	18ms	8.2 MiB		495 Bytes	2022-6-12 12:06:55
AC	17779	18ms	8.2 MiB		441 Bytes	2022-4-24 15:29:01
AC	yanxiaosong	18ms	8.2 MiB		724 Bytes	2022-7-2 15:30:52
AC	李倾城的忠实假粉 (向熠可)	18ms	8.2 MiB		389 Bytes	2022-3-27 14:37:24
AC	周琪渃	19ms	8.2 MiB		343 Bytes	2023-3-9 17:12:39
AC	1396013295	19ms	8.2 MiB		568 Bytes	2022-1-27 18:33:27
AC	时代一校-曾科智 (曾科智)	19ms	8.2 MiB		442 Bytes	2023-3-4 19:01:23
AC	原著校区巫映秋 (巫映秋1a)	19ms	8.2 MiB		292 Bytes	2023-5-21 18:25:49
AC	Tender. (05c05-zhou)	19ms	8.2 MiB		357 Bytes	2022-10-19 21:57:17
AC	胡宸华 (huchenhua)	19ms	8.2 MiB		585 Bytes	2023-8-20 22:35:58
AC	谭懿轩 (yanyixuan)	19ms	8.2 MiB		343 Bytes	2022-8-24 15:21:32
AC	zhangxinchen	19ms	8.2 MiB		774 Bytes	2022-7-2 15:33:50
AC	scallway	19ms	8.2 MiB		383 Bytes	2023-4-14 16:48:04
AC	时代校区-刘臣原 (微笑王子)	19ms	8.2 MiB		336 Bytes	2022-9-10 20:40:55
AC	22029-lyh	19ms	8.2 MiB		455 Bytes	2022-12-31 11:12:00
AC	陈杰晟	19ms	8.2 MiB		335 Bytes	2022-2-22 13:20:38
AC	时代一校-赵彦博 (zyb)	19ms	8.2 MiB		411 Bytes	2023-2-7 14:05:31
AC	luoluonuoya	19ms	8.2 MiB		415 Bytes	2022-8-18 14:24:40
AC	时代一校蒋帛希 (13983392730)	19ms	8.2 MiB		285 Bytes	2023-3-10 19:46:20
AC	22029-lsl	20ms	8.2 MiB		393 Bytes	2022-12-31 11:14:39
AC	时代2校+涂彦迪 (tuyandi)	20ms	7 MiB		293 Bytes	2023-11-11 16:51:49
AC	黄立信	20ms	6.9 MiB		445 Bytes	2023-11-27 20:54:12
AC	时代二校-陈天成 (鸭缩毛巾)	20ms	7 MiB		313 Bytes	2023-11-11 16:38:32
AC	Randy Marsh (杨子腾)	20ms	8.2 MiB		649 Bytes	2022-6-12 12:04:54
AC	xiangsiyu	20ms	8.2 MiB		467 Bytes	2022-8-11 10:41: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)	22ms	8.2 MiB		493 Bytes	2022-12-31 11:35:39
AC	时代二校+王吕棪 (wanglvyan)	23ms	7 MiB		326 Bytes	2023-11-11 16:56:19
AC	zyl	35ms	7.1 MiB		548 Bytes	2024-1-7 11:00:39
AC	易锦程 (sky)	39ms	7.2 MiB		375 Bytes	2024-1-17 16:06:38
AC	许律天	65ms	544 KiB		349 Bytes	2024-3-2 3:25:13
AC	李彦臻	66ms	536 KiB		300 Bytes	2024-3-13 19:11:31
AC	CK (李弘毅)	67ms	532 KiB		407 Bytes	2024-4-7 17:12:12
AC	heyuzhe	68ms	548 KiB	C++98	323 Bytes	2024-11-14 18:28:08
AC	吴子逸	68ms	532 KiB	C++98	326 Bytes	2024-10-26 12:46:04
AC	新壹街+黄路+江宇轩 (江宇轩)	68ms	540 KiB		312 Bytes	2024-4-12 20:26:19
AC	阮 (媚狐不吃道旁李)	69ms	544 KiB		336 Bytes	2024-3-9 15:09:51
AC	zyp (wangjunling23010)	70ms	768 KiB	C++11	355 Bytes	2024-11-21 19:30:07
AC	赵奕铭	70ms	536 KiB		459 Bytes	2024-3-6 21:34:12
AC	张恕	71ms	532 KiB	C++11	388 Bytes	2024-8-31 15:36:46
AC	何煜琦	71ms	536 KiB	C++11	342 Bytes	2024-10-29 21:25:11
AC	郑隽霖	73ms	556 KiB	C++17	361 Bytes	2024-9-3 10:55:58
AC	胡澜之 (666hlz666)	74ms	764 KiB		413 Bytes	2024-3-5 19:31:35
AC	可爱酱 (张可忻)	126ms	9.4 MiB	Python 3	156 Bytes	2024-8-9 17:47:47
AC	kongql	184ms	9.1 MiB	Python 3	407 Bytes	2023-7-23 15:26:17
AC	Corinna	193ms	9.1 MiB	Python 2	131 Bytes	2023-6-9 21:42:29
AC	cola	193ms	9.1 MiB	Python 3	313 Bytes	2022-12-23 15:05:05
AC	Marvin	196ms	9.1 MiB	Python 3	115 Bytes	2023-6-22 10:52:29
AC	梨冻亿 (wiueh)	204ms	9.1 MiB	Python 3	129 Bytes	2022-1-23 18:48:39
AC	汪致卉 (wangzh)	209ms	9 MiB	Python 3	121 Bytes	2022-4-22 16:30:27
AC	wzzjnb2012	210ms	9.1 MiB	Python 3	260 Bytes	2023-2-9 22:15:38