水费计算

状态	递交者	时间	内存	语言	代码	递交时间
AC	刘昱辰	14ms	384 KiB		236 Bytes	2022-9-9 18:55:31
AC	金沙校区-蓝祥与 (蓝祥与)	14ms	528 KiB		191 Bytes	2022-12-7 14:00:46
AC	dengfeng	14ms	384 KiB		285 Bytes	2022-2-10 18:04:06
AC	SHY20091224	14ms	512 KiB		195 Bytes	2022-8-15 16:21:40
AC	杨洋	14ms	7.3 MiB	C++98	178 Bytes	2024-4-21 14:10:16
AC	qinyi	14ms	384 KiB		236 Bytes	2022-2-20 11:01:30
AC	wangzihang	14ms	440 KiB		164 Bytes	2022-7-28 10:15:01
AC	廖永亨	14ms	384 KiB		215 Bytes	2022-12-7 17:57:57
AC	chen (peter)	14ms	436 KiB		182 Bytes	2022-7-19 9:15:53
AC	zenglongxi	14ms	384 KiB		207 Bytes	2022-9-7 18:50:09
AC	朱老师 (zyp)	14ms	512 KiB		190 Bytes	2022-7-18 19:21:53
AC	yuzk	14ms	6.7 MiB	C++11	193 Bytes	2024-7-11 16:05:04
AC	(张洛诚)	14ms	384 KiB		291 Bytes	2022-9-9 19:17:30
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	14ms	384 KiB		230 Bytes	2022-6-5 15:26:46
AC	杨瀚霖 (yanghanlin)	14ms	432 KiB		209 Bytes	2022-11-20 22:22:43
AC	wrqwc	14ms	412 KiB		212 Bytes	2022-9-9 19:47:00
AC	zhangyh (张育菡)	14ms	384 KiB		214 Bytes	2022-5-15 9:03:13
AC	王胤钦 (wangyinqin)	14ms	384 KiB		189 Bytes	2022-9-9 19:25:10
AC	hxb	14ms	436 KiB		186 Bytes	2022-9-7 18:51:20
AC	Ruler (05c35-hjs)	14ms	384 KiB		210 Bytes	2022-5-8 8:58:03
AC	李睿杰	14ms	392 KiB		216 Bytes	2022-10-15 18:20:44
AC	火爆肥肠（杨弘毅） (火爆肥肠)	14ms	392 KiB		191 Bytes	2022-6-16 21:35:16
AC	李山水	14ms	392 KiB		224 Bytes	2022-2-20 9:05:21
AC	夏麟然	14ms	6.9 MiB	C++98	244 Bytes	2024-5-24 17:56:53
AC	赵泳鑫 (zhaoyongxin)	14ms	436 KiB		202 Bytes	2022-1-26 14:38:35
AC	_PXY_	14ms	392 KiB		217 Bytes	2022-1-25 13:41:02
AC	wrqwc	14ms	384 KiB		212 Bytes	2022-9-9 19:46:57
AC	pwf	14ms	384 KiB		214 Bytes	2022-9-9 18:47:09
AC	谢语泽他爹 (qiujunxiang)	14ms	436 KiB		205 Bytes	2022-4-23 19:14:25
AC	胡程禹	14ms	384 KiB		210 Bytes	2023-3-25 18:37:46
AC	17779	14ms	512 KiB		221 Bytes	2022-2-25 13:41:45
AC	longhao	14ms	400 KiB		239 Bytes	2022-1-23 11:35:27
AC	朱彦搏	14ms	440 KiB		275 Bytes	2023-4-16 13:13:52
AC	疯神芭芭脱丝 (李卓修)	14ms	392 KiB		262 Bytes	2022-1-21 18:04:09
AC	何洋名 (heyangming)	14ms	384 KiB		199 Bytes	2023-5-13 15:17:48
AC	dmh (丁墨涵)	14ms	512 KiB		210 Bytes	2022-2-28 20:58:46
AC	wrqwc	14ms	384 KiB		212 Bytes	2022-9-9 19:46:54
AC	科比.布莱恩特 (董浩琰)	14ms	384 KiB		241 Bytes	2023-3-25 18:48:09
AC	miku (阳沐珊)	14ms	384 KiB		244 Bytes	2023-3-25 18:29:36
AC	李山水	14ms	432 KiB		224 Bytes	2022-2-20 9:05:21
AC	zhangzhimo	14ms	384 KiB		168 Bytes	2022-9-7 18:49:41
AC	wrqwc	14ms	512 KiB		212 Bytes	2022-9-9 19:46:59
AC	曹烜豪	14ms	384 KiB		204 Bytes	2023-3-25 18:40:52
AC	新壹街-王俊博 (王俊博)	14ms	6.8 MiB	C++98	193 Bytes	2024-6-6 21:37:28
AC	江坤锜	14ms	384 KiB		237 Bytes	2023-3-25 18:39:40
AC	时代2校-程俊燃 (chengjunran)	14ms	444 KiB		190 Bytes	2023-4-25 18:58:18
AC	罗晨睿 (luochenrui)	14ms	512 KiB		209 Bytes	2022-6-26 13:29:23
AC	e^(i×π)+1=0	14ms	6.7 MiB		162 Bytes	2023-8-27 8:37:00
AC	wrqwc	14ms	384 KiB		212 Bytes	2022-9-9 19:39:18
AC	ycy	14ms	440 KiB		195 Bytes	2022-6-28 18:52:01
AC	22029-zjs	14ms	392 KiB		263 Bytes	2023-2-3 19:18:12
AC	周琪渃	14ms	384 KiB		281 Bytes	2022-12-3 13:42:48
AC	杨宇航1	14ms	408 KiB		214 Bytes	2023-3-12 14:26:07
AC	苏晨懿	14ms	6.9 MiB		164 Bytes	2023-10-21 20:03:29
AC	王玺懿 (wxy)	14ms	444 KiB		194 Bytes	2022-7-25 9:42:16
AC	李某人	14ms	436 KiB		304 Bytes	2022-1-21 17:59:00
AC	wangtan	14ms	384 KiB		197 Bytes	2023-3-12 14:37:50
AC	杨博文05	14ms	6.9 MiB	C++98	240 Bytes	2024-6-12 20:32:30
AC	罗莎莎	14ms	6.9 MiB		213 Bytes	2023-7-18 16:25:49
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	440 KiB		218 Bytes	2023-4-22 16:12:31
AC	章愉霖	14ms	412 KiB		174 Bytes	2023-6-1 10:43:33
AC	wangtan	14ms	384 KiB		197 Bytes	2023-3-12 14:37:42
AC	wrqwc	14ms	384 KiB		212 Bytes	2022-9-9 19:46:57
AC	星野光 (Hoshino Hikari)	14ms	6.8 MiB		284 Bytes	2023-10-20 16:32:33
AC	孟子轩 (km老冯)	14ms	440 KiB		210 Bytes	2022-4-28 19:01:43
AC	wrqwc	14ms	432 KiB		212 Bytes	2022-9-9 19:46:56
AC	唐彬献	14ms	7.3 MiB		238 Bytes	2023-10-28 11:41:23
AC	TaLeK (黄子瑞)	14ms	6.9 MiB	C++98	184 Bytes	2024-8-21 13:19:56
AC	wrqwc	14ms	392 KiB		212 Bytes	2022-9-9 19:46:58
AC	苏信泽	14ms	384 KiB		177 Bytes	2023-3-25 18:35:42
AC	关博源	14ms	392 KiB		273 Bytes	2023-2-20 19:39:36
AC	yxj	14ms	432 KiB		373 Bytes	2022-10-20 14:38:32
AC	科比.布莱恩特 (董浩琰)	14ms	392 KiB		241 Bytes	2023-3-25 18:47:40
AC	wrqwc	14ms	428 KiB		212 Bytes	2022-9-9 19:47:02
AC	疯神芭芭脱丝 (李卓修)	14ms	436 KiB		250 Bytes	2022-7-16 13:49:58
AC	heyuzhe	14ms	7 MiB	C++98	245 Bytes	2024-6-12 18:52:38
AC	zhangyouze (张佑泽)	14ms	6.8 MiB		199 Bytes	2023-10-21 23:11:21
AC	鲜榨大肠汁	14ms	440 KiB		259 Bytes	2022-3-9 21:04:03
AC	炸鱼4000+ (dxc)	14ms	384 KiB		221 Bytes	2023-3-25 18:36:58
AC	wanghuaiying	14ms	7.5 MiB		249 Bytes	2023-10-28 11:37:44
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		190 Bytes	2023-5-27 10:28:55
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		300 Bytes	2023-9-29 10:36:32
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	512 KiB		178 Bytes	2022-9-7 18:49:10
AC	陈骏逸 (chenjunyi)	14ms	416 KiB		185 Bytes	2022-8-3 17:02:29
AC	wangtan	14ms	384 KiB		197 Bytes	2023-3-12 14:36:41
AC	GYZ	14ms	436 KiB		204 Bytes	2022-3-13 19:05:50
AC	wangtan	14ms	392 KiB		197 Bytes	2023-3-12 14:37:48
AC	食不食油饼（点主页康康） (Nemo)	14ms	384 KiB		282 Bytes	2022-9-9 18:36:13
AC	wangtan	14ms	384 KiB		197 Bytes	2023-3-12 14:37:39
AC	科比.布莱恩特 (董浩琰)	14ms	384 KiB		241 Bytes	2023-3-25 18:48:11
AC	luosifu22006	14ms	512 KiB		197 Bytes	2022-8-15 17:51:38
AC	爱情海校区—沙天一 (沙天一)	14ms	6.8 MiB		167 Bytes	2023-10-2 20:38:02
AC	李山水	14ms	432 KiB		224 Bytes	2022-2-20 9:05:21
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	392 KiB		239 Bytes	2022-8-9 15:14:19
AC	BJ6180C8CTD (Fan)	14ms	6.7 MiB		286 Bytes	2023-9-17 20:27:17
AC	kkksc03 (彭士锋)	14ms	384 KiB		194 Bytes	2022-3-5 13:41:32
AC	缥 (王硕2012)	14ms	384 KiB		253 Bytes	2022-11-16 21:40:01
AC	付柏乐	14ms	384 KiB		224 Bytes	2023-6-1 7:58:07
AC	新壹街校区-杨轩懿 (杨轩懿1)	14ms	6.8 MiB		241 Bytes	2023-10-22 10:36:24
AC	第五人格启动 (罗子键)	14ms	392 KiB		250 Bytes	2023-3-25 18:49:38