计算书费

状态	递交者	时间	内存	语言	代码	递交时间
AC	贾博涵	4ms	6.9 MiB		259 Bytes	2023-12-1 13:08:24
AC	赵沛喆	13ms	256 KiB		237 Bytes	2022-4-17 19:26:18
AC	1396013295	13ms	256 KiB		265 Bytes	2022-1-22 19:13:55
AC	谢欣霖 (xiexinlin)	13ms	256 KiB		274 Bytes	2022-3-20 10:22:25
AC	luozixi	14ms	384 KiB		386 Bytes	2023-2-20 18:57:44
AC	经常消失 (小萝卜)	14ms	312 KiB		227 Bytes	2022-8-2 20:33:21
AC	杨坤霖 (steven)	14ms	256 KiB		238 Bytes	2022-12-7 18:51:53
AC	ddz	14ms	364 KiB		227 Bytes	2022-3-20 18:27:03
AC	杨坤霖 (steven)	14ms	256 KiB		205 Bytes	2022-12-7 18:50:54
AC	杨坤霖 (steven)	15ms	264 KiB		205 Bytes	2022-12-7 18:50:55
AC	陈年保宁醋 (dengboren)	15ms	316 KiB		227 Bytes	2022-2-19 10:43:06
AC	李彭宋代诗人 (ljy123456)	15ms	384 KiB		275 Bytes	2023-3-21 16:04:41
AC	wangzihang	17ms	316 KiB	C++	555 Bytes	2022-8-30 10:28:33
AC	胡宸华 (huchenhua)	19ms	316 KiB		307 Bytes	2023-1-11 21:47:37
AC	傅翊航 (fyh)	19ms	384 KiB		249 Bytes	2022-8-30 16:18:14
AC	吴俊成 (wujuncheng)	24ms	392 KiB		323 Bytes	2022-7-11 22:31:01
AC	明轩 (吕同学)	24ms	6.6 MiB	C++14(O2)	305 Bytes	2024-7-6 15:13:59
AC	huyinuo	25ms	388 KiB		251 Bytes	2022-6-12 16:38:26
AC	肖添宇	25ms	384 KiB		284 Bytes	2022-3-26 17:28:23
AC	zhoujunlin	25ms	384 KiB		286 Bytes	2022-8-17 11:38:09
AC	詹宇航 (zyh7)	25ms	512 KiB		260 Bytes	2022-6-12 21:03:03
AC	chen (peter)	25ms	384 KiB		242 Bytes	2022-7-19 14:28:57
AC	林小博	25ms	384 KiB		226 Bytes	2022-5-11 20:22:22
AC	王晨志 (wangchenzhi)	25ms	384 KiB		338 Bytes	2022-6-18 4:33:33
AC	赵鑫宸 (xiaoxiao721)	25ms	384 KiB		292 Bytes	2022-2-18 19:28:52
AC	Erin	25ms	7 MiB	C++98	231 Bytes	2024-5-29 10:37:47
AC	ycy	25ms	384 KiB		288 Bytes	2022-6-17 13:12:15
AC	陈骏洋	25ms	444 KiB		273 Bytes	2022-6-17 21:21:30
AC	游智棋	26ms	7.2 MiB	C++17	682 Bytes	2024-5-17 22:21:52
AC	CMG	26ms	384 KiB		258 Bytes	2022-6-5 19:27:26
AC	朱昱丞	26ms	384 KiB		279 Bytes	2022-6-13 20:02:21
AC	朱泓屹 (ZYH)	26ms	384 KiB		292 Bytes	2022-6-5 19:03:30
AC	程舒然	26ms	6.9 MiB	C++11	259 Bytes	2024-8-23 11:37:18
AC	时代一校蒋帛希 (13983392730)	26ms	512 KiB		266 Bytes	2022-8-17 11:46:19
AC	RACOP	26ms	432 KiB		268 Bytes	2022-8-17 11:39:21
AC	linjingming	26ms	384 KiB		344 Bytes	2022-8-17 18:20:08
AC	曹埊睿 (caodirui)	26ms	392 KiB		280 Bytes	2023-4-20 21:02:09
AC	zlx (xiao)	26ms	384 KiB		361 Bytes	2022-6-5 18:48:28
AC	时代一校-赵彦博 (zyb)	26ms	392 KiB		265 Bytes	2022-8-17 11:45:52
AC	l;k (陈彬宾)	26ms	384 KiB		235 Bytes	2022-6-5 18:57:50
AC	疯神芭芭脱丝 (李卓修)	26ms	384 KiB		230 Bytes	2022-7-9 17:13:10
AC	XYZ303	26ms	424 KiB		271 Bytes	2022-6-5 19:00:12
AC	陈杰晟	26ms	404 KiB		262 Bytes	2022-3-24 15:55:43
AC	86想要钱 (twt)	26ms	384 KiB		282 Bytes	2022-8-17 11:39:29
AC	黄相茗	26ms	416 KiB		430 Bytes	2022-4-11 18:41:43
AC	微风将至 (李睿轩)	26ms	384 KiB		332 Bytes	2022-6-5 18:59:03
AC	潘光瑞 (NB牛牛大师)	26ms	384 KiB		282 Bytes	2022-6-12 18:59:54
AC	Zongzi1	26ms	6.6 MiB	C++17(O2)	420 Bytes	2024-7-18 21:57:35
AC	17779	26ms	436 KiB		299 Bytes	2022-3-25 17:23:22
AC	时代一校 - 冯隆浩 (冯隆浩)	26ms	384 KiB		232 Bytes	2022-7-2 19:40:57
AC	kkksc03 (彭士锋)	27ms	392 KiB		242 Bytes	2022-3-12 13:24:44
AC	05c35-rjx	27ms	384 KiB		269 Bytes	2022-6-13 21:28:11
AC	marz	27ms	6.6 MiB	C++98	265 Bytes	2024-7-22 8:05:45
AC	zhangyh (张育菡)	27ms	512 KiB		261 Bytes	2022-6-10 22:36:05
AC	草\|\|草 (陈星佑)	27ms	412 KiB		274 Bytes	2022-8-10 16:18:50
AC	SYC0226	27ms	392 KiB		358 Bytes	2022-3-20 14:01:23
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)	27ms	384 KiB		288 Bytes	2022-12-4 17:15:43
AC	^_^ (ctc)	27ms	392 KiB		244 Bytes	2022-11-30 20:00:32
AC	陈祖明	27ms	392 KiB		314 Bytes	2022-2-16 21:25:30
AC	安闵煜 (anzai)	27ms	6.8 MiB	C++11	358 Bytes	2024-8-8 14:52:15
AC	傅博涛	27ms	384 KiB		322 Bytes	2022-1-22 11:23:22
AC	赵泳鑫 (zhaoyongxin)	27ms	384 KiB		430 Bytes	2022-1-26 14:37:33
AC	赵鑫宸 (xiaoxiao721)	27ms	384 KiB		319 Bytes	2022-2-18 19:25:47
AC	张瑞博	27ms	7 MiB	C++11	242 Bytes	2024-5-19 16:29:07
AC	三藏的痔疮 (不会玩是原罪)	27ms	392 KiB		334 Bytes	2022-1-22 11:47:49
AC	22029-hqh	27ms	384 KiB		310 Bytes	2023-3-18 10:08:24
AC	张祖名	27ms	6.9 MiB	C++98(O2)	280 Bytes	2024-6-11 22:38:13
AC	wuqilin	27ms	384 KiB		225 Bytes	2023-4-20 21:36:28
AC	时代二校+王吕棪 (wanglvyan)	27ms	384 KiB		270 Bytes	2023-5-14 19:46:27
AC	魑归sama	27ms	424 KiB		260 Bytes	2022-7-12 16:31:14
AC	MoonLight ( aaa)	27ms	384 KiB		394 Bytes	2022-1-25 12:10:19
AC	李山水	27ms	384 KiB		255 Bytes	2022-2-10 9:37:19
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	27ms	404 KiB		222 Bytes	2022-9-23 22:00:21
AC	金沙校区-先珂熠 (九转大肠)	27ms	6.7 MiB	C++20(O2)	241 Bytes	2024-8-2 10:48:01
AC	杜俊宏	27ms	436 KiB		286 Bytes	2022-4-9 19:50:14
AC	heyuzhe	27ms	6.9 MiB	C++98	238 Bytes	2024-8-16 8:59:21
AC	赵启程 (赵启程1)	27ms	384 KiB		262 Bytes	2023-4-8 20:25:13
AC	lch (凌昌瀚)	27ms	512 KiB		260 Bytes	2022-8-1 13:46:50
AC	新壹街陈科言 (cky)	27ms	392 KiB		288 Bytes	2023-5-12 19:01:01
AC	食不食油饼（点主页康康） (Nemo)	27ms	384 KiB		335 Bytes	2022-9-4 19:00:20
AC	任童(rentong)	27ms	444 KiB		323 Bytes	2022-7-2 15:00:11
AC	汪致卉 (wangzh)	28ms	412 KiB		414 Bytes	2022-1-23 19:44:34
AC	樊竣熠 (lft1114)	28ms	512 KiB		278 Bytes	2022-7-31 15:42:03
AC	没有此人 (akm)	28ms	7.1 MiB		210 Bytes	2023-12-30 14:00:07
AC	何晟瑞 (hsr01)	28ms	440 KiB		588 Bytes	2022-6-9 21:19:19
AC	李哲 (lizhe)	28ms	512 KiB		268 Bytes	2022-8-3 18:29:09
AC	文硕 (文硕1)	28ms	384 KiB		258 Bytes	2022-2-6 14:04:39
AC	谭懿轩 (yanyixuan)	28ms	384 KiB		230 Bytes	2022-2-20 17:43:26
AC	杜是贤 (dushixian)	28ms	448 KiB		254 Bytes	2022-8-2 11:29:43
AC	时代二校+王吕棪 (wanglvyan)	28ms	384 KiB		270 Bytes	2023-5-14 19:46:42
AC	李树崑 (lishukun)	28ms	384 KiB		302 Bytes	2022-8-20 12:22:07
AC	zhangxinyue	28ms	384 KiB		234 Bytes	2023-2-13 21:09:29
AC	luoluonuoya	28ms	440 KiB		288 Bytes	2022-8-15 14:43:31
AC	姚宏逸	28ms	512 KiB		377 Bytes	2022-2-15 18:46:38
AC	renqiumo	28ms	384 KiB		493 Bytes	2022-2-19 15:42:50
AC	坤坤荔枝小黑子 (zhonghaotian22006)	28ms	512 KiB		278 Bytes	2023-5-8 21:16:27
AC	zhangzixuanaa	28ms	384 KiB		406 Bytes	2023-4-15 14:15:48
AC	唐臣谦 (tangchenqian1)	28ms	440 KiB		210 Bytes	2022-12-3 22:27:25
AC	22029-hqh	28ms	384 KiB		310 Bytes	2023-3-18 10:08:22
AC	伍行念 (wuxingnian)	28ms	6.8 MiB		306 Bytes	2023-10-9 15:54:16