病人排队

状态	递交者	时间	内存	语言	代码	递交时间
AC	源著校区-老师：刘扬-张博涵 (张博涵)	20ms	8.4 MiB		521 Bytes	2023-8-9 10:46:13
AC	yu (赵子瑜)	20ms	8.2 MiB		815 Bytes	2022-4-17 18:37:39
AC	ttt123	20ms	8.4 MiB		679 Bytes	2023-4-15 11:41:17
AC	yu (赵子瑜)	20ms	8.2 MiB		815 Bytes	2022-4-17 18:37:46
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	20ms	8.3 MiB		941 Bytes	2022-3-12 18:48:10
AC	朱老师 (zyp)	20ms	6.8 MiB		670 Bytes	2023-10-31 19:25:18
AC	凌肯 (lingken22006)	20ms	8.2 MiB		570 Bytes	2022-10-23 18:24:26
AC	zhangheyi22006	20ms	8.2 MiB		499 Bytes	2022-10-23 18:28:54
AC	秦子越 (13883322087)	20ms	8.3 MiB		726 Bytes	2022-3-12 19:03:04
AC	^_^ (ctc)	20ms	8.4 MiB		460 Bytes	2023-6-5 20:28:11
AC	任童(rentong)	20ms	8.2 MiB		601 Bytes	2022-7-2 15:11:36
AC	11451254188 (22029-mjh)	20ms	8.4 MiB		509 Bytes	2023-4-15 11:41:44
AC	荣耀	20ms	6.7 MiB		657 Bytes	2023-8-30 10:17:54
AC	中岛敦 (黄麒瑞)	20ms	7.2 MiB		606 Bytes	2023-9-29 10:11:08
AC	陈佳婧	20ms	8.2 MiB		563 Bytes	2022-9-30 20:55:12
AC	时代二校-焦雨齐 (Angel)	20ms	8.4 MiB		576 Bytes	2023-7-19 13:39:35
AC	杜是贤 (dushixian)	20ms	8.2 MiB		800 Bytes	2022-6-15 20:20:50
AC	朱老师 (zyp)	20ms	8.2 MiB		566 Bytes	2022-10-23 18:16:41
AC	CK (李弘毅)	20ms	8.4 MiB		501 Bytes	2023-3-18 7:54:45
AC	明轩 (吕同学)	20ms	8.2 MiB		559 Bytes	2023-1-10 14:47:51
AC	任童(rentong)	20ms	8.2 MiB		601 Bytes	2022-12-10 10:13:25
AC	毕浩宇 (bihaoyu)	20ms	6.7 MiB		444 Bytes	2023-9-23 17:51:32
AC	jdy	20ms	8.4 MiB		515 Bytes	2023-7-19 17:47:25
AC	朱老师 (zyp)	20ms	8.2 MiB		609 Bytes	2022-9-4 17:26:59
AC	可爱的小花狗	20ms	6.7 MiB		499 Bytes	2023-9-23 18:14:51
AC	soha (武夷岩)	20ms	8.4 MiB		557 Bytes	2023-4-15 16:15:55
AC	鲜榨大肠汁	20ms	8.3 MiB		530 Bytes	2022-4-16 18:26:25
AC	李禹衡 (liyuheng22006)	20ms	8.2 MiB		469 Bytes	2022-10-23 18:17:18
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	20ms	8.3 MiB		941 Bytes	2022-3-12 18:48:10
AC	jdy	20ms	8.2 MiB		515 Bytes	2022-11-12 15:53:37
AC	乐瀚阳 (yuehanyang)	20ms	8.4 MiB		477 Bytes	2023-4-18 21:58:30
AC	AC[谭赫奕] (tanheyi)	20ms	6.8 MiB		579 Bytes	2023-9-9 10:55:03
AC	叶雨昊 (yeyuhao22006)	20ms	8.2 MiB		491 Bytes	2022-10-23 19:05:27
AC	张梓浩 (zhangzihao)	20ms	6.8 MiB		536 Bytes	2023-10-7 22:03:14
AC	22029-lyh	20ms	8.4 MiB		530 Bytes	2023-5-7 8:56:04
AC	唐梓竣	20ms	8.2 MiB		652 Bytes	2023-1-14 11:52:05
AC	https://www.minecraft.net/zh-hans (王振西)	20ms	8.4 MiB		543 Bytes	2023-7-2 15:15:14
AC	Ruler (05c35-hjs)	20ms	8.2 MiB		560 Bytes	2022-5-8 9:19:55
AC	陈杰晟	20ms	8.2 MiB		608 Bytes	2022-4-17 18:34:18
AC	曾御城（现用名） (Jason)	20ms	8.2 MiB		509 Bytes	2022-7-23 20:10:23
AC	zcx	20ms	8.4 MiB		518 Bytes	2023-4-20 19:37:49
AC	刘煜轩	20ms	6.9 MiB		543 Bytes	2023-8-26 16:18:55
AC	zhuqiwei22006	20ms	8.2 MiB		475 Bytes	2022-10-23 18:24:18
AC	司雨来 (siyulai)	20ms	8.2 MiB		651 Bytes	2023-1-8 20:14:51
AC	希蒙 (zhengxingya)	20ms	8.4 MiB		552 Bytes	2023-7-19 13:49:38
AC	11451254188 (22029-mjh)	20ms	8.4 MiB		509 Bytes	2023-4-15 11:41:40
AC	刘政君 (lzj)	21ms	8.2 MiB		680 Bytes	2022-9-30 21:18:27
AC	冒牌陈杰晟【MOD】 (wed)	21ms	8.2 MiB		534 Bytes	2022-4-17 18:42:50
AC	原著校区巫映秋 (巫映秋1a)	21ms	8.4 MiB		512 Bytes	2023-6-4 18:18:57
AC	荣耀	21ms	6.7 MiB		551 Bytes	2023-8-30 10:24:55
AC	新壹街校区-杨轩懿 (杨轩懿1)	21ms	6.7 MiB		504 Bytes	2023-9-10 18:42:51
AC	赵沛喆	21ms	8.2 MiB		420 Bytes	2022-7-24 15:46:10
AC	qinyi	21ms	8.3 MiB		679 Bytes	2022-3-12 18:51:14
AC	时代一校-赵彦博 (zyb)	21ms	6.7 MiB		526 Bytes	2023-8-26 15:36:36
AC	赵鑫宸 (xiaoxiao721)	21ms	8.3 MiB		715 Bytes	2022-3-12 19:03:34
AC	scallway	21ms	8.4 MiB		624 Bytes	2023-3-10 14:15:10
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)	21ms	8.4 MiB		571 Bytes	2023-4-15 11:44:43
AC	lch (凌昌瀚)	21ms	8.2 MiB		563 Bytes	2022-7-7 22:19:21
AC	杨瀚霖 (yanghanlin)	22ms	8.4 MiB		643 Bytes	2023-6-24 10:59:47
AC	我推的乱破 (贺俊楠)	22ms	6.8 MiB		610 Bytes	2023-9-10 11:30:35
AC	伍芷函	22ms	8.2 MiB		437 Bytes	2023-3-5 17:14:48
AC	duanxinghe	22ms	8.2 MiB		493 Bytes	2023-8-21 15:20:50
AC	坤坤荔枝小黑子 (zhonghaotian22006)	22ms	8.2 MiB		608 Bytes	2022-10-23 18:18:02
AC	许炜铭 (xuweiming)	22ms	8.1 MiB		557 Bytes	2023-8-21 15:47:55
AC	Error404sans (焦阳浩云)	23ms	6.9 MiB	C++20(O2)	1.8 KiB	2024-6-11 21:30:25
AC	江科毅 (jky)	23ms	8.3 MiB		585 Bytes	2023-8-21 15:38:08
AC	张玉坚 (zhangyuian)	24ms	8.2 MiB		438 Bytes	2023-3-5 17:15:39
AC	弹射起飞 ? 冲 ! (吴周周)	24ms	6.7 MiB		545 Bytes	2023-9-23 18:02:49
AC	樊竣熠 (lft1114)	28ms	8.3 MiB		696 Bytes	2022-2-27 19:06:46
AC	小忙果 (王昱杰)	29ms	7 MiB		473 Bytes	2023-12-3 14:17:08
AC	霍弈丞小号	29ms	8.2 MiB		411 Bytes	2023-3-5 17:18:05
AC	谢博文	30ms	8.2 MiB		586 Bytes	2022-6-11 9:21:28
AC	_PXY_	31ms	8.3 MiB		639 Bytes	2022-1-22 16:02:01
AC	Tang	32ms	8.2 MiB		886 Bytes	2022-6-4 11:19:37
AC	龚信丞	32ms	8.4 MiB		556 Bytes	2023-5-28 19:30:10
AC	牟淳雅	34ms	7 MiB		523 Bytes	2023-12-31 12:36:32
AC	liujingxing(我要李毛川!) (liujingxing)	34ms	7.1 MiB		665 Bytes	2024-1-24 17:25:41
AC	RanHao	35ms	8.4 MiB		698 Bytes	2023-8-2 11:36:27
AC	My name is Man (钟卓劭)	38ms	8.3 MiB	C++17(O2)	617 Bytes	2024-8-10 19:13:18
AC	dengduxi	40ms	8.4 MiB		461 Bytes	2023-3-19 15:49:47
AC	新壹街校区-陈琬舒 (空空大师)	43ms	7.2 MiB		474 Bytes	2023-9-10 15:50:38
AC	jighghjkfkhfdhdfdfdsfsdfsafvmnkbnkbmnlvnmkbvnvb;,.m;,;.;,;kbvlmkbnlmkblnvkmlbnkmlbvkmlbvklmbkmlkblmbnm;,l.,.;,'.,';.[',;.[,kjkoihgfhfgiohifgohifgohiofgihgofhiofgihofgihofgihofgiho;''[;.',m;.',m.;',.;'m,.;';'cv;x'cb'cx;b'cv;b'xc;b'c;b'cvbvc.'bv.//,/vb./vcb./cvbv,c.b,cv.,b.cv,b.vc,bg;hgl;hgl;hg;h;hfg;hl;lf;l;lxc;cln;bvln;vcln;vnl;vbl;vbln;vlv;blnvb;plnp;lplhfljpjh;nlvb;nv;bn;vcvl;nlv;nlv;g;hjhchl;ghfghl;fghl;ltlh;l;hlf;lg;bnlc;;nlv;nbv;nbv;nvb;nlvcnl;xc;blxcb;ll;hg;lhgl;dfl;t;ldy;l;lyl;rewlt493;l;dl;dsflg;lsdlpbpcxobpocvbpopopopreopotpreotertertretert (litingxu)	43ms	7.3 MiB		614 Bytes	2023-9-20 19:26:45
AC	熊奕博 (Mothefuck)	44ms	8.4 MiB		467 Bytes	2023-3-5 17:53:47
AC	ycy	45ms	8.2 MiB		615 Bytes	2022-12-15 20:27:14
AC	ycy	47ms	8.2 MiB		593 Bytes	2022-12-15 20:24:21
AC	yh1	47ms	8.1 MiB		547 Bytes	2023-8-21 15:43:23
AC	zyl	52ms	7.2 MiB		698 Bytes	2024-1-22 14:40:29
AC	余彦瑞	57ms	9.2 MiB		423 Bytes	2023-3-5 17:14:20
AC	Nico	77ms	764 KiB		546 Bytes	2024-1-25 11:26:47
AC	yanyuhan	80ms	568 KiB		555 Bytes	2024-3-16 11:03:58
AC	新壹街-康哲朗 (康哲朗)	81ms	764 KiB		542 Bytes	2024-1-27 15:33:18
AC	pig (hezhihui)	82ms	576 KiB		621 Bytes	2024-3-14 16:45:16
AC	ReFly (NKZKY)	83ms	576 KiB		605 Bytes	2024-2-1 17:06:55
AC	lby_joey	84ms	764 KiB	C++98(O2)	513 Bytes	2024-11-2 12:55:32
AC	孙熠晨	84ms	536 KiB		492 Bytes	2024-1-25 11:34:22
AC	张瑞博	85ms	536 KiB	C++11	537 Bytes	2024-9-22 15:59:14
AC	张睎宇	88ms	536 KiB	C++17	529 Bytes	2024-11-16 13:16:17
AC	这是非常▦▦▦的 (段秉辰)	91ms	572 KiB	C++17	520 Bytes	2024-11-11 17:59:25
AC	新壹街-桂梦文 (桂梦文)	92ms	764 KiB		517 Bytes	2024-1-25 11:29:58
AC	蒲梓勋 (puzixun)	96ms	15.6 MiB		616 Bytes	2022-12-15 20:02:21