爬楼梯

状态	递交者	时间	内存	代码	递交时间
AC	徐正旺 (xzw)	29ms	7.5 MiB	243 Bytes	2023-5-19 19:44:04
AC	只因 (yubohang23002)	29ms	6.9 MiB	254 Bytes	2023-6-13 20:45:58
AC	zhuqiwei22006	29ms	8.2 MiB	233 Bytes	2022-11-6 19:09:03
AC	奇怪的正义人！ (leweiqi)	29ms	8.2 MiB	411 Bytes	2022-7-17 16:38:55
AC	RanHao	29ms	6.7 MiB	308 Bytes	2023-8-9 11:11:19
AC	偽艺術家 (chenyanchi22006)	29ms	8.2 MiB	263 Bytes	2022-11-6 19:01:38
AC	坤坤荔枝小黑子 (zhonghaotian22006)	29ms	8.2 MiB	306 Bytes	2022-11-6 19:08:21
AC	偽艺術家 (chenyanchi22006)	29ms	8.2 MiB	263 Bytes	2022-11-6 19:08:12
AC	关博源	29ms	7.7 MiB	309 Bytes	2023-4-8 14:53:33
AC	偽艺術家 (chenyanchi22006)	29ms	8.2 MiB	263 Bytes	2022-11-6 19:08:09
AC	坤坤荔枝小黑子 (zhonghaotian22006)	29ms	8.2 MiB	306 Bytes	2022-11-6 19:02:18
AC	朱老师 (zyp)	29ms	6.9 MiB	451 Bytes	2023-6-14 21:21:38
AC	dengduxi	29ms	8 MiB	283 Bytes	2022-12-18 14:52:00
AC	偽艺術家 (chenyanchi22006)	29ms	8.2 MiB	263 Bytes	2022-11-6 19:08:07
AC	ywh	29ms	7.8 MiB	296 Bytes	2022-6-30 15:46:17
AC	偽艺術家 (chenyanchi22006)	29ms	8.2 MiB	263 Bytes	2022-11-6 19:08:15
AC	余晨浩 (yuchenhao)	29ms	7.9 MiB	294 Bytes	2022-12-18 15:17:04
AC	不怎么聪明的家伙 (贺俊楠)	29ms	6.9 MiB	308 Bytes	2023-10-22 18:42:20
AC	坤坤荔枝小黑子 (zhonghaotian22006)	30ms	8.2 MiB	306 Bytes	2022-10-31 18:37:54
AC	maobohan	30ms	6.8 MiB	303 Bytes	2023-9-23 11:08:51
AC	zhangheyi22006	30ms	8.2 MiB	293 Bytes	2022-11-6 19:07:39
AC	hyh22031	30ms	7 MiB	253 Bytes	2023-11-12 9:30:41
AC	dengduxi	30ms	8 MiB	283 Bytes	2022-12-18 15:10:28
AC	叶雨昊 (yeyuhao22006)	30ms	8 MiB	234 Bytes	2022-11-6 19:11:22
AC	偽艺術家 (chenyanchi22006)	30ms	8.2 MiB	263 Bytes	2022-11-6 19:08:10
AC	王乐仪	30ms	8.1 MiB	322 Bytes	2022-2-4 15:02:11
AC	scallway	30ms	7.8 MiB	339 Bytes	2023-2-2 20:51:16
AC	luosifu22006	30ms	8 MiB	275 Bytes	2022-11-6 19:09:27
AC	xiongxinyao	30ms	7.8 MiB	383 Bytes	2022-7-1 9:21:28
AC	坤坤荔枝小黑子 (zhonghaotian22006)	30ms	8.2 MiB	306 Bytes	2022-11-6 19:08:21
AC	scallway	30ms	7.7 MiB	339 Bytes	2023-4-1 16:13:10
AC	任舒尧	30ms	8.2 MiB	279 Bytes	2022-10-21 21:01:32
AC	偽艺術家 (chenyanchi22006)	30ms	8.2 MiB	263 Bytes	2022-11-6 19:08:14
AC	黄梓桐 (HuangZiTong)	30ms	8.2 MiB	231 Bytes	2022-11-5 19:37:17
AC	刘政君 (lzj)	30ms	8.2 MiB	387 Bytes	2022-10-21 20:50:29
AC	dengduxi	30ms	8 MiB	283 Bytes	2022-12-18 14:50:55
AC	朱老师 (zyp)	30ms	8.2 MiB	300 Bytes	2022-11-6 19:05:53
AC	徐子恩 (Cow)	30ms	8 MiB	446 Bytes	2022-7-7 20:13:21
AC	wangjunhan	30ms	8.2 MiB	304 Bytes	2022-10-29 16:15:20
AC	luosifu22006	30ms	8.1 MiB	275 Bytes	2022-11-6 19:09:22
AC	dengduxi	30ms	8 MiB	282 Bytes	2022-12-18 14:49:40
AC	luosifu22006	30ms	8.1 MiB	275 Bytes	2022-11-6 19:09:21
AC	yyds (杨骐嘉)	30ms	6.7 MiB	295 Bytes	2023-8-16 17:37:50
AC	周琪渃	30ms	7.4 MiB	330 Bytes	2023-5-20 18:00:16
AC	luosifu22006	30ms	8 MiB	275 Bytes	2022-11-6 19:09:25
AC	徐康景 (dcm)	30ms	8 MiB	326 Bytes	2022-12-17 11:06:59
AC	偽艺術家 (chenyanchi22006)	30ms	8.2 MiB	263 Bytes	2022-11-6 19:08:13
AC	李树崑 (lishukun)	30ms	8.2 MiB	248 Bytes	2022-8-19 21:28:46
AC	金沙校区-蓝祥与 (蓝祥与)	30ms	7 MiB	289 Bytes	2023-5-27 16:43:36
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	7.2 MiB	306 Bytes	2023-5-27 16:14:41
AC	偽艺術家 (chenyanchi22006)	30ms	8.2 MiB	263 Bytes	2022-11-6 19:08:10
AC	李禹衡 (liyuheng22006)	30ms	8.2 MiB	245 Bytes	2022-11-6 19:07:24
AC	luosifu22006	30ms	8.1 MiB	275 Bytes	2022-11-6 19:09:24
AC	郭人瑀1	30ms	8.2 MiB	264 Bytes	2022-9-17 15:39:08
AC	luoluonuoya	30ms	7.8 MiB	400 Bytes	2022-6-24 16:17:50
AC	cupy战士 (05c05-dkf)	30ms	7.7 MiB	269 Bytes	2023-4-9 16:21:20
AC	代尚函笛卡尔 (daishanghan)	30ms	8 MiB	297 Bytes	2022-12-18 15:07:08
AC	陈风亦 (chenfengyi)	30ms	8 MiB	244 Bytes	2022-12-11 19:50:22
AC	爱琴海校区-刁钲洋 (刁钲洋)	30ms	6.8 MiB	247 Bytes	2023-6-18 15:11:21
AC	zhm123	30ms	8 MiB	275 Bytes	2022-12-16 14:49:33
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	30ms	7 MiB	280 Bytes	2023-5-28 10:07:52
AC	luosifu22006	30ms	8 MiB	275 Bytes	2022-11-6 19:09:27
AC	希蒙 (zhengxingya)	31ms	6.7 MiB	419 Bytes	2023-9-2 10:14:24
AC	周靖松 (ZhouJS)	31ms	6.9 MiB	405 Bytes	2023-5-30 22:18:30
AC	我是个s* (lijinze)	31ms	7.1 MiB	254 Bytes	2023-5-27 16:39:51
AC	Billy52013 (李子轩)	31ms	6.7 MiB	283 Bytes	2023-8-23 18:24:12
AC	朱老师 (zyp)	31ms	8.2 MiB	248 Bytes	2022-7-16 14:38:17
AC	时代一校 - 冯隆浩 (冯隆浩)	31ms	8.2 MiB	227 Bytes	2022-10-29 19:06:51
AC	scallway	31ms	6.7 MiB	286 Bytes	2023-7-9 18:55:59
AC	罗伟杰1	31ms	8.2 MiB	280 Bytes	2022-9-17 15:37:19
AC	偽艺術家 (chenyanchi22006)	31ms	8.2 MiB	263 Bytes	2022-11-6 19:08:12
AC	徐康景 (dcm)	31ms	8 MiB	323 Bytes	2022-12-9 22:59:20
AC	偽艺術家 (chenyanchi22006)	31ms	8.2 MiB	263 Bytes	2022-11-6 19:08:09
AC	zhangheyi22006	31ms	8.2 MiB	293 Bytes	2022-11-6 19:07:24
AC	luosifu22006	31ms	8 MiB	275 Bytes	2022-11-6 19:09:26
AC	scallway	31ms	6.7 MiB	336 Bytes	2023-7-9 18:53:52
AC	renqiumo	31ms	7.8 MiB	463 Bytes	2022-5-1 14:04:02
AC	偽艺術家 (chenyanchi22006)	31ms	8.2 MiB	263 Bytes	2022-11-6 19:08:13
AC	徐正旺 (xzw)	31ms	7.6 MiB	243 Bytes	2023-5-19 19:15:57
AC	芒苒忧 (廖迦南)	31ms	8.1 MiB	279 Bytes	2022-3-13 16:32:08
AC	zhangheyi22006	31ms	6.8 MiB	255 Bytes	2023-6-15 18:36:37
AC	偽艺術家 (chenyanchi22006)	31ms	8.2 MiB	263 Bytes	2022-11-6 19:08:06
AC	乐瀚阳 (yuehanyang)	31ms	6.8 MiB	342 Bytes	2023-6-15 19:24:54
AC	luosifu22006	31ms	8 MiB	275 Bytes	2022-11-6 19:09:29
AC	没有此人 (akm)	31ms	7.7 MiB	318 Bytes	2023-4-29 16:54:42
AC	偽艺術家 (chenyanchi22006)	31ms	8.2 MiB	263 Bytes	2022-11-6 19:08:21
AC	偽艺術家 (chenyanchi22006)	31ms	8.2 MiB	263 Bytes	2022-11-6 19:08:09
AC	唐嘉文	31ms	8.2 MiB	307 Bytes	2022-9-17 15:35:57
AC	dhm	31ms	7.7 MiB	365 Bytes	2023-3-5 14:27:08
AC	姚宏逸	31ms	8.2 MiB	378 Bytes	2022-10-30 9:44:29
AC	偽艺術家 (chenyanchi22006)	31ms	8.2 MiB	263 Bytes	2022-11-6 19:08:11
AC	05c30-dyh	31ms	8.1 MiB	295 Bytes	2022-3-26 16:03:26
AC	scallway	31ms	7.7 MiB	339 Bytes	2023-2-25 21:22:09
AC	姚宏逸	31ms	8.2 MiB	278 Bytes	2022-9-17 15:34:53
AC	时代一校-王宥量 (wangyouliang)	31ms	7.8 MiB	342 Bytes	2023-2-2 21:01:41
AC	luosifu22006	31ms	8.1 MiB	275 Bytes	2022-11-6 19:09:24
AC	_PXY_	31ms	8.1 MiB	309 Bytes	2022-1-23 14:23:45
AC	刘致言	32ms	8.2 MiB	242 Bytes	2022-10-21 21:21:27
AC	赵一嵘 (zhaoyirong)	32ms	7.7 MiB	284 Bytes	2023-5-10 19:14:09
AC	luosifu22006	32ms	8.1 MiB	275 Bytes	2022-11-6 19:09:23