计算邮资

状态	递交者	时间	内存	语言	代码	递交时间
AC	向俊熙 (xiangjunxi23003)	30ms	6.7 MiB		262 Bytes	2023-9-6 19:13:49
AC	wangmulai	30ms	7.1 MiB		220 Bytes	2024-1-1 16:14:38
AC	王玺懿 (wxy)	30ms	512 KiB		280 Bytes	2022-8-7 9:33:05
AC	新一街校区Jason_LuoYouZheng (罗友峥)	30ms	428 KiB		313 Bytes	2023-2-24 20:42:33
AC	我很6 (zjj22031)	30ms	384 KiB		309 Bytes	2022-10-20 19:16:45
AC	六 (江智昕)	30ms	388 KiB		380 Bytes	2022-12-29 17:30:59
AC	hyh22031	30ms	392 KiB		298 Bytes	2022-10-20 19:17:12
AC	贾博涵	30ms	6.8 MiB		303 Bytes	2023-11-6 16:00:02
AC	吴思谛 (wusidi)	30ms	384 KiB		250 Bytes	2022-4-23 9:58:55
AC	六 (江智昕)	30ms	512 KiB		380 Bytes	2022-12-29 17:31:05
AC	不怎么聪明的家伙 (贺俊楠)	30ms	6.7 MiB		576 Bytes	2023-9-3 8:36:14
AC	朱老师 (zyp)	30ms	396 KiB		399 Bytes	2022-10-2 11:49:16
AC	hyh	30ms	384 KiB		287 Bytes	2023-5-31 18:55:29
AC	纪承熙 (jcx001)	30ms	6.9 MiB		314 Bytes	2023-7-17 11:15:37
AC	六 (江智昕)	30ms	384 KiB		380 Bytes	2022-12-29 17:31:06
AC	月下的九尾银狐	30ms	436 KiB		310 Bytes	2023-2-18 10:02:23
AC	jinitaimei	30ms	384 KiB		204 Bytes	2022-9-25 18:46:21
AC	向俊熙 (xiangjunxi23003)	30ms	6.7 MiB		262 Bytes	2023-9-6 19:13:58
AC	六 (江智昕)	30ms	400 KiB		380 Bytes	2022-12-29 17:31:02
AC	zvt_132 (任子轩)	30ms	6.9 MiB		208 Bytes	2023-7-14 12:24:25
AC	付博plus	30ms	384 KiB		256 Bytes	2022-9-8 20:31:40
AC	曲奇饼干	30ms	6.8 MiB		406 Bytes	2023-6-28 14:39:31
AC	新壹街校区-冉睦阳 (冉睦阳)	30ms	7.3 MiB		328 Bytes	2024-1-21 18:20:00
AC	六 (江智昕)	30ms	408 KiB		380 Bytes	2022-12-29 17:31:11
AC	杨颂恩 (yangsongen)	30ms	6.8 MiB		604 Bytes	2023-9-2 17:31:21
AC	郑尧 (zhengyao)	30ms	6.7 MiB		190 Bytes	2023-9-6 19:03:03
AC	赵启程 (赵启程1)	30ms	384 KiB		266 Bytes	2023-5-31 19:02:44
AC	曹埊睿 (caodirui)	30ms	512 KiB		281 Bytes	2023-4-27 20:01:57
AC	赵一嵘 (zhaoyirong)	30ms	384 KiB		500 Bytes	2023-3-9 19:00:07
AC	曾龙兮	30ms	512 KiB		264 Bytes	2022-9-25 18:31:46
AC	钟元朗	30ms	432 KiB		447 Bytes	2022-9-10 11:30:16
AC	源著校区-宋昊成 (马冬梅)	30ms	512 KiB		472 Bytes	2023-2-25 17:47:21
AC	zzl	30ms	432 KiB		258 Bytes	2023-1-3 17:03:53
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	30ms	512 KiB		216 Bytes	2023-5-27 19:07:01
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	552 KiB		309 Bytes	2022-10-3 16:01:48
AC	新壹街校区--税崇峻 (税崇峻)	30ms	6.9 MiB		209 Bytes	2023-7-27 14:45:04
AC	源著校区-宋昊成 (马冬梅)	30ms	432 KiB		253 Bytes	2023-2-26 18:43:43
AC	AC[谭赫奕] (tanheyi)	30ms	6.7 MiB		430 Bytes	2023-9-16 10:31:00
AC	牟淳雅	30ms	6.8 MiB		324 Bytes	2023-6-10 23:13:53
AC	wuqilin	30ms	6.8 MiB		230 Bytes	2023-7-6 23:04:38
AC	六 (江智昕)	30ms	392 KiB		380 Bytes	2022-12-29 17:31:00
AC	UsMt1 (jiangyuan)	30ms	6.7 MiB		665 Bytes	2023-9-15 20:55:14
AC	maobohan	30ms	6.9 MiB		450 Bytes	2023-12-16 10:09:52
AC	曲奇饼干	30ms	384 KiB		406 Bytes	2022-12-18 9:29:42
AC	杜是贤 (dushixian)	30ms	496 KiB		236 Bytes	2023-5-28 11:27:39
AC	11451254188 (22029-mjh)	30ms	436 KiB		241 Bytes	2023-3-23 21:06:17
AC	李彭宋代诗人 (ljy123456)	30ms	512 KiB		278 Bytes	2023-3-23 6:43:43
AC	scallway	30ms	392 KiB		291 Bytes	2022-12-18 8:55:51
AC	六 (江智昕)	30ms	384 KiB		380 Bytes	2022-12-29 17:31:04
AC	yangyutong22003	31ms	432 KiB		264 Bytes	2023-2-18 18:13:59
AC	新壹街校区-陈琬舒 (空空大师)	31ms	6.7 MiB		483 Bytes	2023-9-10 20:58:38
AC	余彦瑞	31ms	512 KiB		287 Bytes	2022-8-31 15:46:29
AC	草\|\|草 (陈星佑)	31ms	392 KiB		267 Bytes	2022-8-30 14:43:04
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	392 KiB		216 Bytes	2023-5-27 19:07:04
AC	huanglu	31ms	7.5 MiB		315 Bytes	2023-7-12 17:41:48
AC	秦兴润	31ms	384 KiB		396 Bytes	2022-12-18 9:34:12
AC	六 (江智昕)	31ms	384 KiB		380 Bytes	2022-12-29 17:30:59
AC	0721 (龙浩恩)	31ms	6.9 MiB		538 Bytes	2023-10-28 17:57:13
AC	游智棋	31ms	7.1 MiB	C++17	529 Bytes	2024-6-15 16:23:41
AC	ycy	31ms	512 KiB		448 Bytes	2022-11-19 9:29:49
AC	赵锦昊	31ms	432 KiB		264 Bytes	2023-3-25 15:09:58
AC	王玺懿 (wxy)	31ms	440 KiB		387 Bytes	2022-11-12 11:08:59
AC	tyx_9192596	31ms	440 KiB		181 Bytes	2023-3-19 7:39:02
AC	新壹街陈科言 (cky)	31ms	7 MiB		530 Bytes	2023-7-20 11:28:00
AC	xflt_dyp	31ms	384 KiB		232 Bytes	2023-4-15 9:34:16
AC	草\|\|草 (陈星佑)	31ms	384 KiB		267 Bytes	2022-8-30 14:43:04
AC	时代2校-程俊燃 (chengjunran)	31ms	6.9 MiB		291 Bytes	2023-8-17 20:22:00
AC	我很6 (zjj22031)	31ms	384 KiB		309 Bytes	2022-10-20 19:16:00
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	31ms	6.8 MiB		435 Bytes	2023-7-6 22:01:05
AC	只因 (yubohang23002)	31ms	6.8 MiB		200 Bytes	2023-6-8 21:49:06
AC	南坪校区-郑力博 (zhenglibo23003)	31ms	6.8 MiB		364 Bytes	2023-6-8 21:36:21
AC	韩思辰 (hansichen)	31ms	436 KiB		429 Bytes	2022-11-17 17:57:55
AC	李禹衡 (liyuheng22006)	31ms	444 KiB		222 Bytes	2022-10-18 20:51:17
AC	执剑人罗辑 (Jasson)	31ms	6.8 MiB		373 Bytes	2023-6-9 19:57:12
AC	一片落叶 (yeyuhao)	31ms	6.7 MiB		294 Bytes	2023-8-25 10:33:38
AC	ganlin1	31ms	6.9 MiB		187 Bytes	2023-7-12 18:08:34
AC	zcx	31ms	440 KiB		241 Bytes	2022-10-1 11:41:53
AC	不怎么聪明的家伙 (贺俊楠)	31ms	6.9 MiB		576 Bytes	2023-6-18 18:15:45
AC	坤坤荔枝小黑子 (zhonghaotian22006)	31ms	7 MiB		447 Bytes	2023-12-25 18:50:46
AC	原著校区巫映秋 (巫映秋1a)	31ms	7.2 MiB		269 Bytes	2023-11-30 21:17:17
AC	六 (江智昕)	31ms	392 KiB		380 Bytes	2022-12-29 17:30:59
AC	时代二校-焦雨齐 (Angel)	31ms	440 KiB		285 Bytes	2023-3-11 18:56:08
AC	你猜呀	31ms	6.8 MiB		287 Bytes	2023-6-28 14:50:58
AC	余多多29	31ms	384 KiB		449 Bytes	2023-4-17 21:54:26
AC	AC[谭赫奕] (tanheyi)	31ms	512 KiB		430 Bytes	2023-1-19 13:36:37
AC	colin1112 (墙凌可)	31ms	6.8 MiB		342 Bytes	2023-8-30 14:56:16
AC	xuaonan	31ms	512 KiB		585 Bytes	2022-10-4 18:03:29
AC	56 (13883454928)	31ms	456 KiB		308 Bytes	2023-4-16 13:31:08
AC	我很6 (zjj22031)	31ms	392 KiB		309 Bytes	2022-10-20 19:16:41
AC	周琪渃	31ms	6.8 MiB		254 Bytes	2023-6-9 19:59:53
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	496 KiB		329 Bytes	2022-8-31 19:26:22
AC	曲奇饼干	31ms	408 KiB		429 Bytes	2022-12-18 9:30:11
AC	王泓涵 (whh)	31ms	448 KiB		262 Bytes	2022-7-18 19:12:35
AC	陈雨泽1	31ms	6.7 MiB		442 Bytes	2023-8-29 14:46:48
AC	zzzrrrxxx	31ms	6.9 MiB		421 Bytes	2023-7-18 11:56:02
AC	南坪校区-郑力博 (zhenglibo23003)	31ms	6.8 MiB		364 Bytes	2023-6-8 21:38:35
AC	刘锦航	31ms	384 KiB		259 Bytes	2022-1-22 18:40:25
AC	wangzihang	31ms	6.9 MiB		234 Bytes	2023-11-10 17:25:18
AC	chenjunyao	31ms	428 KiB		227 Bytes	2023-4-15 9:41:13
AC	田昊东	31ms	7.1 MiB		304 Bytes	2023-12-31 18:42:45