细胞分裂(循环结构)

状态	递交者	时间	内存	语言	代码	递交时间
AC	姚宏逸	6ms	256 KiB		188 Bytes	2022-5-30 16:11:53
AC	赵沛喆	6ms	256 KiB		168 Bytes	2022-4-3 9:44:29
AC	yaokaixuan	6ms	256 KiB		156 Bytes	2022-1-22 10:35:59
AC	1396013295	6ms	264 KiB		199 Bytes	2022-1-22 18:18:43
AC	Ronnie	7ms	264 KiB		183 Bytes	2022-2-19 14:11:10
AC	wangzihang	7ms	384 KiB	C++	171 Bytes	2022-8-4 10:43:49
AC	wangruibo20xh	7ms	316 KiB		171 Bytes	2022-2-11 13:49:24
AC	胡宸华 (huchenhua)	8ms	316 KiB		144 Bytes	2022-11-20 21:02:33
AC	没有此人 (akm)	9ms	7.1 MiB		148 Bytes	2023-12-23 15:11:15
AC	LittleHair	12ms	6.9 MiB	C++11	167 Bytes	2024-8-15 22:35:56
AC	Yuan (Zongzi1)	12ms	6.6 MiB	C++17(O2)	300 Bytes	2024-7-18 10:19:34
AC	maomao	12ms	392 KiB		242 Bytes	2022-5-25 20:26:47
AC	文硕 (文硕1)	12ms	384 KiB		241 Bytes	2022-7-12 11:39:12
AC	原著校区巫映秋 (巫映秋1a)	12ms	7 MiB	C++98	237 Bytes	2024-6-28 22:40:39
AC	xiangsiyu	12ms	384 KiB		155 Bytes	2022-6-23 20:08:24
AC	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	12ms	7 MiB	C++98	163 Bytes	2024-5-27 22:43:30
AC	scallway	12ms	7.2 MiB	C++11	162 Bytes	2024-5-5 14:11:37
AC	22016-ggs	12ms	512 KiB		196 Bytes	2022-8-16 15:53:47
AC	tad (OP AI)	12ms	6.8 MiB	C++11	158 Bytes	2024-7-1 21:49:09
AC	scallway	12ms	384 KiB		261 Bytes	2023-4-16 17:51:55
AC	李山水	13ms	384 KiB		232 Bytes	2022-4-4 15:33:53
AC	heyi	13ms	6.8 MiB	C++98(O2)	199 Bytes	2024-8-10 14:25:03
AC	蒲梓勋 (puzixun)	13ms	384 KiB		257 Bytes	2022-8-9 21:59:46
AC	Accepted (周芷乐)	13ms	6.7 MiB	C++14	368 Bytes	2024-7-20 12:19:56
AC	张祖名	13ms	6.9 MiB	C++98(O2)	186 Bytes	2024-6-10 21:40:54
AC	新壹街——陈学彬 (BUG)	13ms	384 KiB		136 Bytes	2022-7-20 20:04:21
AC	Erin	13ms	7 MiB	C++98	150 Bytes	2024-5-5 11:08:10
AC	lch (凌昌瀚)	13ms	440 KiB		175 Bytes	2022-8-4 16:00:39
AC	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	13ms	7 MiB	C++98	163 Bytes	2024-5-27 22:43:20
AC	冒牌陈杰晟【MOD】 (wed)	13ms	384 KiB		130 Bytes	2022-3-1 21:20:57
AC	ycy	13ms	392 KiB		185 Bytes	2022-6-16 17:04:29
AC	scallway	13ms	392 KiB		261 Bytes	2022-9-17 17:33:39
AC	吴俊成 (wujuncheng)	13ms	384 KiB		193 Bytes	2022-7-10 12:38:08
AC	陈于硕(我™的) (chenyu)	13ms	384 KiB		177 Bytes	2023-2-25 11:28:32
AC	MoonLight ( aaa)	13ms	384 KiB		169 Bytes	2022-1-22 9:46:19
AC	陈杰晟	13ms	396 KiB		238 Bytes	2022-3-24 15:10:47
AC	杨皓宇 (杨浩宇)	13ms	400 KiB		155 Bytes	2022-8-21 12:05:56
AC	王晨志 (wangchenzhi)	13ms	436 KiB		121 Bytes	2022-7-18 8:44:05
AC	shenyushun2	13ms	512 KiB		160 Bytes	2022-12-2 18:51:43
AC	scallway	13ms	384 KiB		261 Bytes	2022-9-15 15:42:40
AC	逄云皓	13ms	6.8 MiB	C++98	175 Bytes	2024-8-25 14:42:51
AC	杜俊宏	13ms	388 KiB		239 Bytes	2022-4-25 19:25:47
AC	呵呵呵 (陈思琦)	13ms	384 KiB		136 Bytes	2022-9-17 17:00:05
AC	马渝杭 (mayuhang)	13ms	384 KiB		161 Bytes	2023-4-7 11:02:12
AC	时代一校 - 冯隆浩 (冯隆浩)	13ms	392 KiB		196 Bytes	2022-7-2 19:29:40
AC	肖添宇	13ms	384 KiB		193 Bytes	2022-4-16 18:12:10
AC	ywh	13ms	444 KiB		171 Bytes	2022-1-24 19:39:05
AC	SYC0226	13ms	384 KiB		310 Bytes	2022-3-20 13:12:52
AC	汪致卉 (wangzh)	13ms	384 KiB		141 Bytes	2022-1-22 20:20:01
AC	小忙果 (王昱杰)	13ms	440 KiB		148 Bytes	2023-2-26 8:43:56
AC	ycy	13ms	384 KiB		132 Bytes	2022-11-6 16:55:33
AC	黄梓桐 (HuangZiTong)	13ms	392 KiB		174 Bytes	2022-8-1 11:42:00
AC	偽艺術家 (chenyanchi22006)	13ms	384 KiB		152 Bytes	2022-8-20 14:49:56
AC	胡瀚文	13ms	436 KiB		179 Bytes	2022-7-18 11:30:19
AC	任瑞的学生 (jiangyadong)	13ms	400 KiB		204 Bytes	2023-2-4 16:16:10
AC	李哲 (lizhe)	13ms	384 KiB		133 Bytes	2022-8-25 17:37:55
AC	hyc	13ms	384 KiB		229 Bytes	2023-2-25 11:43:19
AC	陈映辰	13ms	6.8 MiB	C++98(O2)	161 Bytes	2024-8-10 21:07:09
AC	阮 (媚狐不吃道旁李)	13ms	7 MiB	C++98	145 Bytes	2024-5-25 16:32:28
AC	朱老师 (zyp)	13ms	436 KiB		194 Bytes	2022-8-6 19:09:29
AC	huyinuo	13ms	420 KiB		153 Bytes	2022-8-22 11:03:52
AC	yuhaodi	14ms	440 KiB		205 Bytes	2023-4-23 17:13:18
AC	源著校区-宋昊成 (马冬梅)	14ms	512 KiB		231 Bytes	2023-2-25 18:26:18
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	440 KiB		150 Bytes	2023-2-26 12:46:07
AC	Jack	14ms	512 KiB		232 Bytes	2022-8-17 19:15:25
AC	黄彦熹 (AK-203)	14ms	404 KiB		174 Bytes	2022-9-23 21:20:49
AC	wuzhenghan	14ms	384 KiB		171 Bytes	2022-12-28 21:35:58
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)	14ms	400 KiB		156 Bytes	2023-5-16 19:46:44
AC	爱情海校区—沙天一 (沙天一)	14ms	512 KiB		184 Bytes	2023-2-25 11:39:18
AC	zlx (xiao)	14ms	440 KiB		328 Bytes	2022-8-9 11:33:09
AC	CK (李弘毅)	14ms	392 KiB		294 Bytes	2022-9-17 17:32:08
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	440 KiB		160 Bytes	2023-2-24 17:30:02
AC	yanglang	14ms	384 KiB		153 Bytes	2022-10-23 11:00:37
AC	无尽的想象 (谭仕高)	14ms	436 KiB		150 Bytes	2022-7-29 13:53:17
AC	南坪校区-淡昌盛 (Dancs)	14ms	6.8 MiB		169 Bytes	2023-10-26 19:39:12
AC	叶哲宇 (yzy)	14ms	392 KiB		150 Bytes	2023-5-7 19:01:33
AC	luoluonuoya	14ms	432 KiB		164 Bytes	2022-8-15 14:24:19
AC	疯神芭芭脱丝 (李卓修)	14ms	396 KiB		226 Bytes	2022-4-5 16:40:40
AC	hyh	14ms	384 KiB		226 Bytes	2023-2-25 11:43:06
AC	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	14ms	7 MiB	C++98	163 Bytes	2024-5-27 22:43:38
AC	李彭宋代诗人 (ljy123456)	14ms	440 KiB		161 Bytes	2023-4-11 21:13:55
AC	scallway	14ms	384 KiB		261 Bytes	2022-9-18 20:56:12
AC	唐梓竣	14ms	388 KiB		162 Bytes	2022-8-29 11:59:03
AC	chenjunyao	14ms	428 KiB		156 Bytes	2023-5-13 10:38:11
AC	伍行念 (wuxingnian)	14ms	6.8 MiB		158 Bytes	2023-9-29 15:02:34
AC	林小博	14ms	428 KiB		244 Bytes	2022-4-9 11:41:10
AC	wangyueru	14ms	388 KiB		186 Bytes	2022-10-29 20:00:01
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	432 KiB		166 Bytes	2023-5-6 14:16:29
AC	孙烽轶 (sfy)	14ms	384 KiB		221 Bytes	2022-9-17 17:40:09
AC	繁星 (05c35-zzm)	14ms	392 KiB		202 Bytes	2022-11-28 9:08:09
AC	何欣洋	14ms	392 KiB		184 Bytes	2023-2-25 11:40:17
AC	zhangyh (张育菡)	14ms	512 KiB		149 Bytes	2022-6-13 22:05:07
AC	李山水	14ms	392 KiB		232 Bytes	2022-4-4 15:33:53
AC	赵鑫宸 (xiaoxiao721)	14ms	512 KiB		263 Bytes	2022-2-26 17:41:47
AC	NJL (NJlL)	14ms	512 KiB		193 Bytes	2022-7-6 14:54:48
AC	谢延灏 (xeiyanhao---a handsome boy)	14ms	384 KiB		178 Bytes	2022-4-5 21:22:51
AC	yyds (杨骐嘉)	14ms	7 MiB		165 Bytes	2023-10-27 19:00:22
AC	yixingyou	14ms	408 KiB		220 Bytes	2022-9-17 17:33:13
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	512 KiB		147 Bytes	2023-4-30 16:51:58
AC	时代2校-程俊燃 (chengjunran)	14ms	6.9 MiB		183 Bytes	2023-8-20 22:17:45