苹果和虫子

状态	递交者	时间	内存	代码	递交时间
AC	lihaoyi	28ms	384 KiB	199 Bytes	2022-10-16 11:09:56
AC	六 (江智昕)	28ms	384 KiB	240 Bytes	2022-12-30 20:04:25
AC	SHY20091224	28ms	512 KiB	117 Bytes	2022-8-21 14:37:59
AC	新壹街校区-陈品烨 (陈品烨)	28ms	6.7 MiB	179 Bytes	2023-10-1 11:00:19
AC	杜雨泽	28ms	7.3 MiB	171 Bytes	2024-1-21 14:35:48
AC	陈廷恩	28ms	6.8 MiB	178 Bytes	2023-10-13 19:50:35
AC	yanglang	28ms	392 KiB	168 Bytes	2022-10-21 16:15:43
AC	SHY20091224	28ms	384 KiB	117 Bytes	2022-8-21 14:38:08
AC	秦子皓 (刘晓川)	29ms	384 KiB	110 Bytes	2022-10-15 17:09:43
AC	冯晨旭	29ms	7 MiB	151 Bytes	2023-10-28 9:53:17
AC	任希贤	29ms	440 KiB	127 Bytes	2023-2-25 18:54:27
AC	许炜铭 (xuweiming)	29ms	512 KiB	241 Bytes	2023-5-16 21:31:50
AC	huanglu	29ms	440 KiB	184 Bytes	2022-6-9 17:22:43
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:24
AC	chen (peter)	29ms	432 KiB	162 Bytes	2022-7-19 10:59:04
AC	在煎鱼的肖大总铳 (肖宇航)	29ms	6.9 MiB	208 Bytes	2023-9-24 10:51:58
AC	SHY20091224	29ms	384 KiB	117 Bytes	2022-8-21 14:38:04
AC	叶哲宇 (yzy)	29ms	392 KiB	165 Bytes	2023-4-8 15:50:10
AC	明哲瀚 (18580067605)	29ms	384 KiB	119 Bytes	2022-10-15 16:58:21
AC	贾博涵	29ms	6.8 MiB	115 Bytes	2023-11-6 16:01:27
AC	李山水	29ms	392 KiB	204 Bytes	2022-3-12 19:04:54
AC	谢博文	29ms	512 KiB	225 Bytes	2022-6-28 11:48:52
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:25
AC	秦子越 (13883322087)	29ms	416 KiB	175 Bytes	2022-2-8 18:35:12
AC	呵呵呵 (陈思琦)	29ms	484 KiB	166 Bytes	2022-9-7 19:40:39
AC	邹曜丞 (13983097018)	29ms	512 KiB	155 Bytes	2023-4-21 20:45:14
AC	scallway1	29ms	384 KiB	182 Bytes	2023-3-7 20:41:38
AC	SHY20091224	29ms	384 KiB	117 Bytes	2022-8-21 14:38:01
AC	我很6 (zjj22031)	29ms	404 KiB	187 Bytes	2022-12-2 13:57:57
AC	时代二校-陈天成 (鸭缩毛巾)	29ms	440 KiB	173 Bytes	2023-4-30 16:28:00
AC	黄梓桐 (HuangZiTong)	29ms	436 KiB	110 Bytes	2023-2-1 15:02:18
AC	冒牌陈杰晟【MOD】 (wed)	29ms	512 KiB	112 Bytes	2022-2-26 12:03:11
AC	王玺懿 (wxy)	29ms	512 KiB	112 Bytes	2022-7-29 13:50:15
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:21
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:23
AC	杨淇瑞 (杨淇瑞29)	29ms	6.8 MiB	184 Bytes	2023-10-9 19:56:51
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:24
AC	SHY20091224	29ms	384 KiB	117 Bytes	2022-8-21 14:38:01
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)	29ms	384 KiB	134 Bytes	2022-10-16 16:13:24
AC	老六（王牌） (mhc)	29ms	440 KiB	201 Bytes	2023-5-13 9:30:37
AC	时代二校-焦雨齐 (Angel)	29ms	384 KiB	128 Bytes	2023-3-11 18:52:38
AC	dengfeng	29ms	440 KiB	160 Bytes	2022-2-17 17:21:49
AC	南坪校区-郑力博 (zhenglibo23003)	29ms	512 KiB	289 Bytes	2023-2-25 18:45:57
AC	林昱霏	29ms	7.1 MiB	158 Bytes	2023-9-23 11:17:31
AC	疯神芭芭脱丝 (李卓修)	29ms	436 KiB	162 Bytes	2022-7-16 13:40:19
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	29ms	512 KiB	126 Bytes	2022-9-24 23:02:38
AC	马渝杭 (mayuhang)	29ms	384 KiB	211 Bytes	2023-3-21 18:59:59
AC	罗翌珂 (dangdang)	29ms	444 KiB	190 Bytes	2022-8-18 11:18:22
AC	邵冠铖 (shaoguancheng22031)	29ms	384 KiB	159 Bytes	2022-10-16 10:58:43
AC	yuchenyi23017	29ms	6.7 MiB	154 Bytes	2023-9-17 19:16:09
AC	李山水	29ms	420 KiB	204 Bytes	2022-3-12 19:04:54
AC	丛林 (conglin)	29ms	388 KiB	245 Bytes	2022-12-1 17:44:59
AC	SHY20091224	29ms	392 KiB	117 Bytes	2022-8-21 14:38:00
AC	zhangxiushi	29ms	384 KiB	114 Bytes	2022-8-26 20:57:46
AC	陈骏逸 (chenjunyi)	29ms	512 KiB	227 Bytes	2022-9-17 19:26:51
AC	ycy	29ms	512 KiB	269 Bytes	2022-9-14 20:18:45
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:24
AC	SHY20091224	29ms	384 KiB	117 Bytes	2022-8-21 14:38:02
AC	SB (mfy01)	29ms	440 KiB	181 Bytes	2022-12-2 13:39:44
AC	王祎辰 (wangyichen)	29ms	384 KiB	153 Bytes	2023-3-8 19:09:48
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:23
AC	田开蕊	29ms	6.9 MiB	157 Bytes	2023-10-28 9:52:41
AC	liulinqi1	29ms	384 KiB	158 Bytes	2022-10-15 17:11:04
AC	罗宇凡 (吴彦祖)	29ms	512 KiB	127 Bytes	2022-3-10 19:48:02
AC	0721 (龙浩恩)	29ms	6.9 MiB	188 Bytes	2023-10-28 18:07:51
AC	Randy Marsh (杨子腾)	29ms	384 KiB	181 Bytes	2022-9-28 19:09:31
AC	xyc (谢雨宸)	29ms	392 KiB	116 Bytes	2022-12-25 11:20:06
AC	六 (江智昕)	29ms	392 KiB	240 Bytes	2022-12-30 20:04:21
AC	叶雨昊 (yeyuhao22006)	29ms	384 KiB	106 Bytes	2023-1-7 17:56:18
AC	^_^ (ctc)	29ms	440 KiB	153 Bytes	2022-12-6 17:14:26
AC	yanxiaosong	29ms	512 KiB	117 Bytes	2022-11-5 13:47:55
AC	李某人	29ms	436 KiB	142 Bytes	2022-8-16 20:02:43
AC	中岛敦 (黄麒瑞)	29ms	6.7 MiB	147 Bytes	2023-9-30 21:25:17
AC	明哲瀚 (18580067605)	29ms	512 KiB	160 Bytes	2022-10-15 17:16:41
AC	WangXi	29ms	400 KiB	200 Bytes	2022-9-17 19:49:25
AC	六 (江智昕)	29ms	384 KiB	240 Bytes	2022-12-30 20:04:24
AC	lch (凌昌瀚)	29ms	432 KiB	168 Bytes	2022-8-25 16:37:14
AC	叶梓珺	29ms	6.7 MiB	161 Bytes	2023-9-23 13:36:24
AC	谁陪訫牞（杀手） (22029-zys)	29ms	480 KiB	105 Bytes	2022-10-19 21:27:44
AC	SHY20091224	30ms	384 KiB	117 Bytes	2022-8-21 14:37:59
AC	郑岐蔚	30ms	448 KiB	293 Bytes	2022-9-20 19:50:47
AC	六 (江智昕)	30ms	384 KiB	240 Bytes	2022-12-30 20:04:23
AC	zzl	30ms	440 KiB	162 Bytes	2023-1-3 18:02:30
AC	scallway	30ms	6.8 MiB	197 Bytes	2023-10-18 20:50:09
AC	吴俊成 (wujuncheng)	30ms	512 KiB	409 Bytes	2022-7-8 23:20:10
AC	欧俊阳	30ms	384 KiB	182 Bytes	2022-10-15 17:00:35
AC	六 (江智昕)	30ms	392 KiB	240 Bytes	2022-12-30 20:04:22
AC	张子扬	30ms	436 KiB	190 Bytes	2022-3-1 21:46:11
AC	SHY20091224	30ms	392 KiB	117 Bytes	2022-8-21 14:38:05
AC	司雨来 (siyulai)	30ms	512 KiB	172 Bytes	2022-10-6 16:37:46
AC	昌文迪 (05c05-cwd2)	30ms	436 KiB	204 Bytes	2022-12-3 11:16:45
AC	源著校区-宋昊成 (马冬梅)	30ms	392 KiB	183 Bytes	2023-2-25 17:46:02
AC	chaikexu	30ms	512 KiB	186 Bytes	2022-11-28 21:57:01
AC	蓝色妖姬 (jiangpeiyu)	30ms	432 KiB	119 Bytes	2022-10-23 13:32:32
AC	六 (江智昕)	30ms	384 KiB	240 Bytes	2022-12-30 20:04:23
AC	朱老师 (zyp)	30ms	392 KiB	212 Bytes	2022-10-16 11:02:27
AC	六 (江智昕)	30ms	384 KiB	240 Bytes	2022-12-30 20:04:24
AC	龙思颖 (lsy)	30ms	384 KiB	179 Bytes	2023-3-7 20:41:54
AC	余彦瑞	30ms	512 KiB	199 Bytes	2022-8-29 16:15:25
AC	六 (江智昕)	30ms	392 KiB	240 Bytes	2022-12-30 20:04:20