【深基7.习8】猴子吃桃

状态	递交者	时间	内存	语言	代码	递交时间
AC	葛琮扬	12ms	384 KiB		198 Bytes	2022-2-26 15:51:41
AC	谢欣霖 (xiexinlin)	13ms	312 KiB		203 Bytes	2022-2-26 15:29:09
AC	李山水	13ms	256 KiB		194 Bytes	2022-2-10 10:02:37
AC	某某 (xuhaotian)	14ms	256 KiB		203 Bytes	2022-2-26 15:34:40
AC	姚宏逸	15ms	384 KiB	C	230 Bytes	2022-2-2 23:49:23
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB		174 Bytes	2023-12-12 11:18:46
AC	xiongxinyao	19ms	312 KiB		170 Bytes	2022-11-10 20:53:43
AC	Guest	24ms	6.9 MiB	C++98(O2)	125 Bytes	2024-8-22 21:53:57
AC	老六在此	24ms	6.5 MiB	C++20	190 Bytes	2024-7-21 17:56:22
AC	旷山 (15213268688)	25ms	384 KiB		165 Bytes	2022-7-1 21:36:45
AC	张瑞博	25ms	6.6 MiB	C++11	165 Bytes	2024-7-28 14:40:49
AC	Nico	25ms	6.5 MiB	C++11	186 Bytes	2024-7-21 17:55:31
AC	肖添宇	25ms	384 KiB		221 Bytes	2022-5-14 16:51:57
AC	stehpen_zuo	25ms	6.8 MiB	C++20	196 Bytes	2024-8-7 18:17:38
AC	zcx	26ms	392 KiB		158 Bytes	2023-5-15 19:46:25
AC	Guest	26ms	6.6 MiB	C++98(O2)	147 Bytes	2024-7-27 17:43:22
AC	李树崑 (lishukun)	26ms	396 KiB		211 Bytes	2022-5-9 19:52:43
AC	贾鑫豪 (Mr Sam)	26ms	384 KiB		156 Bytes	2022-4-23 17:31:02
AC	林小博	26ms	384 KiB		192 Bytes	2022-6-11 11:09:57
AC	Randy Marsh (杨子腾)	26ms	392 KiB		156 Bytes	2022-6-23 19:03:48
AC	邹智吉	26ms	6.9 MiB	C++98	205 Bytes	2024-5-19 15:43:06
AC	苏庭毅	26ms	384 KiB		152 Bytes	2023-4-8 18:10:56
AC	Guest	26ms	6.6 MiB	C++98(O2)	180 Bytes	2024-7-27 17:47:09
AC	jdy	26ms	384 KiB		131 Bytes	2022-5-14 9:21:12
AC	胡程禹	26ms	384 KiB		160 Bytes	2023-4-8 18:17:02
AC	冒牌陈杰晟【MOD】 (wed)	26ms	392 KiB		201 Bytes	2022-4-10 17:46:48
AC	苏庭毅	26ms	392 KiB		152 Bytes	2023-4-1 20:57:00
AC	renqiumo	26ms	384 KiB		357 Bytes	2022-4-10 16:01:38
AC	曹埊睿 (caodirui)	26ms	420 KiB		167 Bytes	2023-4-19 22:31:16
AC	中岛敦 (黄麒瑞)	26ms	6.8 MiB		211 Bytes	2023-10-3 15:55:51
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	26ms	6.8 MiB	C++98	146 Bytes	2024-8-3 21:23:37
AC	陈杰晟	27ms	384 KiB		186 Bytes	2022-5-29 11:01:24
AC	曾御城（现用名） (Jason)	27ms	384 KiB		328 Bytes	2022-7-25 19:44:23
AC	苏庭毅	27ms	392 KiB		152 Bytes	2023-4-1 20:57:04
AC	没有此人 (akm)	27ms	384 KiB		202 Bytes	2023-4-22 18:22:08
AC	22029-hqh	27ms	384 KiB		188 Bytes	2023-5-14 10:39:04
AC	yxj	27ms	384 KiB		240 Bytes	2022-2-26 15:27:08
AC	苏庭毅	27ms	384 KiB		152 Bytes	2023-4-1 20:57:07
AC	苏庭毅	27ms	384 KiB		152 Bytes	2023-4-1 20:56:55
AC	kql1	27ms	7.1 MiB	C++98	249 Bytes	2024-5-9 13:36:07
AC	杜是贤 (dushixian)	27ms	416 KiB		187 Bytes	2022-7-1 15:58:00
AC	zry	27ms	396 KiB		232 Bytes	2022-2-26 15:47:49
AC	22029-lyh	27ms	512 KiB		172 Bytes	2023-5-17 18:35:04
AC	Jose (反恐皮蛋)	27ms	436 KiB		335 Bytes	2022-7-27 8:31:28
AC	pandap&a王皓宸 (WANGHAOCHEN)	27ms	436 KiB		153 Bytes	2023-2-24 18:37:11
AC	1396013295	27ms	392 KiB		187 Bytes	2022-1-23 19:15:03
AC	22029-hqh	27ms	384 KiB		188 Bytes	2023-5-14 10:39:00
AC	TBB (杜昊燃)	27ms	512 KiB		257 Bytes	2022-5-21 10:17:12
AC	徐子恩 (Cow)	27ms	512 KiB		160 Bytes	2022-7-7 20:06:11
AC	苏庭毅	27ms	384 KiB		152 Bytes	2023-4-8 18:10:55
AC	MoonLight ( aaa)	27ms	384 KiB		171 Bytes	2022-1-15 11:26:52
AC	05c30-wyr	27ms	384 KiB		244 Bytes	2022-2-26 15:48:51
AC	文硕 (文硕1)	27ms	384 KiB		181 Bytes	2022-2-6 14:20:49
AC	lyx2000pro	27ms	392 KiB		219 Bytes	2022-2-26 15:50:21
AC	苏庭毅	27ms	392 KiB		152 Bytes	2023-4-8 18:10:12
AC	喵 (蹇心悦)	27ms	384 KiB		157 Bytes	2022-5-21 15:27:49
AC	苏庭毅	27ms	416 KiB		152 Bytes	2023-4-8 18:10:11
AC	苏庭毅	27ms	384 KiB		152 Bytes	2023-4-1 20:57:05
AC	wangzihang	27ms	432 KiB	C++	204 Bytes	2022-8-6 10:02:34
AC	苏庭毅	27ms	384 KiB		152 Bytes	2023-4-1 20:57:06
AC	苏庭毅	27ms	392 KiB		152 Bytes	2023-4-1 20:57:07
AC	樊竣熠 (lft1114)	27ms	444 KiB		155 Bytes	2022-6-6 18:18:47
AC	钟京润	27ms	384 KiB		176 Bytes	2022-5-21 15:35:11
AC	疯神芭芭脱丝 (李卓修)	27ms	512 KiB		233 Bytes	2022-6-9 19:50:59
AC	miku (阳沐珊)	27ms	384 KiB		202 Bytes	2023-4-8 18:10:45
AC	苏庭毅	27ms	384 KiB		152 Bytes	2023-4-8 18:10:57
AC	苏庭毅	27ms	432 KiB		152 Bytes	2023-4-1 20:57:06
AC	曹烜豪	27ms	512 KiB		163 Bytes	2023-4-8 18:20:12
AC	苏庭毅	27ms	384 KiB		152 Bytes	2023-4-8 18:10:00
AC	江坤锜	27ms	392 KiB		169 Bytes	2023-4-8 18:16:57
AC	苏庭毅	28ms	384 KiB		152 Bytes	2023-4-8 18:10:55
AC	汤杰尧 (05c05-tjy1)	28ms	512 KiB		176 Bytes	2023-2-16 15:06:01
AC	苏庭毅	28ms	392 KiB		152 Bytes	2023-4-8 18:10:18
AC	张梓浩 (zhangzihao)	28ms	384 KiB		188 Bytes	2023-3-29 20:57:22
AC	watcc	28ms	420 KiB		198 Bytes	2023-5-24 19:36:28
AC	第五人格启动 (罗子键)	28ms	384 KiB		155 Bytes	2023-4-8 18:30:57
AC	王晨志 (wangchenzhi)	28ms	384 KiB		443 Bytes	2022-2-1 1:51:03
AC	朱泽晟	28ms	392 KiB		159 Bytes	2022-1-18 21:23:17
AC	huanglu	28ms	440 KiB		187 Bytes	2022-7-14 10:26:18
AC	在煎鱼的肖大总铳 (肖宇航)	28ms	6.8 MiB		197 Bytes	2023-10-12 22:07:06
AC	王韵淮	28ms	392 KiB		156 Bytes	2022-4-11 21:08:24
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	28ms	512 KiB		170 Bytes	2022-12-4 10:44:44
AC	xiangsiyu	28ms	432 KiB		169 Bytes	2022-7-12 21:43:15
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)	28ms	444 KiB		189 Bytes	2023-5-20 11:56:27
AC	苏庭毅	28ms	388 KiB		152 Bytes	2023-4-8 18:10:11
AC	赵泳鑫 (zhaoyongxin)	28ms	512 KiB		162 Bytes	2022-3-17 18:53:22
AC	lch (凌昌瀚)	28ms	512 KiB		164 Bytes	2022-8-4 16:04:10
AC	苏庭毅	28ms	392 KiB		152 Bytes	2023-4-8 18:10:15
AC	苏庭毅	28ms	384 KiB		152 Bytes	2023-4-8 18:10:55
AC	苏庭毅	28ms	412 KiB		152 Bytes	2023-4-1 20:57:06
AC	My name is Man (钟卓劭)	28ms	7.2 MiB	C++98	156 Bytes	2024-4-26 17:51:17
AC	huyinuo	28ms	512 KiB		172 Bytes	2022-7-17 21:17:38
AC	苏庭毅	28ms	384 KiB		152 Bytes	2023-4-8 18:10:09
AC	汪致卉 (wangzh)	28ms	440 KiB		201 Bytes	2022-2-18 18:27:01
AC	王乐仪	28ms	384 KiB		170 Bytes	2022-2-4 15:20:19
AC	zhouzipu	28ms	440 KiB		273 Bytes	2022-8-17 14:18:27
AC	朱老师 (zyp)	28ms	384 KiB		247 Bytes	2022-10-1 19:35:45
AC	zhangheyi22006	28ms	404 KiB		191 Bytes	2022-11-7 20:45:03
AC	徐正旺 (xzw)	28ms	7 MiB		231 Bytes	2023-7-15 15:57:26
AC	hyh22031	28ms	384 KiB		166 Bytes	2022-12-4 10:48:58