数字放大

状态	递交者	时间	内存	语言	代码	递交时间
AC	hyh	3ms	6.8 MiB		228 Bytes	2023-11-15 19:38:52
AC	shenyushun1	6ms	256 KiB		247 Bytes	2022-8-22 18:13:01
AC	11111	7ms	264 KiB	C	242 Bytes	2022-6-8 18:39:20
AC	gzc	12ms	7.2 MiB		262 Bytes	2023-11-26 15:30:43
AC	李嘉瑞	12ms	392 KiB		328 Bytes	2022-5-28 19:07:02
AC	朱泓屹 (ZYH)	12ms	384 KiB		228 Bytes	2022-5-22 20:15:31
AC	郑妍汐	12ms	384 KiB		242 Bytes	2022-5-25 17:08:05
AC	miku (阳沐珊)	12ms	512 KiB		242 Bytes	2022-6-30 11:28:52
AC	杜是贤 (dushixian)	12ms	392 KiB		258 Bytes	2022-5-23 19:49:07
AC	赵泳鑫 (zhaoyongxin)	12ms	384 KiB		252 Bytes	2022-5-29 18:45:23
AC	l;k (陈彬宾)	12ms	388 KiB		215 Bytes	2022-5-22 19:57:05
AC	吴俊成 (wujuncheng)	12ms	384 KiB		225 Bytes	2022-6-5 17:36:09
AC	kin of kin (jojo)	12ms	400 KiB		388 Bytes	2022-6-11 23:24:51
AC	张玉坚 (zhangyuian)	12ms	412 KiB		214 Bytes	2023-5-7 19:20:07
AC	草\|\|草 (陈星佑)	12ms	384 KiB		263 Bytes	2022-6-30 11:48:16
AC	朱昱丞	12ms	392 KiB		299 Bytes	2022-5-29 20:40:08
AC	陈秋石	12ms	392 KiB		258 Bytes	2022-6-26 10:33:50
AC	刘老师 (图书管理员)	12ms	388 KiB		259 Bytes	2022-5-17 18:02:46
AC	XYZ303	12ms	408 KiB		233 Bytes	2022-5-22 19:05:10
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	13ms	384 KiB		277 Bytes	2022-5-28 20:20:21
AC	黄翼廷	13ms	7 MiB	C++98	250 Bytes	2024-6-27 17:37:13
AC	22016-lyj	13ms	392 KiB		214 Bytes	2023-4-5 14:29:47
AC	icwy (zuolun)	13ms	384 KiB		239 Bytes	2022-7-30 17:15:55
AC	魏楚浔 (shawn)	13ms	392 KiB		266 Bytes	2022-6-5 16:02:09
AC	李哲 (lizhe)	13ms	384 KiB		279 Bytes	2022-7-25 15:55:40
AC	新壹街——陈学彬 (BUG)	13ms	384 KiB		222 Bytes	2022-5-28 19:25:44
AC	游灵一幻 (martin)	13ms	392 KiB		263 Bytes	2023-5-7 11:02:59
AC	伍芷函	13ms	384 KiB		234 Bytes	2023-5-2 17:00:29
AC	陈杰晟	13ms	384 KiB		217 Bytes	2022-5-28 20:19:27
AC	18523558128zcn	13ms	392 KiB		262 Bytes	2022-7-6 10:54:02
AC	ZERO_VOID	13ms	392 KiB		296 Bytes	2022-6-11 12:00:17
AC	杜俊宏	13ms	440 KiB		220 Bytes	2022-6-1 8:50:52
AC	新一街校区Jason_LuoYouZheng (罗友峥)	13ms	384 KiB		264 Bytes	2022-5-28 20:21:09
AC	庹仕杰	13ms	384 KiB		220 Bytes	2023-5-9 18:53:22
AC	hjh	13ms	392 KiB		233 Bytes	2023-5-19 18:54:07
AC	徐子恩 (Cow)	13ms	392 KiB		244 Bytes	2022-5-22 19:36:16
AC	傅博涛	13ms	384 KiB		227 Bytes	2022-5-29 11:48:57
AC	肖添宇	13ms	384 KiB		234 Bytes	2022-5-29 18:49:41
AC	余彦瑞	13ms	384 KiB		242 Bytes	2022-6-26 10:38:11
AC	黄梓桐 (HuangZiTong)	13ms	392 KiB		223 Bytes	2022-6-18 19:58:15
AC	微风将至 (李睿轩)	13ms	384 KiB		274 Bytes	2022-5-20 21:26:16
AC	杨滨郝 (ybh)	13ms	388 KiB		264 Bytes	2022-7-27 9:11:55
AC	刘锦航	13ms	388 KiB		246 Bytes	2022-5-29 17:34:40
AC	陈骏洋	13ms	388 KiB		289 Bytes	2022-5-29 19:12:08
AC	田信 (tianxincn1)	13ms	384 KiB		209 Bytes	2022-5-29 16:01:37
AC	时代一校蒋帛希 (13983392730)	13ms	400 KiB		260 Bytes	2022-11-30 17:51:22
AC	崔欧辰	13ms	6.6 MiB	C++11	255 Bytes	2024-7-9 16:29:27
AC	程舒然	13ms	6.9 MiB	C++11	225 Bytes	2024-8-23 11:11:00
AC	金沙校区-先珂熠 (九转大肠)	13ms	6.9 MiB	C++20(O2)	280 Bytes	2024-8-17 21:10:57
AC	lby_joey	13ms	6.7 MiB	C++98(O2)	209 Bytes	2024-7-17 17:03:27
AC	李彭宋代诗人 (ljy123456)	13ms	392 KiB		255 Bytes	2023-4-5 21:25:59
AC	wangjunhan	13ms	384 KiB		244 Bytes	2022-5-28 20:21:46
AC	我是曾科智儿子 (沈小童)	13ms	384 KiB		224 Bytes	2023-5-17 21:13:34
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	512 KiB		257 Bytes	2022-7-1 11:12:01
AC	陈一锋 (cyf01)	13ms	432 KiB		229 Bytes	2022-9-8 13:52:18
AC	熊奕博 (Mothefuck)	13ms	384 KiB		231 Bytes	2023-2-24 20:11:54
AC	林小博	13ms	384 KiB		270 Bytes	2022-6-30 10:55:41
AC	任舒尧	13ms	384 KiB		250 Bytes	2022-9-9 20:29:32
AC	郑之策	13ms	384 KiB		258 Bytes	2022-5-29 18:13:25
AC	阮 (媚狐不吃道旁李)	13ms	7.2 MiB	C++98	255 Bytes	2024-5-18 16:47:30
AC	郑之策	13ms	408 KiB		258 Bytes	2022-5-29 18:13:16
AC	金沙—彭智宸 (彭智宸)	13ms	384 KiB		196 Bytes	2023-5-7 11:25:55
AC	ttt123	13ms	384 KiB		233 Bytes	2022-8-2 13:57:25
AC	CMG	13ms	384 KiB		296 Bytes	2022-5-20 22:03:15
AC	zhm123	13ms	384 KiB		202 Bytes	2023-5-5 13:51:05
AC	chen (peter)	13ms	400 KiB		206 Bytes	2022-5-28 20:21:49
AC	huyinuo	13ms	384 KiB		256 Bytes	2022-5-19 22:05:33
AC	NJL (NJlL)	13ms	384 KiB		232 Bytes	2022-6-5 16:16:53
AC	张瑞博	13ms	7 MiB	C++11	251 Bytes	2024-5-19 16:37:31
AC	火爆肥肠（杨弘毅） (火爆肥肠)	13ms	384 KiB		231 Bytes	2022-6-7 21:49:54
AC	俞伏羲	13ms	7.4 MiB		205 Bytes	2023-11-18 11:55:02
AC	徐正旺 (xzw)	13ms	384 KiB		270 Bytes	2023-3-29 17:45:19
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	392 KiB		311 Bytes	2022-12-9 18:26:26
AC	Randy Marsh (杨子腾)	13ms	384 KiB		279 Bytes	2022-5-29 17:24:46
AC	秦子越 (13883322087)	13ms	384 KiB		258 Bytes	2022-6-12 9:20:11
AC	靳博然 (jbr)	13ms	384 KiB		241 Bytes	2023-5-14 17:58:16
AC	hzm	13ms	384 KiB		220 Bytes	2022-9-2 14:42:51
AC	偽艺術家 (chenyanchi22006)	13ms	384 KiB		225 Bytes	2022-6-29 18:15:45
AC	22016-oyc	13ms	424 KiB		218 Bytes	2022-9-18 9:57:46
AC	yzl2	13ms	384 KiB		233 Bytes	2023-4-22 21:17:04
AC	吴思谛 (wusidi)	13ms	384 KiB		268 Bytes	2022-6-30 11:27:10
AC	dustsans (njo)	13ms	392 KiB		226 Bytes	2022-9-9 21:06:52
AC	Accepted (周芷乐)	13ms	7.3 MiB	C++14	213 Bytes	2024-5-19 9:26:09
AC	xiangsiyu	13ms	384 KiB		235 Bytes	2022-7-3 17:44:47
AC	黄誉翔 (黄誉翔)	13ms	392 KiB		278 Bytes	2023-4-7 18:49:14
AC	冒牌陈杰晟【MOD】 (wed)	13ms	392 KiB		401 Bytes	2022-6-8 19:04:14
AC	pandap&a王皓宸 (WANGHAOCHEN)	13ms	404 KiB		246 Bytes	2023-3-5 11:51:45
AC	zlx (xiao)	13ms	392 KiB		360 Bytes	2022-5-20 21:33:24
AC	曹埊睿 (caodirui)	13ms	384 KiB		256 Bytes	2023-4-5 21:22:33
AC	Steven (王梓丞)	13ms	384 KiB		254 Bytes	2022-7-5 15:59:56
AC	王彬羽 (wby)	14ms	384 KiB		245 Bytes	2023-5-7 21:17:43
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	14ms	444 KiB		273 Bytes	2022-7-5 14:22:08
AC	chenyifei	14ms	420 KiB		238 Bytes	2022-5-29 18:48:05
AC	张梓浩 (zhangzihao)	14ms	384 KiB		262 Bytes	2023-5-24 20:34:01
AC	德意志第三帝国 (陈远桥)	14ms	384 KiB		221 Bytes	2022-6-2 18:24:42
AC	郑之策	14ms	384 KiB		258 Bytes	2022-5-29 18:13:24
AC	郑之策	14ms	404 KiB		258 Bytes	2022-5-29 18:13:24
AC	Z.饮月君 (张皓南)	14ms	504 KiB		238 Bytes	2022-6-26 10:46:00
AC	原著校区巫映秋 (巫映秋1a)	14ms	512 KiB		217 Bytes	2023-4-5 15:25:42
AC	钟元朗	14ms	384 KiB		211 Bytes	2022-9-17 16:09:47