王宅六味

状态	递交者	时间	内存	语言	代码	递交时间
AC	wangzihang	6ms	256 KiB		442 Bytes	2022-7-3 13:14:08
AC	zzt	6ms	256 KiB		378 Bytes	2022-3-26 22:45:36
AC	任瑞的学生 (jiangyadong)	6ms	256 KiB		408 Bytes	2022-6-14 16:36:11
AC	LUKHE (LukeHu)	6ms	256 KiB		412 Bytes	2022-1-23 19:38:27
AC	秦维希 (qinweixi)	6ms	256 KiB		390 Bytes	2022-6-5 11:08:30
AC	孔妍雅 (tt_kelly)	6ms	256 KiB		387 Bytes	2022-2-20 11:23:41
AC	HIMMZXC	6ms	264 KiB		440 Bytes	2022-3-19 14:18:28
AC	qwerty	6ms	256 KiB	C	363 Bytes	2022-2-14 12:46:45
AC	向南地	7ms	384 KiB		570 Bytes	2022-2-22 19:15:33
AC	_PXY_	7ms	264 KiB		500 Bytes	2022-1-25 14:04:28
AC	谢欣霖 (xiexinlin)	7ms	316 KiB		449 Bytes	2022-2-26 15:58:48
AC	徐子恩 (Cow)	7ms	324 KiB		399 Bytes	2022-1-19 12:03:50
AC	汪致卉 (wangzh)	7ms	256 KiB		378 Bytes	2022-4-8 18:59:06
AC	汪致卉 (wangzh)	7ms	264 KiB		378 Bytes	2022-1-22 18:56:46
AC	wangruibo20xh	7ms	256 KiB		469 Bytes	2022-1-22 11:15:08
AC	old_doctor	7ms	312 KiB		608 Bytes	2022-6-9 16:37:08
AC	南坪校区-龙浩睿 (longhaorui)	7ms	6.9 MiB		436 Bytes	2023-12-31 15:45:32
AC	pushuliang	8ms	320 KiB		369 Bytes	2022-2-26 9:34:24
AC	潘光瑞 (NB牛牛大师)	8ms	7.2 MiB		408 Bytes	2023-12-30 11:11:08
AC	胡宸华 (huchenhua)	8ms	384 KiB		333 Bytes	2022-10-16 13:27:01
AC	(金沙天街)严皓月 (严皓月)	11ms	7 MiB		429 Bytes	2024-1-11 19:46:18
AC	hyh	11ms	7 MiB		302 Bytes	2024-1-6 22:19:18
AC	cola	12ms	6.8 MiB		269 Bytes	2023-11-22 17:05:16
AC	煞笔笔	12ms	6.9 MiB		272 Bytes	2023-11-26 11:34:14
AC	zjz	12ms	424 KiB		336 Bytes	2022-5-8 17:54:48
AC	杜是贤 (dushixian)	12ms	384 KiB		209 Bytes	2022-7-5 13:00:48
AC	时代一校 - 冯隆浩 (冯隆浩)	12ms	384 KiB		332 Bytes	2022-7-2 18:34:15
AC	蒋丁非凡	12ms	384 KiB		403 Bytes	2023-5-19 18:03:03
AC	Tang	12ms	392 KiB		372 Bytes	2022-3-30 18:58:22
AC	吴俊成 (wujuncheng)	12ms	384 KiB		488 Bytes	2022-7-8 23:16:50
AC	高彬月	12ms	7.1 MiB		338 Bytes	2023-12-23 18:18:21
AC	蓝色妖姬 (jiangpeiyu)	12ms	384 KiB		382 Bytes	2022-5-18 19:55:27
AC	冯隆浩（小号）	12ms	384 KiB		420 Bytes	2022-9-16 20:36:37
AC	ycy	12ms	440 KiB		326 Bytes	2022-4-16 12:45:01
AC	王玺懿 (wxy)	12ms	428 KiB		323 Bytes	2022-7-29 12:54:52
AC	TBB (杜昊燃)	12ms	384 KiB		349 Bytes	2022-5-1 21:57:53
AC	MoonLight ( aaa)	12ms	512 KiB		356 Bytes	2022-1-1 10:01:10
AC	姚宏逸	12ms	384 KiB		317 Bytes	2022-4-4 13:41:37
AC	xiangsiyu	12ms	392 KiB		267 Bytes	2022-6-16 20:58:40
AC	朱老师 (zyp)	12ms	384 KiB		314 Bytes	2022-7-27 0:56:47
AC	张祖名	12ms	6.8 MiB	C++98(O2)	312 Bytes	2024-6-5 22:30:02
AC	勾晨禹	12ms	7 MiB	C++17	327 Bytes	2024-6-28 20:27:52
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	12ms	384 KiB		372 Bytes	2022-5-14 14:43:19
AC	icwy (zuolun)	12ms	392 KiB		364 Bytes	2022-4-23 14:23:04
AC	老六在此	12ms	6.7 MiB	C++20	401 Bytes	2024-7-15 20:31:51
AC	zhy123	12ms	6.9 MiB	C++98	285 Bytes	2024-6-30 11:39:13
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	12ms	384 KiB		503 Bytes	2022-1-24 21:33:07
AC	hxb	12ms	392 KiB		356 Bytes	2022-9-17 17:56:55
AC	王若衡 (wangruoheng)	12ms	384 KiB		336 Bytes	2023-5-25 21:14:20
AC	zhangzhixiong	12ms	436 KiB		355 Bytes	2023-2-12 13:56:16
AC	无尽的想象 (谭仕高)	12ms	384 KiB		367 Bytes	2023-2-12 13:50:30
AC	杜雨帆	12ms	7 MiB	C++11	381 Bytes	2024-6-28 18:00:19
AC	王彬羽 (wby)	12ms	6.8 MiB	C++11	244 Bytes	2024-8-15 18:14:13
AC	詹宇航 (zyh7)	12ms	392 KiB		304 Bytes	2022-5-14 18:39:00
AC	胡瀚文	12ms	384 KiB		307 Bytes	2022-7-12 11:55:59
AC	longhao	12ms	384 KiB		381 Bytes	2022-1-23 9:47:18
AC	22029-hqh	12ms	384 KiB		439 Bytes	2023-5-20 10:11:36
AC	经常消失 (小萝卜)	12ms	384 KiB		439 Bytes	2022-1-25 13:51:53
AC	黄梓轩 (huangzixuan)	12ms	392 KiB		402 Bytes	2022-7-3 21:15:08
AC	kkksc03 (彭士锋)	13ms	384 KiB		348 Bytes	2022-3-5 14:51:52
AC	ttt123	13ms	392 KiB		370 Bytes	2023-4-20 20:21:43
AC	魏楚浔 (shawn)	13ms	436 KiB		326 Bytes	2022-3-2 19:22:49
AC	龙沁均 (我是S神)	13ms	392 KiB		420 Bytes	2022-6-12 16:33:31
AC	伍芷函	13ms	384 KiB		406 Bytes	2022-3-13 12:07:47
AC	(张洛诚)	13ms	408 KiB		461 Bytes	2023-4-9 8:31:19
AC	张泰凌 (ztl)	13ms	384 KiB		413 Bytes	2022-1-25 13:21:10
AC	luoluonuoya	13ms	384 KiB		378 Bytes	2022-1-24 12:53:32
AC	谢博文	13ms	384 KiB		361 Bytes	2022-6-28 15:21:29
AC	德意志第三帝国 (陈远桥)	13ms	416 KiB		186 Bytes	2022-5-1 14:23:50
AC	sb (吴振宇)	13ms	436 KiB		336 Bytes	2023-4-22 22:09:51
AC	张峻熙	13ms	384 KiB		337 Bytes	2022-7-1 19:52:52
AC	新壹街校区-周士杰 (zsj)	13ms	384 KiB		352 Bytes	2022-3-4 19:57:27
AC	何星震 (Jacob)	13ms	388 KiB		336 Bytes	2023-1-31 15:38:31
AC	陈家齐 (陈家齐1)	13ms	384 KiB		315 Bytes	2023-2-25 20:36:41
AC	胡靖欢	13ms	384 KiB		302 Bytes	2023-2-4 11:48:33
AC	gzc	13ms	7.2 MiB		342 Bytes	2023-11-26 15:38:10
AC	77777777	13ms	6.6 MiB	C++17	326 Bytes	2024-7-18 21:24:27
AC	侯治鋆	13ms	384 KiB		304 Bytes	2022-4-5 11:45:54
AC	张玉坚 (zhangyuian)	13ms	384 KiB		328 Bytes	2022-7-12 16:05:19
AC	七叶寂照秘密主 (mohaoran)	13ms	392 KiB		320 Bytes	2022-6-17 22:01:22
AC	汪筱淞	13ms	384 KiB		323 Bytes	2022-7-1 18:43:18
AC	Steven (王梓丞)	13ms	384 KiB		407 Bytes	2022-4-23 14:27:38
AC	zlx (xiao)	13ms	384 KiB		380 Bytes	2022-5-24 21:46:28
AC	ywh	13ms	384 KiB		470 Bytes	2022-1-23 15:44:27
AC	樊竣熠 (lft1114)	13ms	384 KiB		350 Bytes	2022-2-6 18:59:01
AC	况奕辛 (KYX_yyds)	13ms	384 KiB		562 Bytes	2022-1-2 19:24:29
AC	李倾城的忠实假粉 (向熠可)	13ms	512 KiB		449 Bytes	2022-3-26 10:41:24
AC	草\|\|草 (陈星佑)	13ms	384 KiB		427 Bytes	2022-5-19 19:36:48
AC	李树崑 (lishukun)	13ms	384 KiB		397 Bytes	2022-1-26 11:09:02
AC	zvt_132 (任子轩)	13ms	6.5 MiB	C++98	306 Bytes	2024-7-26 11:08:02
AC	曹埊睿 (caodirui)	13ms	512 KiB		320 Bytes	2023-4-17 18:44:55
AC	罗翌珂 (dangdang)	13ms	392 KiB		249 Bytes	2022-8-17 9:25:57
AC	蒋丁非凡	13ms	384 KiB		403 Bytes	2023-5-19 18:03:03
AC	魑归sama	13ms	384 KiB		304 Bytes	2022-7-12 16:06:37
AC	谢佳辰	13ms	384 KiB		433 Bytes	2022-7-3 10:16:45
AC	王泓涵 (whh)	13ms	384 KiB		305 Bytes	2022-7-13 13:40:22
AC	chenjunyao	13ms	436 KiB		324 Bytes	2023-4-22 8:49:22
AC	dmh (丁墨涵)	13ms	384 KiB		354 Bytes	2022-1-31 17:02:25
AC	王韵淮	13ms	420 KiB		333 Bytes	2022-5-12 20:54:36
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)	13ms	388 KiB		375 Bytes	2022-11-23 20:26:02