勇者的剑

状态	递交者	时间	内存	语言	代码	递交时间
AC	heyi	12ms	6.8 MiB	C++98(O2)	222 Bytes	2024-8-8 14:31:41
AC	Noah (mwx)	12ms	7.2 MiB	C++98	1.4 KiB	2024-5-6 19:10:18
AC	冒牌陈杰晟【MOD】 (wed)	12ms	392 KiB		161 Bytes	2022-3-4 17:03:01
AC	cheers 戴 (daizhuorun)	12ms	412 KiB		255 Bytes	2022-2-17 19:53:56
AC	WHWHWHWHWHW (OP AI)	12ms	6.9 MiB	C++98	199 Bytes	2024-6-16 15:48:25
AC	时代一校-曾科智 (曾科智)	12ms	436 KiB		174 Bytes	2023-2-25 19:36:01
AC	qinyi	12ms	384 KiB		285 Bytes	2022-3-5 18:20:05
AC	陈秋石	12ms	384 KiB		210 Bytes	2022-3-21 22:13:53
AC	李树崑 (lishukun)	12ms	388 KiB		195 Bytes	2022-1-26 23:11:19
AC	新壹街-王俊博 (王俊博)	12ms	6.9 MiB	C++98	221 Bytes	2024-6-8 14:47:02
AC	NJL (NJlL)	12ms	448 KiB		214 Bytes	2022-3-13 17:08:37
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	12ms	392 KiB		180 Bytes	2022-7-9 9:13:45
AC	Z.饮月君 (张皓南)	12ms	388 KiB		307 Bytes	2022-3-23 21:39:53
AC	郑尧 (zhengyao)	12ms	7 MiB	C++98	241 Bytes	2024-6-20 22:01:50
AC	凌肯 (lingken22006)	12ms	384 KiB		177 Bytes	2022-7-22 22:01:26
AC	刘昱廷	12ms	6.7 MiB		180 Bytes	2023-9-19 20:11:53
AC	Z.饮月君 (张皓南)	12ms	384 KiB		307 Bytes	2022-3-23 21:29:03
AC	BJ6180C8CTD (Fan)	12ms	6.9 MiB	C++11	304 Bytes	2024-6-11 20:29:04
AC	dddhhhxxx	12ms	384 KiB		274 Bytes	2022-7-10 17:06:40
AC	许徐非凡 (非同凡响)	12ms	384 KiB		196 Bytes	2022-11-5 19:24:19
AC	叶雨昊 (yeyuhao22006)	12ms	384 KiB		180 Bytes	2023-2-5 13:11:41
AC	Nico	12ms	6.9 MiB		187 Bytes	2023-7-26 12:41:58
AC	谭懿轩 (yanyixuan)	12ms	392 KiB		197 Bytes	2022-2-15 13:51:39
AC	李山水	12ms	444 KiB		261 Bytes	2022-6-27 11:19:32
AC	何洋名 (heyangming)	12ms	396 KiB		210 Bytes	2022-10-6 14:01:08
AC	叶雨昊 (yeyuhao22006)	12ms	512 KiB		180 Bytes	2023-2-5 13:11:41
AC	(张洛诚)	12ms	384 KiB		229 Bytes	2023-4-5 20:32:45
AC	马渝杭 (mayuhang)	12ms	392 KiB		318 Bytes	2023-4-8 21:41:27
AC	. (Pig)	12ms	444 KiB		232 Bytes	2022-1-21 13:43:50
AC	miku (阳沐珊)	12ms	420 KiB		210 Bytes	2023-3-16 18:08:31
AC	Nico	12ms	508 KiB		214 Bytes	2023-3-28 17:23:43
AC	时代一校 - 冯隆浩 (冯隆浩)	12ms	436 KiB		187 Bytes	2022-7-2 19:12:16
AC	向俊熙 (xiangjunxi23003)	12ms	432 KiB		167 Bytes	2023-4-12 17:23:58
AC	源著校区-宋昊成 (马冬梅)	12ms	432 KiB		198 Bytes	2023-2-25 18:02:42
AC	lch (凌昌瀚)	12ms	384 KiB		159 Bytes	2022-8-2 11:25:20
AC	陈杰晟	12ms	512 KiB		212 Bytes	2022-2-20 10:40:48
AC	吴俊成 (wujuncheng)	12ms	424 KiB		231 Bytes	2022-7-9 22:13:55
AC	时代二校-陈天成 (鸭缩毛巾)	12ms	392 KiB		191 Bytes	2023-4-8 15:54:14
AC	星野光 (Hoshino Hikari)	12ms	7.5 MiB		364 Bytes	2023-10-22 17:26:01
AC	杨瀚霖 (yanghanlin)	12ms	392 KiB		294 Bytes	2023-5-29 22:15:55
AC	zhangyh (张育菡)	12ms	444 KiB		222 Bytes	2022-6-10 22:23:17
AC	雷承翰1	12ms	384 KiB		198 Bytes	2023-4-1 20:02:33
AC	yanglang	12ms	384 KiB		181 Bytes	2022-10-21 23:04:35
AC	wanghuaiying	12ms	6.9 MiB		212 Bytes	2023-11-4 10:49:19
AC	ywh	12ms	384 KiB		264 Bytes	2022-1-24 19:32:00
AC	贾博涵	13ms	6.8 MiB		194 Bytes	2023-11-7 15:14:05
AC	赵鑫宸 (xiaoxiao721)	13ms	432 KiB		233 Bytes	2022-2-20 5:27:03
AC	叶雨昊 (yeyuhao22006)	13ms	384 KiB		180 Bytes	2023-2-5 13:11:40
AC	杜是贤 (dushixian)	13ms	404 KiB		174 Bytes	2022-5-1 11:13:59
AC	CK (李弘毅)	13ms	392 KiB		255 Bytes	2022-10-2 13:11:36
AC	黄立信	13ms	6.8 MiB		223 Bytes	2023-10-12 20:45:47
AC	huqingyu	13ms	384 KiB		197 Bytes	2022-4-23 16:12:02
AC	谢博文	13ms	392 KiB		309 Bytes	2022-2-13 11:07:10
AC	chenyifei	13ms	384 KiB		226 Bytes	2022-1-22 19:58:04
AC	任伊涵	13ms	7.2 MiB		218 Bytes	2023-7-9 14:53:48
AC	xzf	13ms	7 MiB	C++98	213 Bytes	2024-8-25 10:51:05
AC	05c30-dyh	13ms	436 KiB		206 Bytes	2022-3-5 15:47:15
AC	朱老师 (zyp)	13ms	384 KiB		188 Bytes	2022-7-28 10:54:25
AC	pandap&a王皓宸 (WANGHAOCHEN)	13ms	404 KiB		152 Bytes	2022-12-9 19:49:32
AC	王康瑞	13ms	6.9 MiB		242 Bytes	2023-11-4 10:31:27
AC	huanglu	13ms	6.9 MiB		210 Bytes	2023-7-15 15:04:35
AC	罗竣瀚	13ms	384 KiB		196 Bytes	2022-10-25 22:18:37
AC	Z.饮月君 (张皓南)	13ms	512 KiB		307 Bytes	2022-3-23 21:18:22
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	440 KiB		281 Bytes	2023-5-20 11:49:58
AC	郑妍汐	13ms	436 KiB		232 Bytes	2022-2-18 22:50:46
AC	黄俊皓	13ms	512 KiB		239 Bytes	2022-4-16 20:14:18
AC	许炜铭 (xuweiming)	13ms	6.8 MiB		198 Bytes	2023-6-10 22:09:30
AC	德克萨斯做的到吗 (liyangbao)	13ms	384 KiB		335 Bytes	2022-11-6 12:09:02
AC	56 (13883454928)	13ms	6.7 MiB		178 Bytes	2023-6-7 18:23:39
AC	在煎鱼的肖大总铳 (肖宇航)	13ms	6.8 MiB		217 Bytes	2023-10-12 21:50:36
AC	Tang	13ms	432 KiB		253 Bytes	2022-2-19 11:23:45
AC	希蒙 (zhengxingya)	13ms	7.5 MiB		284 Bytes	2023-8-21 17:11:09
AC	zhm123	13ms	436 KiB		167 Bytes	2023-3-30 15:00:39
AC	陈家齐 (陈家齐1)	13ms	392 KiB		202 Bytes	2023-4-1 11:07:04
AC	yuqihao	13ms	6.9 MiB		242 Bytes	2023-11-4 10:43:58
AC	呵呵呵 (陈思琦)	13ms	384 KiB		172 Bytes	2022-10-5 14:38:05
AC	SYC0226	13ms	440 KiB		199 Bytes	2022-3-20 10:54:45
AC	缥 (王硕2012)	13ms	384 KiB		264 Bytes	2022-10-2 17:59:21
AC	wzzjnb2012	13ms	440 KiB		207 Bytes	2022-9-29 11:58:30
AC	小忙果 (王昱杰)	13ms	428 KiB		189 Bytes	2023-2-26 11:23:49
AC	纪承熙 (jcx001)	13ms	6.9 MiB		252 Bytes	2023-7-17 10:38:09
AC	文硕 (文硕1)	13ms	436 KiB		347 Bytes	2022-7-12 11:25:20
AC	贾博涵	13ms	6.8 MiB		161 Bytes	2023-11-7 15:14:43
AC	葛广言	13ms	7.2 MiB	C++98	165 Bytes	2024-4-24 18:57:29
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	13ms	384 KiB		166 Bytes	2022-9-24 23:22:09
AC	raozheng	13ms	384 KiB		287 Bytes	2022-11-27 14:54:29
AC	周琪渃	13ms	384 KiB		324 Bytes	2023-3-9 20:54:38
AC	胡澜之 (666hlz666)	13ms	436 KiB		260 Bytes	2023-4-26 20:16:35
AC	chen (peter)	13ms	432 KiB		248 Bytes	2023-2-18 3:22:47
AC	任童(rentong)	13ms	436 KiB		207 Bytes	2022-10-15 17:26:08
AC	拥抱幸福小熊(吴沛篪)	13ms	6.9 MiB		218 Bytes	2023-11-4 10:33:45
AC	tsc_ (杨悦堃)	13ms	384 KiB		267 Bytes	2023-4-8 15:49:42
AC	游灵一幻 (martin)	13ms	6.9 MiB		168 Bytes	2023-7-27 15:17:04
AC	xuniaoyin (徐袅音)	13ms	6.9 MiB		202 Bytes	2023-7-28 11:15:19
AC	我是周靖松长得帅 (mouyunqi)	13ms	6.8 MiB		165 Bytes	2023-6-17 14:02:25
AC	何锦宸熙	13ms	6.8 MiB		204 Bytes	2023-10-28 19:50:08
AC	罗伟杰 (13308275065)	13ms	512 KiB		243 Bytes	2022-9-25 20:51:53
AC	赵启程 (赵启程1)	13ms	416 KiB		188 Bytes	2023-4-1 20:01:04
AC	林子沫awa (linziyue)	14ms	448 KiB		206 Bytes	2023-3-16 22:42:48
AC	牟淳雅	14ms	6.9 MiB		202 Bytes	2023-7-26 12:48:11