新冠病毒初步筛查

状态	递交者	时间	内存	语言	代码	递交时间
AC	11111	7ms	284 KiB		343 Bytes	2022-7-5 22:32:35
AC	shenyushun1	7ms	256 KiB		340 Bytes	2022-8-27 17:10:57
AC	黄彦熹 (AK-203)	7ms	384 KiB		398 Bytes	2023-2-26 19:56:13
AC	姚宏逸	7ms	312 KiB		480 Bytes	2022-11-28 11:38:15
AC	杨坤霖 (steven)	11ms	404 KiB		383 Bytes	2023-3-19 14:01:35
AC	小忙果 (王昱杰)	12ms	7.1 MiB		358 Bytes	2023-12-3 14:17:50
AC	牟淳雅	13ms	7.3 MiB		333 Bytes	2023-12-31 10:53:09
AC	张瑞博	13ms	6.6 MiB	C++11	338 Bytes	2024-7-25 14:04:25
AC	Zongzi1	13ms	6.6 MiB	C++17(O2)	465 Bytes	2024-7-24 11:30:59
AC	xmw318046	13ms	6.7 MiB	C++98	462 Bytes	2024-8-1 12:21:24
AC	郭人瑀作业号	13ms	384 KiB		374 Bytes	2022-8-2 16:46:40
AC	huyinuo	14ms	384 KiB		369 Bytes	2022-6-18 8:25:37
AC	赵泳鑫 (zhaoyongxin)	14ms	432 KiB		477 Bytes	2022-7-15 14:47:15
AC	新壹街校区-杨轩懿 (杨轩懿1)	14ms	6.8 MiB		333 Bytes	2023-10-15 12:21:07
AC	不怎么聪明的家伙 (贺俊楠)	15ms	6.9 MiB		409 Bytes	2023-10-15 12:04:09
AC	李哲 (lizhe)	15ms	448 KiB		360 Bytes	2022-8-16 21:39:54
AC	吴俊成 (wujuncheng)	15ms	512 KiB		260 Bytes	2022-7-11 11:34:01
AC	樊竣熠 (lft1114)	15ms	512 KiB		375 Bytes	2022-8-2 15:27:44
AC	任童(rentong)	15ms	444 KiB		452 Bytes	2023-2-4 16:22:09
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	6.8 MiB		423 Bytes	2023-10-24 17:59:33
AC	中岛敦 (黄麒瑞)	15ms	6.8 MiB		409 Bytes	2023-10-20 19:01:33
AC	杜是贤 (dushixian)	15ms	512 KiB		403 Bytes	2022-8-5 10:48:31
AC	爱琴海校区-刁钲洋 (刁钲洋)	15ms	384 KiB		418 Bytes	2023-5-29 21:31:29
AC	王晨志 (wangchenzhi)	15ms	512 KiB		492 Bytes	2022-7-17 3:37:50
AC	cupy战士 (05c05-dkf)	15ms	392 KiB		372 Bytes	2023-3-26 15:43:51
AC	疯神芭芭脱丝 (李卓修)	16ms	436 KiB		453 Bytes	2022-7-14 19:25:48
AC	徐康景 (dcm)	16ms	452 KiB		376 Bytes	2023-3-4 16:56:40
AC	56 (13883454928)	16ms	384 KiB		343 Bytes	2023-3-23 19:20:41
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	440 KiB		301 Bytes	2023-5-19 18:49:09
AC	Jose (反恐皮蛋)	17ms	420 KiB		358 Bytes	2022-10-12 18:03:51
AC	文硕 (文硕1)	17ms	452 KiB		406 Bytes	2023-1-31 17:04:26
AC	赵沛喆	17ms	520 KiB		339 Bytes	2023-1-18 13:48:04
AC	李廷旭 (litingxu)	17ms	6.7 MiB		318 Bytes	2023-9-20 19:25:39
AC	Tender. (05c05-zhou)	17ms	6.7 MiB		384 Bytes	2023-8-24 10:57:56
AC	朱老师 (zyp)	18ms	440 KiB		423 Bytes	2022-9-27 15:39:31
AC	李晨希	18ms	7.2 MiB		422 Bytes	2023-7-19 11:50:21
AC	周浩楠 (开朗的周好难)	18ms	6.7 MiB		312 Bytes	2023-8-30 15:11:34
AC	马渝杭 (mayuhang)	18ms	904 KiB		371 Bytes	2022-11-18 16:26:55
AC	guozuming	18ms	460 KiB		263 Bytes	2022-12-11 9:44:49
AC	时代一校-赵彦博 (zyb)	19ms	6.9 MiB		365 Bytes	2023-8-10 13:24:28
AC	RanHao	19ms	7 MiB		608 Bytes	2023-7-15 11:56:56
AC	郑岐蔚	21ms	912 KiB		546 Bytes	2023-1-26 14:54:02
AC	wangzihang	22ms	7 MiB		405 Bytes	2023-11-11 16:42:46
AC	Alduin	38ms	5 MiB		425 Bytes	2022-6-5 10:47:22
AC	wangchenyu	41ms	5 MiB		448 Bytes	2023-3-23 19:22:44
AC	爱琴海校区jzn (jzn)	47ms	8.2 MiB		404 Bytes	2023-7-3 17:39:44
AC	煞笔笔	65ms	764 KiB		268 Bytes	2024-4-4 11:07:55
AC	zyl	65ms	768 KiB		555 Bytes	2024-3-24 9:32:17
AC	zyl	70ms	532 KiB		538 Bytes	2024-2-18 10:02:55
AC	蔡蕊池	72ms	764 KiB		370 Bytes	2024-3-2 13:56:54
AC	zyl	72ms	552 KiB		512 Bytes	2024-3-21 17:19:45
AC	赵奕铭	73ms	764 KiB		272 Bytes	2024-3-7 18:39:55
AC	daiziyuan001	74ms	552 KiB	C++20(O2)	500 Bytes	2024-9-4 10:49:14
AC	stehpen_zuo	77ms	768 KiB	C++20	389 Bytes	2024-9-4 14:24:55
AC	colin1112 (墙凌可)	84ms	1 MiB		509 Bytes	2024-2-17 15:17:54
AC	chaikexu	88ms	5 MiB		406 Bytes	2023-3-19 15:39:50
AC	kongql	180ms	9.1 MiB	Python 3	150 Bytes	2023-7-22 18:55:51
AC	scallway	204ms	4.1 MiB	Python 3	239 Bytes	2023-3-12 16:53:34
AC	wangmiaoxin	208ms	3.9 MiB	Python 3	222 Bytes	2023-3-12 16:56:05
AC	hrx	216ms	3.9 MiB	Python 3	221 Bytes	2023-3-12 16:56:41
AC	cola	219ms	4.1 MiB	Python 3	213 Bytes	2022-12-22 18:49:40
AC	杜俊宏	248ms	46.3 MiB		353 Bytes	2022-8-5 11:06:02
AC	阮 (媚狐不吃道旁李)	327ms	49.6 MiB	C++98	375 Bytes	2024-5-2 16:55:05
AC	jdy	1484ms	46.4 MiB		375 Bytes	2024-3-10 14:14:25