火箭发射(循环结构)

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	6ms	256 KiB		163 Bytes	2022-4-1 22:56:40
AC	1396013295	6ms	264 KiB		190 Bytes	2022-1-22 18:18:21
AC	李哲 (lizhe)	6ms	256 KiB		143 Bytes	2022-6-6 21:15:53
AC	李哲 (lizhe)	7ms	312 KiB		145 Bytes	2022-6-6 21:12:16
AC	yizixun	7ms	256 KiB	C	156 Bytes	2022-1-23 16:11:20
AC	Him (李俊熙)	8ms	7.1 MiB		156 Bytes	2024-1-7 16:09:44
AC	杨坤霖 (steven)	8ms	256 KiB		188 Bytes	2023-1-8 9:23:54
AC	胡宸华 (huchenhua)	9ms	384 KiB		147 Bytes	2022-11-13 22:47:32
AC	姚宏逸	11ms	404 KiB		167 Bytes	2022-5-30 16:10:17
AC	高彬月	12ms	7.3 MiB		188 Bytes	2024-1-21 10:03:47
AC	NJL (NJlL)	12ms	384 KiB		332 Bytes	2022-5-15 17:18:23
AC	汪致卉 (wangzh)	12ms	512 KiB		206 Bytes	2022-4-17 0:20:03
AC	许梓宸 (xuzichen)	12ms	6.7 MiB	C++17(O2)	191 Bytes	2024-7-17 16:19:11
AC	张泰凌 (ztl)	12ms	392 KiB		170 Bytes	2022-1-25 13:28:08
AC	HIMMZXC	12ms	408 KiB		156 Bytes	2022-3-19 14:18:07
AC	yaokaixuan	12ms	384 KiB		153 Bytes	2022-1-22 10:32:29
AC	longhao	12ms	384 KiB		151 Bytes	2022-1-25 9:01:49
AC	李华峻 (willy)	13ms	384 KiB		160 Bytes	2022-5-10 17:38:17
AC	zhangyh (张育菡)	13ms	384 KiB		161 Bytes	2022-6-13 22:04:52
AC	原著校区巫映秋 (巫映秋1a)	13ms	7 MiB	C++98	187 Bytes	2024-6-28 22:31:23
AC	孙烽轶 (sfy)	13ms	6.9 MiB	C++98	141 Bytes	2024-5-25 13:42:14
AC	金沙校区-先珂熠 (九转大肠)	13ms	6.7 MiB	C++20(O2)	156 Bytes	2024-8-2 10:31:37
AC	MoonLight ( aaa)	13ms	384 KiB		206 Bytes	2022-1-22 9:46:05
AC	方子谦 (方子谦00)	13ms	384 KiB		193 Bytes	2022-3-20 13:02:16
AC	maomao	13ms	384 KiB		241 Bytes	2022-5-25 20:25:18
AC	谢博文	13ms	384 KiB		203 Bytes	2022-2-26 9:06:39
AC	黄梓桐 (HuangZiTong)	13ms	384 KiB		165 Bytes	2022-7-31 18:12:36
AC	李某人	13ms	436 KiB		175 Bytes	2022-1-25 18:18:48
AC	芒苒忧 (廖迦南)	13ms	384 KiB		196 Bytes	2022-2-26 9:33:47
AC	张祖名	13ms	6.9 MiB	C++98(O2)	160 Bytes	2024-6-10 21:38:14
AC	Randy Marsh (杨子腾)	13ms	384 KiB		189 Bytes	2022-5-19 19:09:06
AC	xiangsiyu	13ms	448 KiB		152 Bytes	2022-6-26 9:26:45
AC	中岛敦 (黄麒瑞)	13ms	6.8 MiB		172 Bytes	2023-10-6 9:18:11
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	384 KiB		156 Bytes	2023-5-16 19:43:37
AC	经常消失 (小萝卜)	13ms	392 KiB		185 Bytes	2022-2-19 15:38:58
AC	余彦瑞	13ms	392 KiB		154 Bytes	2022-3-20 11:15:50
AC	杜俊宏	13ms	436 KiB		171 Bytes	2022-4-24 17:37:51
AC	zhangyouze (张佑泽)	13ms	6.8 MiB		169 Bytes	2023-10-31 20:03:53
AC	Yuan (Zongzi1)	13ms	6.6 MiB	C++17(O2)	149 Bytes	2024-7-18 10:14:53
AC	无尽的想象 (谭仕高)	13ms	392 KiB		159 Bytes	2022-7-29 13:50:22
AC	17779	13ms	384 KiB		154 Bytes	2022-3-14 14:58:51
AC	游智棋	13ms	7.1 MiB	C++17	170 Bytes	2024-6-15 19:39:40
AC	马渝杭 (mayuhang)	13ms	440 KiB		176 Bytes	2022-8-15 12:57:17
AC	李山水	13ms	392 KiB		170 Bytes	2022-4-3 15:43:55
AC	SYC0226	13ms	412 KiB		179 Bytes	2022-3-20 13:12:07
AC	Ronnie	13ms	384 KiB		188 Bytes	2022-2-19 14:12:14
AC	李山水	13ms	384 KiB		170 Bytes	2022-4-3 15:43:55
AC	wangruibo20xh	13ms	384 KiB		151 Bytes	2022-2-11 13:48:59
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	13ms	384 KiB		247 Bytes	2022-3-6 20:58:30
AC	张瑞博	13ms	7.2 MiB	C++11	172 Bytes	2024-5-5 18:53:16
AC	谢延灏 (xeiyanhao---a handsome boy)	13ms	384 KiB		154 Bytes	2022-4-5 21:18:43
AC	樊竣熠 (lft1114)	13ms	392 KiB		151 Bytes	2022-1-26 18:09:26
AC	赵泳鑫 (zhaoyongxin)	13ms	416 KiB		198 Bytes	2022-3-31 19:34:49
AC	你爹 (郭铠嘉)	13ms	384 KiB		170 Bytes	2022-3-22 21:56:09
AC	时代一校 - 冯隆浩 (冯隆浩)	13ms	384 KiB		151 Bytes	2022-7-2 19:30:55
AC	Erin	13ms	7 MiB	C++98	160 Bytes	2024-5-5 11:03:47
AC	11451254188 (22029-mjh)	13ms	436 KiB		222 Bytes	2023-2-25 20:49:28
AC	李彭宋代诗人 (ljy123456)	13ms	384 KiB		176 Bytes	2023-4-11 21:13:30
AC	疯神芭芭脱丝 (李卓修)	13ms	384 KiB		180 Bytes	2022-1-24 17:42:23
AC	叶哲宇 (yzy)	13ms	384 KiB		219 Bytes	2023-6-2 20:58:19
AC	可爱的小花狗	13ms	7.2 MiB	C++11	168 Bytes	2024-4-28 19:30:56
AC	ywh	13ms	384 KiB		190 Bytes	2022-1-24 15:54:07
AC	呵 (mohaoran)	13ms	392 KiB		158 Bytes	2023-2-24 17:28:30
AC	李松泽 (lisongze)	14ms	432 KiB		164 Bytes	2022-4-10 13:51:39
AC	伍芷函	14ms	388 KiB		167 Bytes	2022-3-20 13:20:40
AC	曾御城（现用名） (Jason)	14ms	392 KiB		334 Bytes	2022-3-20 18:02:41
AC	GYZ	14ms	512 KiB		172 Bytes	2022-4-20 18:10:36
AC	吴俊成 (wujuncheng)	14ms	440 KiB		199 Bytes	2022-7-10 12:37:43
AC	Z.饮月君 (张皓南)	14ms	384 KiB		193 Bytes	2022-3-20 12:15:58
AC	李玥漪	14ms	384 KiB		201 Bytes	2022-3-22 20:21:27
AC	qwerty	14ms	432 KiB		155 Bytes	2022-3-12 19:49:09
AC	你爹 (郭铠嘉)	14ms	384 KiB		170 Bytes	2022-2-9 18:49:59
AC	源著校区-宋昊成 (马冬梅)	14ms	432 KiB		183 Bytes	2023-2-25 18:25:57
AC	任瑞的学生 (jiangyadong)	14ms	392 KiB		156 Bytes	2022-6-19 13:21:46
AC	时代校区-刘臣原 (微笑王子)	14ms	512 KiB		141 Bytes	2022-5-23 19:53:33
AC	小忙果 (王昱杰)	14ms	6.9 MiB		166 Bytes	2023-7-18 8:45:41
AC	黄梓轩 (huangzixuan)	14ms	6.7 MiB		144 Bytes	2023-8-24 18:48:14
AC	肖添宇	14ms	512 KiB		156 Bytes	2022-4-16 18:05:24
AC	huyinuo	14ms	452 KiB		160 Bytes	2022-3-19 8:06:16
AC	杜是贤 (dushixian)	14ms	452 KiB		156 Bytes	2022-6-12 10:09:47
AC	新壹街.曾祥睿 (zxr)	14ms	6.8 MiB		161 Bytes	2023-9-24 17:55:22
AC	陈秋石	14ms	384 KiB		206 Bytes	2022-3-20 12:07:48
AC	时代校区-孔令皓 (konglinghao)	14ms	7 MiB	C++98	157 Bytes	2024-5-19 16:45:07
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	440 KiB		180 Bytes	2022-7-1 9:40:12
AC	黄俊皓	14ms	420 KiB		251 Bytes	2022-4-23 10:23:20
AC	陈杰晟	14ms	436 KiB		183 Bytes	2022-3-24 15:08:07
AC	陈骏逸 (chenjunyi)	14ms	436 KiB		177 Bytes	2022-8-10 16:11:07
AC	赵鑫宸 (xiaoxiao721)	14ms	436 KiB		245 Bytes	2022-2-26 17:35:06
AC	时代一校-赵彦博 (zyb)	14ms	8.1 MiB		144 Bytes	2023-8-25 16:13:41
AC	huanglu	14ms	6.9 MiB		179 Bytes	2023-7-18 10:48:32
AC	Tender. (05c05-zhou)	14ms	464 KiB		190 Bytes	2023-2-17 20:12:33
AC	wuzhenghan	14ms	440 KiB		167 Bytes	2022-12-28 21:27:44
AC	刘沄熙	14ms	388 KiB		176 Bytes	2022-3-20 11:07:19
AC	朱老师 (zyp)	14ms	432 KiB		167 Bytes	2022-8-6 18:55:27
AC	黄立信	14ms	7.2 MiB		157 Bytes	2023-10-15 14:01:09
AC	Tang	14ms	512 KiB		261 Bytes	2022-2-26 9:06:36
AC	zlx (xiao)	14ms	436 KiB		201 Bytes	2022-8-9 11:31:46
AC	谭懿轩 (yanyixuan)	14ms	512 KiB		159 Bytes	2022-2-15 20:10:41
AC	偽艺術家 (chenyanchi22006)	14ms	448 KiB		170 Bytes	2022-8-15 23:47:31
AC	文硕 (文硕1)	14ms	520 KiB		198 Bytes	2022-7-12 11:38:57