初次爬楼梯

状态	递交者	时间	内存	语言	代码	递交时间
AC	你猜呀	14ms	6.7 MiB		198 Bytes	2023-9-10 10:30:52
AC	芒苒忧 (廖迦南)	14ms	428 KiB		211 Bytes	2022-3-13 16:32:31
AC	何煜琦	14ms	7 MiB	C++11	175 Bytes	2024-8-24 13:40:08
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	384 KiB		211 Bytes	2023-5-31 21:45:45
AC	MoonLight ( aaa)	14ms	384 KiB		236 Bytes	2022-1-15 10:54:34
AC	bilbil	14ms	6.8 MiB		209 Bytes	2023-10-21 16:42:55
AC	My name is Man (钟卓劭)	14ms	6.8 MiB	C++98	198 Bytes	2024-8-5 11:20:48
AC	zzy	14ms	392 KiB		196 Bytes	2023-4-8 16:21:45
AC	中岛敦 (黄麒瑞)	14ms	6.7 MiB		207 Bytes	2023-9-29 9:01:55
AC	yu (赵子瑜)	14ms	512 KiB		172 Bytes	2022-5-8 17:20:01
AC	李山水	14ms	392 KiB		420 Bytes	2022-6-16 20:04:43
AC	偽艺術家 (chenyanchi22006)	14ms	384 KiB		199 Bytes	2022-11-30 20:09:58
AC	zhouzipu	14ms	436 KiB		290 Bytes	2022-8-17 15:24:41
AC	奇怪的正义人！ (leweiqi)	14ms	440 KiB		227 Bytes	2022-7-17 16:38:28
AC	yezhongyang	14ms	436 KiB		195 Bytes	2023-2-11 20:53:57
AC	曾御城（现用名） (Jason)	14ms	436 KiB		217 Bytes	2022-7-23 20:13:18
AC	11451254188 (22029-mjh)	14ms	6.8 MiB		229 Bytes	2023-10-2 11:09:25
AC	zjz	14ms	384 KiB		169 Bytes	2022-5-8 17:11:44
AC	周琪渃	14ms	512 KiB		216 Bytes	2023-3-9 18:33:10
AC	cupy战士 (05c05-dkf)	14ms	512 KiB		217 Bytes	2023-4-9 16:22:30
AC	时代二校-焦雨齐 (Angel)	14ms	6.9 MiB		205 Bytes	2023-10-21 16:36:15
AC	时代2校+涂彦迪 (tuyandi)	14ms	6.9 MiB		178 Bytes	2023-10-21 16:38:17
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	6.8 MiB		234 Bytes	2023-10-12 22:04:39
AC	朱老师 (zyp)	14ms	440 KiB		208 Bytes	2022-7-16 14:38:13
AC	xiongxinyao	14ms	440 KiB		503 Bytes	2022-6-25 10:15:11
AC	时代二校+王吕棪 (wanglvyan)	14ms	6.9 MiB		191 Bytes	2023-10-21 16:34:17
AC	何煜琦	14ms	7 MiB	C++11	385 Bytes	2024-8-24 13:39:43
AC	小根哥	14ms	384 KiB		418 Bytes	2022-8-29 16:03:19
AC	姚宏逸	14ms	436 KiB		966 Bytes	2022-3-2 18:51:52
AC	于宝泽 (于谋泽)	14ms	388 KiB		183 Bytes	2022-1-14 20:48:47
AC	李卓燃 (李卓燃1)	14ms	392 KiB		973 Bytes	2023-5-16 21:22:40
AC	luoluonuoya	14ms	512 KiB		252 Bytes	2022-8-12 15:54:21
AC	wangjun	14ms	6.9 MiB		221 Bytes	2023-11-18 12:59:55
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	14ms	384 KiB		216 Bytes	2022-4-30 18:34:13
AC	chenjunyao	14ms	6.7 MiB		307 Bytes	2023-8-25 16:31:45
AC	贾鑫豪 (Mr Sam)	14ms	444 KiB		396 Bytes	2022-3-1 20:35:39
AC	zzzrrrxxx	14ms	6.8 MiB		181 Bytes	2023-10-19 21:36:47
AC	maobohan	14ms	6.8 MiB		185 Bytes	2023-9-23 11:08:19
AC	Guest	14ms	6.9 MiB		260 Bytes	2023-11-19 22:48:51
AC	叶雨昊 (yeyuhao22006)	14ms	384 KiB		207 Bytes	2022-11-30 20:30:26
AC	huanglu	14ms	456 KiB		204 Bytes	2023-5-12 19:53:57
AC	可爱的小花狗	14ms	6.9 MiB		228 Bytes	2023-10-21 16:37:29
AC	huyinuo	14ms	444 KiB		229 Bytes	2022-11-28 14:32:42
AC	傅翊航 (fyh)	14ms	444 KiB		209 Bytes	2022-12-5 21:01:26
AC	张梓浩 (zhangzihao)	14ms	6.8 MiB		212 Bytes	2023-10-7 21:59:27
AC	我是傻逼	14ms	512 KiB		183 Bytes	2023-3-22 20:58:22
AC	xyc (谢雨宸)	14ms	6.7 MiB		212 Bytes	2023-9-27 20:38:47
AC	代尚函笛卡尔 (daishanghan)	14ms	384 KiB		262 Bytes	2022-10-31 21:32:07
AC	欧俊阳	14ms	6.7 MiB		921 Bytes	2023-8-25 13:22:47
AC	科比.布莱恩特 (董浩琰)	15ms	6.7 MiB		629 Bytes	2023-9-15 21:15:15
AC	小根哥	15ms	428 KiB		253 Bytes	2022-8-29 16:07:15
AC	时代2校+施皓宬 (shihaocheng)	15ms	6.9 MiB		244 Bytes	2023-10-21 16:37:12
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)	15ms	392 KiB		217 Bytes	2023-5-27 16:38:17
AC	邹曜丞 (13983097018)	15ms	7.2 MiB		203 Bytes	2023-11-4 16:54:16
AC	南坪校区-邵冠铖 (邵冠铖)	15ms	6.8 MiB		170 Bytes	2023-10-29 11:11:45
AC	叶雨昊 (yeyuhao22006)	15ms	384 KiB		254 Bytes	2022-11-30 20:18:17
AC	ttt123	15ms	512 KiB		190 Bytes	2023-4-8 22:10:10
AC	hyh22031	15ms	7 MiB		203 Bytes	2023-11-12 9:28:50
AC	杜俊宏	15ms	432 KiB		213 Bytes	2022-7-15 8:45:15
AC	范宜灵	15ms	432 KiB		226 Bytes	2023-2-25 13:54:32
AC	zhangheyi22006	15ms	384 KiB		191 Bytes	2022-12-6 13:48:11
AC	朱老师 (zyp)	15ms	512 KiB		203 Bytes	2022-8-9 17:12:51
AC	蒋青峰	15ms	512 KiB		201 Bytes	2023-2-26 14:43:05
AC	zcx	15ms	6.8 MiB		181 Bytes	2023-10-29 9:19:53
AC	杨皓然(X) (yanghaoran12)	15ms	512 KiB		215 Bytes	2022-9-12 17:45:31
AC	叶雨昊 (yeyuhao22006)	15ms	392 KiB		207 Bytes	2022-11-30 20:23:52
AC	李彭宋代诗人 (ljy123456)	15ms	436 KiB		228 Bytes	2023-4-6 21:11:02
AC	偽艺術家 (chenyanchi22006)	15ms	512 KiB		196 Bytes	2022-11-8 19:32:58
AC	杨颂恩 (yangsongen)	15ms	6.7 MiB		966 Bytes	2023-8-24 20:11:58
AC	司雨来 (siyulai)	15ms	512 KiB		221 Bytes	2023-4-28 20:54:20
AC	zhangheyi22006	15ms	444 KiB		177 Bytes	2022-12-4 10:46:02
AC	TJL	15ms	6.7 MiB		159 Bytes	2023-9-3 11:08:40
AC	陈骏逸 (chenjunyi)	15ms	7.1 MiB		227 Bytes	2023-7-9 14:32:22
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.8 MiB		158 Bytes	2023-9-24 11:54:00
AC	叶雨昊 (yeyuhao22006)	15ms	392 KiB		254 Bytes	2022-11-30 20:18:16
AC	86想要钱 (twt)	15ms	428 KiB		205 Bytes	2023-3-3 19:40:16
AC	周琪渃	15ms	432 KiB		208 Bytes	2023-3-9 18:30:54
AC	关博源	15ms	512 KiB		205 Bytes	2023-2-11 10:34:33
AC	谭懿轩 (yanyixuan)	15ms	512 KiB		431 Bytes	2022-12-6 15:04:30
AC	希蒙 (zhengxingya)	15ms	6.7 MiB		355 Bytes	2023-9-2 10:13:51
AC	本人天生贪生pass (05c41-cqs)	15ms	512 KiB		249 Bytes	2022-11-6 12:38:03
AC	徐正旺 (xzw)	15ms	436 KiB		187 Bytes	2023-1-5 15:33:21
AC	黄梓桐 (HuangZiTong)	15ms	424 KiB		175 Bytes	2022-11-13 10:38:30
AC	李禹衡 (liyuheng22006)	15ms	520 KiB		183 Bytes	2022-11-30 16:17:14
AC	汤杰尧 (05c05-tjy1)	15ms	512 KiB		200 Bytes	2022-11-17 20:09:27
AC	马渝杭 (mayuhang)	15ms	436 KiB		221 Bytes	2022-11-26 13:20:33
AC	曹埊睿 (caodirui)	15ms	432 KiB		167 Bytes	2023-5-4 21:19:58
AC	zhangheyi22006	15ms	384 KiB		183 Bytes	2022-11-30 20:06:55
AC	无尽的想象 (谭仕高)	15ms	384 KiB		210 Bytes	2023-3-17 17:41:51
AC	zhm123	15ms	432 KiB		190 Bytes	2022-12-22 18:25:59
AC	周靖松 (ZhouJS)	16ms	6.9 MiB		241 Bytes	2023-7-20 17:00:05
AC	爱情海校区—沙天一 (沙天一)	16ms	6.9 MiB		218 Bytes	2023-7-9 8:29:15
AC	爱琴海校区-刁钲洋 (刁钲洋)	16ms	7 MiB		303 Bytes	2023-6-18 15:12:20
AC	三差学生(尘埃蓝莓) (白佳睿)	16ms	7.2 MiB		212 Bytes	2023-12-10 22:41:15
AC	李哲 (lizhe)	16ms	604 KiB		209 Bytes	2023-3-19 15:54:28
AC	黄立信	16ms	512 KiB		206 Bytes	2023-4-27 22:10:27
AC	蒲梓勋 (puzixun)	16ms	436 KiB		200 Bytes	2022-9-14 21:50:01
AC	朱老师 (zyp)	16ms	384 KiB		254 Bytes	2022-11-30 20:23:54
AC	叶雨昊 (yeyuhao22006)	16ms	384 KiB		254 Bytes	2022-11-30 20:18:15
AC	神秘黑客	16ms	512 KiB		172 Bytes	2022-12-9 22:39:08