画矩形

状态	递交者	时间	内存	语言	代码	递交时间
AC	周琪渃	29ms	388 KiB		682 Bytes	2023-1-3 20:59:19
AC	谭懿轩 (yanyixuan)	29ms	432 KiB		393 Bytes	2022-2-26 15:14:15
AC	Jack	29ms	392 KiB		280 Bytes	2023-3-23 19:45:23
AC	时代一校林星宇 (lxy)	30ms	428 KiB		451 Bytes	2022-9-10 17:08:42
AC	朱泽晟	30ms	512 KiB		466 Bytes	2022-8-31 15:59:20
AC	22029-hqh	30ms	400 KiB		602 Bytes	2023-2-5 15:39:58
AC	源著校区-宋昊成 (马冬梅)	30ms	448 KiB		680 Bytes	2023-2-25 18:28:14
AC	ganlin1	30ms	6.9 MiB		456 Bytes	2023-7-27 12:05:45
AC	李龙腾 (llt)	30ms	432 KiB		428 Bytes	2022-9-3 20:27:19
AC	缥 (王硕2012)	30ms	384 KiB		422 Bytes	2022-11-24 20:53:47
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	384 KiB		376 Bytes	2023-5-4 14:23:37
AC	李卓燃 (李卓燃1)	31ms	440 KiB		722 Bytes	2023-3-11 21:46:51
AC	xuniaoyin (徐袅音)	31ms	6.7 MiB		588 Bytes	2023-8-30 11:35:40
AC	11451254188 (22029-mjh)	31ms	452 KiB		365 Bytes	2022-11-28 22:21:07
AC	Jack	31ms	440 KiB		400 Bytes	2023-3-23 19:41:36
AC	yang	31ms	384 KiB		640 Bytes	2022-9-9 12:33:27
AC	繁星 (05c35-zzm)	31ms	512 KiB		548 Bytes	2022-11-17 11:42:14
AC	葛琮扬	31ms	6.9 MiB		296 Bytes	2023-7-21 12:18:49
AC	朱老师 (zyp)	31ms	512 KiB		393 Bytes	2022-11-24 18:24:44
AC	坤坤荔枝小黑子 (zhonghaotian22006)	31ms	448 KiB		543 Bytes	2022-11-16 13:22:57
AC	leisixian (22029-lyh)	31ms	512 KiB		320 Bytes	2022-11-24 21:07:26
AC	Nico	31ms	6.8 MiB		361 Bytes	2023-6-22 11:11:30
AC	爱琴海校区-刁钲洋 (刁钲洋)	32ms	6.7 MiB		779 Bytes	2023-9-16 21:19:19
AC	ttt123	32ms	512 KiB		432 Bytes	2022-11-25 19:33:30
AC	RanHao	32ms	6.9 MiB		539 Bytes	2023-7-22 18:41:55
AC	孙烽轶 (sfy)	32ms	7.5 MiB		450 Bytes	2023-7-9 9:58:52
AC	新壹街陈科言 (cky)	32ms	7.3 MiB		558 Bytes	2023-7-20 14:39:01
AC	colin1112 (墙凌可)	32ms	436 KiB		440 Bytes	2023-3-18 15:01:46
AC	ttt123	33ms	420 KiB		376 Bytes	2022-11-24 20:06:20
AC	邵冠铖 (shaoguancheng22031)	33ms	512 KiB		384 Bytes	2022-11-26 11:58:15
AC	稻妻第一深情 (喝酒の吟游诗人)	34ms	428 KiB		1.5 KiB	2023-1-14 15:25:34
AC	程曦漫	34ms	7.3 MiB		469 Bytes	2024-1-5 20:28:41
AC	缥 (王硕2012)	34ms	512 KiB		424 Bytes	2022-11-24 20:53:26
AC	罗翌珂 (dangdang)	34ms	512 KiB		414 Bytes	2022-9-8 22:18:56
AC	^_^ (ctc)	34ms	512 KiB		362 Bytes	2022-10-26 20:04:04
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)	35ms	512 KiB		342 Bytes	2022-11-24 20:20:51
AC	majinhui	35ms	512 KiB		501 Bytes	2022-7-20 17:02:20
AC	邵冠铖 (shaoguancheng22031)	35ms	428 KiB		350 Bytes	2023-1-11 16:14:02
AC	新一街校区Jason_LuoYouZheng (罗友峥)	35ms	392 KiB		532 Bytes	2022-9-8 21:12:29
AC	时代一校-赵彦博 (zyb)	35ms	6.9 MiB		383 Bytes	2023-8-5 13:26:21
AC	郑驭辰	36ms	7 MiB		280 Bytes	2023-12-20 20:13:51
AC	煞笔笔	38ms	7.3 MiB		359 Bytes	2024-1-19 11:36:51
AC	徐正旺 (xzw)	39ms	440 KiB		281 Bytes	2022-8-23 8:13:21
AC	贾博涵	39ms	6.6 MiB		492 Bytes	2023-11-22 10:32:30
AC	ywj	39ms	7.1 MiB		478 Bytes	2023-11-11 20:13:52
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	41ms	7.1 MiB		297 Bytes	2023-12-30 20:50:17
AC	zyl	43ms	7.3 MiB		477 Bytes	2024-1-4 10:53:23
AC	wangjun	46ms	7.2 MiB		326 Bytes	2023-11-29 20:22:58
AC	hrz	47ms	7 MiB		292 Bytes	2024-1-24 10:24:00
AC	没有此人 (akm)	49ms	6.9 MiB		666 Bytes	2023-7-2 19:05:02
AC	zvt_132 (任子轩)	129ms	764 KiB		428 Bytes	2024-3-27 20:20:55
AC	杨骏逸	130ms	764 KiB		424 Bytes	2024-2-24 22:38:37
AC	赵奕铭	131ms	764 KiB		529 Bytes	2024-3-7 20:54:43
AC	dyp (hhy)	131ms	764 KiB		476 Bytes	2024-1-28 12:17:35
AC	jdy	134ms	764 KiB		433 Bytes	2024-3-6 15:30:03
AC	Guest	135ms	764 KiB	C++11(O2)	479 Bytes	2024-9-8 10:38:31
AC	金沙-文豪 (wenhao)	135ms	768 KiB		518 Bytes	2024-3-3 17:35:41
AC	My name is Man (钟卓劭)	139ms	764 KiB		455 Bytes	2024-3-17 14:44:57
AC	崔欧辰	143ms	536 KiB	C++11	549 Bytes	2024-9-8 10:41:29
AC	fcxin	251ms	9.4 MiB	Python 3	311 Bytes	2024-8-9 13:36:34
AC	安闵煜 (anzai)	353ms	9.6 MiB	Python 3	243 Bytes	2023-11-9 9:51:19
AC	高俊	368ms	9.1 MiB	Python 3	288 Bytes	2023-10-19 14:29:37
AC	伍行念 (wuxingnian)	386ms	9.1 MiB	Python 3	404 Bytes	2023-8-23 0:33:48
AC	19598	408ms	9 MiB	Python 3	230 Bytes	2023-8-13 17:42:46
AC	梨冻亿 (wiueh)	411ms	3.9 MiB	Python 3	296 Bytes	2022-1-23 18:08:04
AC	kongql	416ms	3.9 MiB	Python 3	560 Bytes	2022-7-22 10:13:17
AC	范老师	418ms	3.9 MiB	Python 3	501 Bytes	2022-12-15 11:41:55
AC	kongql	418ms	3.9 MiB	Python 3	560 Bytes	2022-7-22 10:13:30
AC	cola	435ms	4.1 MiB	Python 3	362 Bytes	2022-12-17 15:39:06
AC	谭红中 (不知道)	683ms	9.8 MiB	Python 3	166 Bytes	2024-1-17 16:56:08
AC	Qinxiu	1091ms	4 MiB	Python 3	308 Bytes	2024-2-3 13:01:14