喷水装置

状态	递交者	时间	内存	语言	代码	递交时间
AC	chen (peter)	13ms	392 KiB		84 Bytes	2022-5-29 19:00:10
AC	冒牌陈杰晟【MOD】 (wed)	13ms	432 KiB		275 Bytes	2022-5-29 18:53:31
AC	姚宏逸	14ms	384 KiB		364 Bytes	2022-5-30 16:23:24
AC	时代二校-王盼兮 (wangpanxi)	14ms	7 MiB	C++11(O2)	415 Bytes	2024-5-25 17:05:30
AC	赵沛喆	14ms	384 KiB		316 Bytes	2022-7-27 13:32:42
AC	56 (13883454928)	15ms	392 KiB		84 Bytes	2023-3-23 20:41:40
AC	汤杰尧 (05c05-tjy1)	15ms	436 KiB		299 Bytes	2023-2-16 16:55:22
AC	李彦臻	16ms	7 MiB	C++98	383 Bytes	2024-6-28 20:08:12
AC	tongxiao	16ms	6.6 MiB	C++20(O2)	414 Bytes	2024-7-25 14:17:15
AC	jdy	16ms	6.8 MiB	C++98	368 Bytes	2024-6-27 0:27:31
AC	zcx	16ms	6.8 MiB		377 Bytes	2023-6-7 20:17:57
AC	MoonLight ( aaa)	16ms	440 KiB		286 Bytes	2022-8-11 9:42:50
AC	tongxiao	16ms	6.6 MiB	C++20(O2)	408 Bytes	2024-7-25 14:14:59
AC	qinyi	16ms	384 KiB		382 Bytes	2022-5-28 17:15:39
AC	wangruibo20xh	16ms	444 KiB		286 Bytes	2022-3-5 19:25:45
AC	Nico	16ms	6.8 MiB	C++11	361 Bytes	2024-7-2 10:56:43
AC	admin	16ms	512 KiB		286 Bytes	2022-9-24 14:25:31
AC	时代二校-焦雨齐 (Angel)	16ms	6.8 MiB	C++11	422 Bytes	2024-5-25 16:18:55
AC	zlx (xiao)	16ms	512 KiB		455 Bytes	2022-11-26 20:18:13
AC	CK (李弘毅)	16ms	7 MiB		421 Bytes	2023-12-30 13:27:03
AC	新壹街校区-冉睦阳（想要无敌天下吗，葵花宝典有售，不要18880，只要9999） (冉睦阳)	17ms	7 MiB	C++98	341 Bytes	2024-5-13 20:04:45
AC	scallway	17ms	6.9 MiB	C++11	343 Bytes	2024-8-17 11:03:04
AC	时代2校-程俊燃 (chengjunran)	17ms	7 MiB	C++11	402 Bytes	2024-5-25 16:50:00
AC	tongxiao	17ms	7 MiB	C++20(O2)	489 Bytes	2024-6-27 9:49:12
AC	_PXY_	17ms	384 KiB		205 Bytes	2022-1-22 8:24:28
AC	zyl	17ms	7.2 MiB	C++11(O2)	414 Bytes	2024-5-18 16:42:23
AC	金沙校区-鲍钰森 (鲍钰森)	17ms	6.9 MiB	C++98	343 Bytes	2024-8-18 16:43:40
AC	scallway	17ms	6.9 MiB	C++11	343 Bytes	2024-8-17 11:04:22
AC	RanHao	17ms	6.7 MiB		380 Bytes	2023-9-12 18:20:52
AC	新壹街校区-陈琬舒 (空空大师)	17ms	7.2 MiB	C++98	388 Bytes	2024-5-12 11:00:42
AC	NJL (NJlL)	17ms	384 KiB		307 Bytes	2022-5-29 18:23:05
AC	贾鑫豪 (Mr Sam)	17ms	384 KiB		382 Bytes	2022-7-1 16:01:57
AC	朱老师 (zyp)	17ms	384 KiB		430 Bytes	2022-11-20 15:53:22
AC	新壹街—熊轩杭 (xiongxuanhang)	17ms	7.2 MiB	C++98(O2)	364 Bytes	2024-5-4 17:51:06
AC	不怎么聪明的家伙 (贺俊楠)	17ms	7.2 MiB	C++98(O2)	364 Bytes	2024-5-12 10:58:08
AC	ycy	17ms	384 KiB		868 Bytes	2022-9-19 4:54:29
AC	zhm123	17ms	448 KiB		333 Bytes	2023-4-27 11:31:36
AC	李倾城的忠实假粉 (向熠可)	18ms	512 KiB		341 Bytes	2022-3-29 21:27:11
AC	zzzrrrxxx	18ms	6.9 MiB		392 Bytes	2023-10-22 17:58:55
AC	陈杰晟	18ms	384 KiB		463 Bytes	2022-5-31 17:26:23
AC	蒋雨轩 (jiangyuxuan)	18ms	384 KiB		906 Bytes	2022-2-27 14:14:46
AC	李廷旭 (litingxu)	18ms	6.9 MiB		521 Bytes	2023-10-22 18:05:30
AC	朱老师 (zyp)	18ms	384 KiB		430 Bytes	2022-11-20 15:57:10
AC	dustsans (njo)	18ms	384 KiB		404 Bytes	2023-5-5 17:33:56
AC	朱老师 (zyp)	18ms	392 KiB		354 Bytes	2022-11-20 15:57:41
AC	李禹衡 (liyuheng22006)	18ms	7 MiB		264 Bytes	2023-7-4 16:30:32
AC	56 (13883454928)	18ms	384 KiB		328 Bytes	2023-3-23 20:41:57
AC	56 (13883454928)	18ms	384 KiB		328 Bytes	2023-3-23 20:40:01
AC	huanglu	18ms	6.8 MiB		369 Bytes	2023-10-13 13:48:43
AC	12345	18ms	504 KiB		358 Bytes	2022-7-1 16:00:59
AC	zhangjinsheng	18ms	420 KiB		475 Bytes	2022-2-27 14:41:47
AC	xuchenhao	18ms	384 KiB		371 Bytes	2022-2-27 14:47:54
AC	时代一校 - 冯隆浩 (冯隆浩)	18ms	392 KiB		443 Bytes	2023-4-8 21:08:49
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	7 MiB		260 Bytes	2023-7-4 16:29:16
AC	. (Pig)	18ms	384 KiB		351 Bytes	2022-8-27 15:02:46
AC	56 (13883454928)	18ms	384 KiB		328 Bytes	2023-3-23 20:40:42
AC	刘老师 (图书管理员)	18ms	384 KiB		411 Bytes	2022-8-27 14:55:26
AC	希蒙 (zhengxingya)	18ms	7.2 MiB		532 Bytes	2023-9-23 11:28:19
AC	杜是贤 (dushixian)	18ms	440 KiB		351 Bytes	2022-7-3 21:40:59
AC	22029-zjs	18ms	6.8 MiB		394 Bytes	2023-6-9 21:16:32
AC	啊...这 (炼狱杏寿郎)	19ms	392 KiB		378 Bytes	2022-7-1 16:04:58
AC	ycy	19ms	444 KiB		505 Bytes	2022-9-15 14:42:17
AC	黄誉翔 (黄誉翔)	19ms	384 KiB		502 Bytes	2023-4-8 21:09:33
AC	周琪渃	19ms	452 KiB		402 Bytes	2023-5-27 18:46:23
AC	黄誉翔 (黄誉翔)	19ms	384 KiB		535 Bytes	2023-4-8 21:09:49
AC	huanglu	19ms	444 KiB		452 Bytes	2022-12-16 13:57:46
AC	xuchenhao	19ms	384 KiB		359 Bytes	2022-2-27 14:49:06
AC	11451254188 (22029-mjh)	19ms	6.7 MiB		414 Bytes	2023-6-7 21:32:58
AC	经常消失 (小萝卜)	19ms	432 KiB		358 Bytes	2022-6-11 13:23:51
AC	1396013295	19ms	432 KiB		893 Bytes	2022-2-25 20:00:46
AC	zhangheyi22006	19ms	512 KiB		327 Bytes	2022-11-29 21:32:36
AC	刘鹤枫 (liuhefeng)	19ms	436 KiB		397 Bytes	2022-8-10 16:20:04
AC	李山水	19ms	436 KiB		360 Bytes	2022-7-27 11:35:38
AC	huyinuo	19ms	444 KiB		495 Bytes	2022-8-22 11:42:51
AC	李树崑 (lishukun)	19ms	512 KiB		407 Bytes	2022-8-19 21:17:54
AC	郑栋文	19ms	440 KiB		421 Bytes	2022-4-10 15:58:06
AC	. (Pig)	19ms	420 KiB		351 Bytes	2022-8-27 15:03:03
AC	郑岐蔚	19ms	512 KiB		524 Bytes	2023-4-19 20:40:07
AC	超级管理员 (root)	19ms	436 KiB		460 Bytes	2022-2-27 14:39:35
AC	我是傻逼	19ms	448 KiB		521 Bytes	2023-4-8 21:14:10
AC	wangchenyu	19ms	384 KiB		393 Bytes	2023-3-23 20:37:30
AC	刘老师 (图书管理员)	19ms	448 KiB		440 Bytes	2022-8-27 14:33:20
AC	曾御城（现用名） (Jason)	20ms	432 KiB		502 Bytes	2022-7-25 19:46:16
AC	ttt123	20ms	6.8 MiB		389 Bytes	2023-6-9 21:06:56
AC	ttt123	20ms	6.7 MiB		451 Bytes	2023-6-10 9:26:28
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)	20ms	6.5 MiB		399 Bytes	2023-6-3 19:59:52
AC	朱老师 (zyp)	20ms	392 KiB		430 Bytes	2022-11-20 15:57:00
AC	超级管理员 (root)	20ms	440 KiB		447 Bytes	2022-2-27 14:10:47
AC	时代校区-刘臣原 (微笑王子)	20ms	440 KiB		354 Bytes	2022-10-31 21:10:04
AC	CPL	21ms	400 KiB		451 Bytes	2023-3-19 11:21:29
AC	CYT	21ms	444 KiB		419 Bytes	2023-3-22 12:09:15
AC	xiongxinyao	21ms	420 KiB		636 Bytes	2023-3-19 11:22:42
AC	renqiumo	21ms	448 KiB		495 Bytes	2022-11-13 13:56:10
AC	Tender. (05c05-zhou)	22ms	512 KiB		299 Bytes	2022-11-25 10:35:43
AC	wangjun	27ms	7 MiB		376 Bytes	2023-12-22 15:52:29
AC	曹埊睿 (caodirui)	29ms	6.3 MiB		348 Bytes	2023-11-16 18:25:46
AC	坤坤荔枝小黑子 (zhonghaotian22006)	29ms	412 KiB		462 Bytes	2022-11-21 9:20:22
AC	scallway	29ms	7 MiB		343 Bytes	2023-12-21 16:03:06
AC	坤坤荔枝小黑子 (zhonghaotian22006)	39ms	7.3 MiB		329 Bytes	2024-1-21 9:20:04
AC	刘煜轩	66ms	536 KiB		556 Bytes	2024-3-3 15:15:00