小鱼比可爱

状态	递交者	时间	内存	语言	代码	递交时间
AC	周浩楠 (开朗的周好难)	29ms	7.3 MiB		282 Bytes	2023-10-28 11:39:12
AC	zzl	29ms	6.8 MiB		292 Bytes	2023-11-7 1:11:49
AC	罗竣瀚	29ms	412 KiB		238 Bytes	2023-4-8 15:49:52
AC	甄一阳 (22016-zyy)	29ms	392 KiB		279 Bytes	2022-11-27 11:41:55
AC	scallway	29ms	392 KiB		279 Bytes	2022-11-19 17:25:24
AC	傅博涛	29ms	436 KiB		270 Bytes	2022-1-22 11:34:04
AC	朱泽晟	29ms	424 KiB		332 Bytes	2022-8-31 16:00:10
AC	希蒙 (zhengxingya)	29ms	6.8 MiB		256 Bytes	2023-10-11 17:00:43
AC	陈杰晟	29ms	512 KiB		292 Bytes	2022-3-24 15:16:40
AC	金沙—彭智宸 (彭智宸)	29ms	7.1 MiB		304 Bytes	2023-10-28 11:59:00
AC	LZN_mwll	29ms	436 KiB		368 Bytes	2022-2-19 11:02:21
AC	时代1校-杨宇轩 (杨宇轩)	29ms	6.7 MiB		268 Bytes	2023-8-22 12:31:21
AC	贺睿林	29ms	6.9 MiB		349 Bytes	2023-10-28 11:32:26
AC	leisixian (22029-lyh)	29ms	384 KiB		315 Bytes	2023-1-7 11:43:03
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	29ms	6.7 MiB		467 Bytes	2023-8-28 20:12:45
AC	三差学生(尘埃蓝莓) (白佳睿)	29ms	6.9 MiB		328 Bytes	2023-8-13 10:09:48
AC	zvt_132 (任子轩)	30ms	6.7 MiB		238 Bytes	2023-9-3 20:10:13
AC	周琪渃	30ms	428 KiB		389 Bytes	2023-3-19 21:39:26
AC	繁星 (05c35-zzm)	30ms	512 KiB		439 Bytes	2022-11-30 21:26:35
AC	canna	30ms	6.8 MiB		387 Bytes	2023-10-17 12:19:52
AC	zhouzipu	30ms	440 KiB		321 Bytes	2022-2-19 9:16:50
AC	伍行念 (wuxingnian)	30ms	6.8 MiB		345 Bytes	2023-10-8 11:15:38
AC	17779	30ms	512 KiB		319 Bytes	2022-3-17 16:19:49
AC	蒲梓勋 (puzixun)	30ms	6.9 MiB		247 Bytes	2023-8-14 22:38:15
AC	祝熙承 (zxc)	30ms	384 KiB		449 Bytes	2023-3-11 13:53:07
AC	jdy	30ms	512 KiB		354 Bytes	2023-2-19 15:30:10
AC	坤坤荔枝小黑子 (zhonghaotian22006)	30ms	512 KiB		340 Bytes	2022-11-24 21:55:42
AC	什蒂尔布 (吴东航)	30ms	444 KiB		331 Bytes	2023-3-11 13:30:40
AC	许嘉恩 (xje22031)	30ms	392 KiB		288 Bytes	2023-1-10 9:24:57
AC	ganlin1	30ms	6.9 MiB		226 Bytes	2023-7-27 12:42:47
AC	zzy	30ms	388 KiB		317 Bytes	2023-3-11 13:54:07
AC	新壹街校区-吴鑫鹏 (吴鑫鹏)	30ms	392 KiB		291 Bytes	2023-3-11 13:54:59
AC	scallway	30ms	444 KiB		272 Bytes	2022-11-19 11:56:09
AC	wuqilin	30ms	544 KiB		281 Bytes	2023-4-1 10:32:41
AC	11451254188 (22029-mjh)	30ms	428 KiB		308 Bytes	2023-3-4 21:20:27
AC	陈璟志 (cjz)	30ms	6.8 MiB		315 Bytes	2023-10-13 20:49:24
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	30ms	512 KiB		277 Bytes	2023-1-10 9:28:16
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)	30ms	384 KiB		368 Bytes	2023-1-7 11:44:37
AC	zhuziyu	30ms	768 KiB		328 Bytes	2022-2-19 9:31:03
AC	yuandingyang22031	30ms	384 KiB		300 Bytes	2023-1-10 9:24:12
AC	胡瀚文	30ms	416 KiB		269 Bytes	2022-7-18 11:36:22
AC	孙烽轶 (sfy)	31ms	512 KiB		245 Bytes	2023-4-29 16:32:01
AC	leisixian (22029-lyh)	31ms	392 KiB		315 Bytes	2023-1-7 11:44:24
AC	朱老师 (zyp)	31ms	512 KiB		293 Bytes	2022-8-7 10:41:13
AC	chenxiaozhun	31ms	512 KiB		308 Bytes	2023-3-11 13:52:17
AC	爱情海校区—沙天一 (沙天一)	31ms	7.1 MiB		267 Bytes	2023-7-9 9:29:56
AC	李晨希	31ms	6.9 MiB		377 Bytes	2023-6-28 10:56:27
AC	huanglu	31ms	6.9 MiB		291 Bytes	2023-7-18 14:17:30
AC	ylc	31ms	384 KiB		297 Bytes	2023-3-11 13:54:29
AC	ttt123	31ms	412 KiB		350 Bytes	2023-1-7 11:41:28
AC	李廷旭 (litingxu)	31ms	6.7 MiB		273 Bytes	2023-9-13 19:39:52
AC	lch (凌昌瀚)	31ms	432 KiB		286 Bytes	2022-8-25 16:38:33
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	31ms	384 KiB		290 Bytes	2023-1-7 11:42:25
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	31ms	384 KiB		277 Bytes	2023-1-10 9:30:23
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	31ms	512 KiB		329 Bytes	2023-2-3 18:14:36
AC	执剑人罗辑 (Jasson)	31ms	832 KiB		263 Bytes	2023-4-22 14:53:05
AC	时代校区-刘臣原 (微笑王子)	31ms	384 KiB		322 Bytes	2022-9-3 20:21:39
AC	RanHao	31ms	6.9 MiB		401 Bytes	2023-7-22 18:48:47
AC	leisixian (22029-lyh)	31ms	384 KiB		315 Bytes	2023-1-7 11:44:23
AC	周琪渃	31ms	440 KiB		343 Bytes	2023-3-19 21:38:33
AC	我很6 (zjj22031)	31ms	384 KiB		245 Bytes	2023-1-10 9:19:36
AC	刘蕤箎	31ms	7.1 MiB		259 Bytes	2023-10-21 11:51:08
AC	22029-lsl	31ms	384 KiB		277 Bytes	2023-1-7 11:42:29
AC	zcx	32ms	384 KiB		271 Bytes	2023-1-7 11:42:50
AC	huyinuo	32ms	512 KiB		350 Bytes	2022-8-22 11:34:10
AC	炸鱼4000+ (dxc)	32ms	6.7 MiB		386 Bytes	2023-9-23 19:07:32
AC	李树崑 (lishukun)	32ms	512 KiB		395 Bytes	2022-11-16 14:19:44
AC	Nico	32ms	6.8 MiB		292 Bytes	2023-6-22 11:26:12
AC	leisixian (22029-lyh)	32ms	512 KiB		334 Bytes	2023-1-7 11:43:30
AC	leisixian (22029-lyh)	32ms	384 KiB		315 Bytes	2023-1-7 11:44:24
AC	Tender. (05c05-zhou)	32ms	432 KiB		276 Bytes	2022-10-18 11:35:37
AC	leisixian (22029-lyh)	32ms	392 KiB		315 Bytes	2023-1-7 11:44:23
AC	leisixian (22029-lyh)	32ms	404 KiB		315 Bytes	2023-1-7 11:44:24
AC	https://www.minecraft.net/zh-hans (王振西)	32ms	7 MiB		450 Bytes	2023-6-17 11:40:10
AC	colin1112 (墙凌可)	32ms	512 KiB		321 Bytes	2023-3-18 15:03:07
AC	chenrunxiang22031	32ms	392 KiB		307 Bytes	2023-1-10 9:25:20
AC	陈泰羽 (chentaiyu)	32ms	436 KiB		281 Bytes	2023-3-10 20:45:05
AC	时代二校-陈天成 (鸭缩毛巾)	32ms	6.9 MiB		266 Bytes	2023-7-31 22:55:02
AC	Jack	33ms	424 KiB		385 Bytes	2023-1-11 9:24:09
AC	冒牌陈杰晟【MOD】 (wed)	33ms	1.2 MiB		295 Bytes	2022-3-11 20:18:02
AC	CK (李弘毅)	33ms	512 KiB		335 Bytes	2022-11-22 11:23:42
AC	朱老师 (zyp)	33ms	512 KiB		340 Bytes	2023-1-10 9:19:15
AC	zhm123	33ms	384 KiB		250 Bytes	2022-11-16 18:31:29
AC	葛琮扬	33ms	6.9 MiB		264 Bytes	2023-8-4 15:40:20
AC	wangjun	34ms	6.9 MiB		271 Bytes	2023-11-29 20:15:48
AC	时代一校-赵彦博 (zyb)	34ms	6.9 MiB		346 Bytes	2023-8-5 20:43:48
AC	黄梓轩 (huangzixuan)	34ms	432 KiB		359 Bytes	2022-11-28 17:44:46
AC	时代2校-程俊燃 (chengjunran)	34ms	7.3 MiB		295 Bytes	2024-1-20 18:27:20
AC	郑岐蔚	34ms	428 KiB		309 Bytes	2023-1-26 14:34:32
AC	新壹街—熊轩杭 (xiongxuanhang)	35ms	7.3 MiB		305 Bytes	2024-1-4 20:05:03
AC	任远宁 (renyuanning)	36ms	520 KiB		379 Bytes	2023-1-21 19:16:53
AC	新壹街校区--税崇峻 (税崇峻)	36ms	6.7 MiB		253 Bytes	2023-8-23 21:14:36
AC	你猜呀	37ms	512 KiB		247 Bytes	2023-5-25 20:16:56
AC	chenjunyao	38ms	7 MiB		294 Bytes	2023-12-29 12:55:08
AC	22029-zjs	40ms	384 KiB		334 Bytes	2023-1-7 11:43:31
AC	罗子琪	43ms	7 MiB		320 Bytes	2023-12-8 20:27:26
AC	金沙-文豪 (wenhao)	127ms	764 KiB		271 Bytes	2024-3-3 18:04:48
AC	lizishuo	130ms	536 KiB		257 Bytes	2024-2-22 17:45:06
AC	赵耘毅	131ms	764 KiB	C++98	476 Bytes	2025-1-11 20:05:31
AC	sunsihan	132ms	548 KiB		329 Bytes	2024-3-16 10:59:44