津津的游戏时间

状态	递交者	时间	内存	语言	代码	递交时间
AC	况奕辛 (KYX_yyds)	26ms	384 KiB		171 Bytes	2022-1-2 19:12:24
AC	Erin	27ms	7.2 MiB	C++98	139 Bytes	2024-5-1 14:10:32
AC	朱泽晟	27ms	384 KiB		141 Bytes	2022-2-9 21:48:22
AC	胡瀚文	27ms	392 KiB		113 Bytes	2022-1-24 10:59:47
AC	诸禹吉 (zhuyuji)	27ms	512 KiB		126 Bytes	2022-7-28 20:44:02
AC	明哲瀚 (18580067605)	27ms	392 KiB		125 Bytes	2022-10-5 14:34:35
AC	Tender. (05c05-zhou)	27ms	384 KiB		138 Bytes	2022-7-3 15:05:59
AC	黄俊皓	27ms	384 KiB		190 Bytes	2022-4-16 20:06:40
AC	杜俊宏	27ms	384 KiB		123 Bytes	2022-3-14 20:47:37
AC	夏麟然	27ms	6.9 MiB	C++98	119 Bytes	2024-5-24 18:01:11
AC	ywh	27ms	384 KiB		171 Bytes	2022-1-24 15:48:42
AC	18523558128zcn	27ms	384 KiB		157 Bytes	2022-4-16 14:39:46
AC	老六在此	27ms	6.7 MiB	C++20	139 Bytes	2024-7-15 19:29:56
AC	xiangsiyu	27ms	412 KiB		122 Bytes	2022-6-21 20:43:51
AC	陈杰晟	27ms	384 KiB		155 Bytes	2022-2-17 17:57:20
AC	luoluonuoya	27ms	384 KiB		141 Bytes	2022-1-24 12:25:44
AC	hulang	27ms	384 KiB		174 Bytes	2022-5-8 17:07:11
AC	十七	27ms	6.5 MiB	C++20	133 Bytes	2024-7-30 15:17:03
AC	王韵淮	27ms	384 KiB		107 Bytes	2022-5-20 21:13:20
AC	李树崑 (lishukun)	27ms	416 KiB		163 Bytes	2022-1-28 13:33:00
AC	彭嘉豪 (pengjiahao)	27ms	436 KiB		169 Bytes	2022-7-27 13:10:07
AC	17779	27ms	392 KiB		150 Bytes	2022-3-8 14:37:57
AC	蒋丁非凡	27ms	392 KiB		126 Bytes	2023-5-19 18:17:09
AC	张瑞博	27ms	7.1 MiB	C++11	135 Bytes	2024-4-20 23:11:42
AC	陈年保宁醋 (dengboren)	27ms	436 KiB		119 Bytes	2022-6-10 19:42:03
AC	曾御城（现用名） (Jason)	27ms	384 KiB		205 Bytes	2022-2-10 21:41:32
AC	谢延灏 (xeiyanhao---a handsome boy)	27ms	384 KiB		141 Bytes	2022-1-22 17:23:40
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)	27ms	384 KiB		162 Bytes	2023-5-20 11:47:13
AC	LUKHE (LukeHu)	27ms	384 KiB		144 Bytes	2022-1-23 19:19:41
AC	啊...这 (炼狱杏寿郎)	27ms	384 KiB		135 Bytes	2022-8-14 15:49:50
AC	SMIK	27ms	392 KiB		202 Bytes	2022-1-24 12:31:31
AC	liangyuntian23003	27ms	384 KiB		130 Bytes	2023-3-4 17:07:19
AC	WangXi	27ms	384 KiB		120 Bytes	2022-9-24 17:54:03
AC	呵呵呵 (陈思琦)	27ms	384 KiB		143 Bytes	2022-8-11 20:26:35
AC	ycy	27ms	384 KiB		144 Bytes	2022-4-15 20:48:39
AC	zhangyh (张育菡)	27ms	384 KiB		129 Bytes	2022-5-15 10:04:33
AC	陌生人 (涂玉龙)	27ms	7.5 MiB	C++11	122 Bytes	2024-6-23 16:59:19
AC	曹元明	27ms	384 KiB		136 Bytes	2022-4-23 11:13:56
AC	wangxingyue	27ms	392 KiB		148 Bytes	2022-1-24 19:04:06
AC	old_doctor	27ms	520 KiB		126 Bytes	2022-6-9 13:31:03
AC	魑归sama	27ms	512 KiB		119 Bytes	2022-7-12 16:02:13
AC	yiqiuyu	27ms	400 KiB		135 Bytes	2023-3-4 18:13:25
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	27ms	384 KiB		139 Bytes	2022-4-23 13:57:16
AC	姚宏逸	27ms	384 KiB		141 Bytes	2022-3-27 20:48:33
AC	杨军方 (lyx2000)	27ms	392 KiB		135 Bytes	2022-2-27 9:31:53
AC	huanghaoming	27ms	392 KiB		199 Bytes	2022-8-20 15:30:30
AC	05c30-dyh	27ms	448 KiB		151 Bytes	2022-2-26 16:13:37
AC	余晨浩 (yuchenhao)	27ms	384 KiB		137 Bytes	2023-5-24 21:42:24
AC	李彦臻	27ms	436 KiB		137 Bytes	2023-5-24 18:28:32
AC	赵启程 (赵启程1)	27ms	412 KiB		124 Bytes	2023-4-8 18:22:05
AC	longhao	27ms	424 KiB		151 Bytes	2022-1-23 18:18:46
AC	Accepted (周芷乐)	27ms	7 MiB	C++14	136 Bytes	2024-6-17 19:13:57
AC	谢欣霖 (xiexinlin)	27ms	416 KiB		161 Bytes	2022-3-5 15:22:50
AC	孙天豪 (AliceSteven)	27ms	512 KiB		147 Bytes	2022-7-26 15:45:32
AC	新壹街+黄路+江宇轩 (江宇轩)	27ms	6.9 MiB	C++98	151 Bytes	2024-5-26 10:27:58
AC	77777777	27ms	6.7 MiB	C++17	134 Bytes	2024-7-17 22:02:14
AC	蒋晟睿	27ms	6.9 MiB	C++98	144 Bytes	2024-6-20 21:10:28
AC	soha (武夷岩)	27ms	512 KiB		127 Bytes	2022-8-21 10:10:00
AC	唐梓竣	27ms	444 KiB		147 Bytes	2023-4-15 20:28:36
AC	wanghuaiying	27ms	7 MiB		120 Bytes	2023-10-21 11:09:14
AC	王康瑞	27ms	7.1 MiB		148 Bytes	2023-10-21 11:06:32
AC	Randy Marsh (杨子腾)	27ms	392 KiB		186 Bytes	2022-3-20 9:10:43
AC	林小博	27ms	384 KiB		157 Bytes	2022-2-19 11:24:11
AC	Ronnie	27ms	384 KiB		146 Bytes	2022-2-19 14:15:53
AC	tad (OP AI)	27ms	6.9 MiB	C++98	177 Bytes	2024-6-12 19:42:43
AC	heyuzhe	27ms	7 MiB	C++98	154 Bytes	2024-6-19 19:14:03
AC	颐和园呵呵一盒一盒一盒你呢他已经儿童节 (高晨曦)	27ms	7 MiB	C++98	144 Bytes	2024-6-13 19:50:04
AC	Jack	27ms	436 KiB		133 Bytes	2022-8-2 17:09:13
AC	王玺懿 (wxy)	27ms	512 KiB		116 Bytes	2022-7-25 9:55:31
AC	国林泽 (guolinze)	27ms	512 KiB		154 Bytes	2022-3-14 20:25:55
AC	草\|\|草 (陈星佑)	27ms	436 KiB		122 Bytes	2022-7-1 14:09:31
AC	傅博涛	27ms	384 KiB		109 Bytes	2022-2-19 21:27:05
AC	付博plus	28ms	512 KiB		130 Bytes	2023-2-15 20:39:57
AC	黄梓轩 (huangzixuan)	28ms	444 KiB		125 Bytes	2022-7-3 20:57:44
AC	郑妍汐	28ms	384 KiB		137 Bytes	2022-3-1 22:47:47
AC	(05c35-cyd)	28ms	512 KiB		155 Bytes	2022-2-14 9:51:39
AC	wuzhenghan	28ms	428 KiB		125 Bytes	2022-9-24 19:01:36
AC	冒牌陈杰晟【MOD】 (wed)	28ms	512 KiB		117 Bytes	2022-2-24 19:36:59
AC	拥抱幸福小熊(吴沛篪)	28ms	7 MiB		134 Bytes	2023-10-21 11:08:42
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	28ms	384 KiB		156 Bytes	2022-1-25 11:49:39
AC	呵呵呵 (陈思琦)	28ms	432 KiB		143 Bytes	2022-8-11 20:26:33
AC	王若衡 (wangruoheng)	28ms	384 KiB		121 Bytes	2023-5-12 21:44:30
AC	一个小黑	28ms	6.7 MiB		132 Bytes	2023-9-22 21:18:13
AC	杨瀚霖 (yanghanlin)	28ms	436 KiB		127 Bytes	2023-2-16 22:16:29
AC	罗一鸣	28ms	6.8 MiB		130 Bytes	2023-10-4 16:46:19
AC	谢博文	28ms	392 KiB		144 Bytes	2022-2-26 9:05:09
AC	kkksc03 (彭士锋)	28ms	440 KiB		135 Bytes	2022-3-5 13:54:45
AC	黄立信	28ms	6.8 MiB		128 Bytes	2023-10-6 19:33:34
AC	陈骏逸 (chenjunyi)	28ms	436 KiB		150 Bytes	2022-7-17 13:42:30
AC	谭懿轩 (yanyixuan)	28ms	512 KiB		128 Bytes	2022-1-20 19:00:40
AC	Cristiano·Ronaldo (05c41-gmz)	28ms	500 KiB		131 Bytes	2022-7-26 16:50:59
AC	12345	28ms	384 KiB		130 Bytes	2022-2-19 14:11:16
AC	弹射起飞 ? 冲 ! (吴周周)	28ms	6.8 MiB		197 Bytes	2023-10-14 16:57:49
AC	zhuziyu	28ms	384 KiB		192 Bytes	2022-2-19 9:26:47
AC	芒苒忧 (廖迦南)	28ms	436 KiB		156 Bytes	2022-2-19 11:11:59
AC	火爆肥肠（杨弘毅） (火爆肥肠)	28ms	512 KiB		135 Bytes	2022-2-21 21:39:42
AC	lafuzbc	28ms	436 KiB		126 Bytes	2022-8-20 11:42:58
AC	李旻轩	28ms	384 KiB		151 Bytes	2023-3-11 11:03:57
AC	新壹街——陈学彬 (BUG)	28ms	436 KiB		109 Bytes	2022-3-9 19:55:32
AC	xxteacher	28ms	400 KiB		186 Bytes	2022-1-25 17:20:00