小玉家的电费

状态	递交者	时间	内存	语言	代码	递交时间
AC	zhangyh (张育菡)	13ms	512 KiB		274 Bytes	2022-6-10 22:21:54
AC	lafuzbc	13ms	436 KiB		272 Bytes	2022-8-20 12:04:55
AC	吴思谛 (wusidi)	13ms	384 KiB		328 Bytes	2022-4-23 11:30:32
AC	赵鑫宸 (xiaoxiao721)	13ms	428 KiB		291 Bytes	2022-2-20 3:32:42
AC	张瑞博	13ms	7.2 MiB	C++11	347 Bytes	2024-4-21 11:45:52
AC	吴思谛 (wusidi)	13ms	384 KiB		328 Bytes	2022-4-23 11:30:37
AC	CK (李弘毅)	13ms	452 KiB		273 Bytes	2022-8-13 16:02:44
AC	tad (OP AI)	13ms	6.9 MiB	C++98	230 Bytes	2024-6-16 15:02:13
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	13ms	384 KiB		389 Bytes	2022-7-9 9:07:56
AC	王浚西 (22016-wjx)	13ms	440 KiB		290 Bytes	2023-5-21 9:29:31
AC	呵呵呵 (陈思琦)	13ms	384 KiB		369 Bytes	2022-8-14 13:17:23
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	13ms	384 KiB		373 Bytes	2022-5-14 14:24:34
AC	zhanghaoran	13ms	384 KiB		259 Bytes	2022-3-12 20:18:01
AC	黄俊皓	13ms	384 KiB		314 Bytes	2022-4-23 10:06:53
AC	ywh	13ms	384 KiB		318 Bytes	2022-1-24 18:05:35
AC	吴思谛 (wusidi)	13ms	384 KiB		328 Bytes	2022-4-23 11:30:30
AC	文硕 (文硕1)	13ms	436 KiB		393 Bytes	2022-7-12 11:21:50
AC	吴思谛 (wusidi)	13ms	384 KiB		328 Bytes	2022-4-23 11:30:24
AC	时代一校 - 冯隆浩 (冯隆浩)	13ms	384 KiB		398 Bytes	2022-9-17 20:29:17
AC	ttz	13ms	512 KiB		266 Bytes	2022-3-6 9:46:20
AC	SMIK	14ms	432 KiB		290 Bytes	2022-1-19 13:09:26
AC	李山水	14ms	384 KiB		309 Bytes	2022-5-28 13:35:12
AC	ycy	14ms	384 KiB		337 Bytes	2022-4-15 20:53:25
AC	56 (13883454928)	14ms	384 KiB		320 Bytes	2023-4-16 13:40:24
AC	吴思谛 (wusidi)	14ms	512 KiB		328 Bytes	2022-4-23 11:30:35
AC	yiqiuyu	14ms	384 KiB		283 Bytes	2023-3-4 18:05:53
AC	草\|\|草 (陈星佑)	14ms	384 KiB		266 Bytes	2022-4-23 11:34:08
AC	靳博然 (jbr)	14ms	440 KiB		338 Bytes	2023-4-9 17:55:38
AC	向俊熙 (xiangjunxi23003)	14ms	384 KiB		275 Bytes	2023-3-4 18:08:05
AC	李彦臻	14ms	6.8 MiB		383 Bytes	2023-9-29 14:13:57
AC	何星震 (Jacob)	14ms	512 KiB		378 Bytes	2023-2-6 20:11:22
AC	吴思谛 (wusidi)	14ms	384 KiB		328 Bytes	2022-4-23 11:30:29
AC	吴思谛 (wusidi)	14ms	384 KiB		328 Bytes	2022-4-23 11:30:32
AC	吴思谛 (wusidi)	14ms	384 KiB		328 Bytes	2022-4-23 11:30:28
AC	我全家SB！！！我没母！！！ (baijinlin)	14ms	384 KiB		273 Bytes	2023-3-4 17:58:35
AC	_PXY_	14ms	512 KiB		324 Bytes	2022-1-25 14:07:29
AC	微笑王子小小小号	14ms	392 KiB		290 Bytes	2023-2-11 18:55:44
AC	吴思谛 (wusidi)	14ms	384 KiB		328 Bytes	2022-4-23 11:30:30
AC	明哲瀚 (18580067605)	14ms	392 KiB		367 Bytes	2022-10-5 14:32:33
AC	heyi	14ms	6.8 MiB	C++98(O2)	364 Bytes	2024-8-8 18:11:10
AC	我全家SB！！！我没母！！！ (baijinlin)	14ms	384 KiB		273 Bytes	2023-3-4 17:58:33
AC	时代2校-程俊燃 (chengjunran)	14ms	440 KiB		306 Bytes	2023-4-25 19:03:18
AC	赵泳鑫 (zhaoyongxin)	14ms	428 KiB		393 Bytes	2022-4-23 17:44:34
AC	hnd (陈皓洋)	14ms	392 KiB		326 Bytes	2022-11-19 16:40:26
AC	南坪校区-田治铭 (tian zhi ming)	14ms	6.8 MiB		245 Bytes	2023-10-4 12:06:13
AC	呵呵呵 (陈思琦)	14ms	512 KiB		369 Bytes	2022-8-14 13:17:25
AC	贺睿林	14ms	6.8 MiB		202 Bytes	2023-10-14 9:27:21
AC	新壹街陈科言 (cky)	14ms	512 KiB		331 Bytes	2023-2-25 16:40:43
AC	lijinyu23003	14ms	420 KiB		270 Bytes	2023-3-4 18:05:35
AC	Accepted (周芷乐)	14ms	7 MiB	C++14	288 Bytes	2024-6-17 21:29:24
AC	王祎辰 (wangyichen)	14ms	6.7 MiB		384 Bytes	2023-9-7 19:04:15
AC	吴思谛 (wusidi)	14ms	392 KiB		328 Bytes	2022-4-23 11:30:28
AC	吴思谛 (wusidi)	14ms	384 KiB		328 Bytes	2022-4-23 11:30:27
AC	luoluonuoya	14ms	384 KiB		418 Bytes	2022-1-26 17:17:40
AC	宋坤霖	14ms	7.1 MiB	C++11	341 Bytes	2024-4-20 13:23:41
AC	刘煜轩	14ms	6.8 MiB		299 Bytes	2023-10-14 9:40:10
AC	zzl	14ms	6.8 MiB		402 Bytes	2023-11-6 21:05:17
AC	Tang	14ms	512 KiB		872 Bytes	2022-4-23 14:34:34
AC	我全家SB！！！我没母！！！ (baijinlin)	14ms	392 KiB		273 Bytes	2023-3-4 17:58:36
AC	黄彦熹 (AK-203)	14ms	440 KiB		305 Bytes	2022-8-24 19:54:26
AC	希蒙 (zhengxingya)	14ms	6.8 MiB		310 Bytes	2023-10-11 17:38:24
AC	Jose (反恐皮蛋)	14ms	384 KiB		456 Bytes	2023-5-20 9:21:08
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)	14ms	384 KiB		321 Bytes	2022-10-16 16:40:12
AC	sunsihan	14ms	7 MiB		368 Bytes	2023-12-9 9:18:39
AC	吴思谛 (wusidi)	14ms	384 KiB		328 Bytes	2022-4-23 11:30:38
AC	吴思谛 (wusidi)	14ms	392 KiB		328 Bytes	2022-4-23 11:30:34
AC	殷语函	14ms	7.4 MiB	C++11	358 Bytes	2024-4-27 11:05:14
AC	zhanglianjie	14ms	392 KiB		276 Bytes	2023-3-4 17:59:03
AC	我全家SB！！！我没母！！！ (baijinlin)	14ms	384 KiB		273 Bytes	2023-3-4 17:58:35
AC	冒牌陈杰晟【MOD】 (wed)	14ms	384 KiB		292 Bytes	2022-10-4 10:20:04
AC	杨浩灵 (金坷拉)	14ms	7.4 MiB		361 Bytes	2023-7-18 17:58:51
AC	谢博文	14ms	384 KiB		324 Bytes	2022-2-19 11:24:02
AC	贾博涵	14ms	6.8 MiB		255 Bytes	2023-11-6 16:05:22
AC	icwy (zuolun)	14ms	384 KiB		304 Bytes	2022-4-16 14:57:30
AC	钟元朗	14ms	384 KiB		300 Bytes	2023-2-11 18:57:02
AC	金沙-文豪 (wenhao)	14ms	6.7 MiB		378 Bytes	2023-9-30 13:47:32
AC	唐梓竣	14ms	436 KiB		314 Bytes	2023-4-15 20:29:04
AC	吴思谛 (wusidi)	14ms	392 KiB		328 Bytes	2022-4-23 11:30:35
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	436 KiB		378 Bytes	2023-1-29 22:37:37
AC	scallway1	14ms	384 KiB		309 Bytes	2023-3-13 19:38:03
AC	tsc_ (杨悦堃)	14ms	440 KiB		351 Bytes	2023-3-3 18:38:42
AC	cupy战士 (05c05-dkf)	14ms	556 KiB		330 Bytes	2023-4-15 16:38:07
AC	我是周靖松长得帅 (mouyunqi)	14ms	384 KiB		270 Bytes	2023-3-31 18:47:10
AC	Error404sans (焦阳浩云)	14ms	6.8 MiB		268 Bytes	2023-10-14 9:39:21
AC	11451254188 (22029-mjh)	14ms	436 KiB		249 Bytes	2023-3-16 21:23:55
AC	朱泽晟	14ms	512 KiB		384 Bytes	2022-2-11 19:39:39
AC	李旻轩	14ms	384 KiB		417 Bytes	2023-4-1 9:01:03
AC	dengfeng	14ms	428 KiB		337 Bytes	2022-7-22 16:41:51
AC	陈杰晟	14ms	428 KiB		279 Bytes	2022-2-20 10:29:12
AC	yangyutong22003	14ms	512 KiB		286 Bytes	2023-3-4 18:03:37
AC	xxteacher	14ms	392 KiB		352 Bytes	2022-1-26 16:51:38
AC	吴思谛 (wusidi)	14ms	384 KiB		328 Bytes	2022-4-23 11:30:34
AC	SYC0226	14ms	440 KiB		322 Bytes	2022-3-13 13:13:56
AC	中岛敦 (黄麒瑞)	14ms	6.7 MiB		389 Bytes	2023-9-30 21:25:49
AC	周浩楠 (开朗的周好难)	14ms	6.8 MiB		382 Bytes	2023-10-14 9:52:11
AC	张子轩 (zhangzixuana)	14ms	452 KiB		254 Bytes	2022-9-25 17:01:23
AC	scallway	14ms	428 KiB		314 Bytes	2023-2-18 9:27:32
AC	10255	14ms	6.8 MiB		322 Bytes	2023-9-30 14:03:18
AC	吴思谛 (wusidi)	14ms	392 KiB		328 Bytes	2022-4-23 11:30:34
AC	吴思谛 (wusidi)	14ms	392 KiB		328 Bytes	2022-4-23 11:30:28