画直角梯形

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡宸华 (huchenhua)	17ms	312 KiB		189 Bytes	2023-1-8 21:57:10
AC	杜俊宏	25ms	396 KiB		194 Bytes	2022-7-30 21:48:05
AC	詹宇航 (zyh7)	25ms	384 KiB		177 Bytes	2022-6-12 20:58:31
AC	叶哲宇 (yzy)	26ms	7.1 MiB	C++11	193 Bytes	2024-5-5 14:03:28
AC	张瑞博	26ms	6.6 MiB	C++11	758 Bytes	2024-7-29 22:51:26
AC	张颢瀛	26ms	392 KiB		180 Bytes	2022-7-19 15:58:04
AC	姚宏逸	26ms	416 KiB		213 Bytes	2022-5-30 16:25:51
AC	Yuan (Zongzi1)	26ms	6.6 MiB	C++17(O2)	230 Bytes	2024-7-18 19:31:13
AC	李某人	26ms	388 KiB		177 Bytes	2022-7-19 15:57:55
AC	Erin	26ms	7 MiB	C++98	182 Bytes	2024-5-28 14:44:44
AC	zcx	26ms	384 KiB		195 Bytes	2023-2-11 9:22:59
AC	heyi	26ms	6.8 MiB	C++98(O2)	227 Bytes	2024-8-11 11:21:30
AC	张祖名	26ms	6.9 MiB	C++98(O2)	207 Bytes	2024-6-11 22:33:55
AC	谭懿轩 (yanyixuan)	27ms	440 KiB		190 Bytes	2022-3-25 22:44:38
AC	汪致卉 (wangzh)	27ms	392 KiB		221 Bytes	2022-1-23 18:47: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)	27ms	384 KiB		242 Bytes	2023-2-11 9:14:13
AC	lch (凌昌瀚)	27ms	440 KiB		177 Bytes	2022-6-11 23:03:13
AC	我推的乱破 (贺俊楠)	27ms	7.2 MiB	C++98	233 Bytes	2024-5-5 9:10:16
AC	22029-zjs	27ms	384 KiB		228 Bytes	2023-2-11 9:20:05
AC	魑归sama	27ms	476 KiB		177 Bytes	2022-7-12 16:28:54
AC	赵沛喆	27ms	384 KiB		196 Bytes	2022-9-2 14:29:05
AC	张泰凌 (ztl)	27ms	384 KiB		202 Bytes	2022-2-26 12:10:25
AC	11451254188 (22029-mjh)	27ms	384 KiB		215 Bytes	2023-2-11 9:27:06
AC	段淏泷	27ms	7 MiB	C++98	195 Bytes	2024-6-23 13:26:02
AC	1396013295	27ms	384 KiB		261 Bytes	2022-1-22 19:06:01
AC	李彭宋代诗人 (ljy123456)	27ms	384 KiB		205 Bytes	2023-4-12 21:34:20
AC	吴俊成 (wujuncheng)	27ms	428 KiB		264 Bytes	2022-7-11 23:01:49
AC	疯神芭芭脱丝 (李卓修)	27ms	512 KiB		217 Bytes	2022-7-16 18:38:27
AC	新壹街——陈学彬 (BUG)	27ms	512 KiB		178 Bytes	2022-2-27 11:37:15
AC	AG.一诺	27ms	384 KiB		192 Bytes	2022-2-27 11:39:27
AC	huyinuo	27ms	436 KiB		222 Bytes	2022-5-5 20:39:55
AC	旷山 (15213268688)	27ms	396 KiB		193 Bytes	2022-2-27 11:31:07
AC	伍行念 (wuxingnian)	27ms	6.8 MiB		250 Bytes	2023-10-8 16:19:44
AC	yanglang	27ms	384 KiB		197 Bytes	2023-3-4 14:44:55
AC	新一街校区Jason_LuoYouZheng (罗友峥)	27ms	392 KiB		176 Bytes	2022-2-26 12:04:03
AC	三藏的痔疮 (不会玩是原罪)	27ms	384 KiB		194 Bytes	2022-1-21 14:30:53
AC	xiangsiyu	27ms	384 KiB		202 Bytes	2022-7-2 17:33:26
AC	22029-lsl	27ms	392 KiB		204 Bytes	2023-2-11 9:15:33
AC	dmh (丁墨涵)	27ms	432 KiB		263 Bytes	2022-3-9 22:06:59
AC	缥 (王硕2012)	28ms	384 KiB		270 Bytes	2023-2-11 9:18:10
AC	无尽的想象 (谭仕高)	28ms	444 KiB		189 Bytes	2022-7-30 17:39:37
AC	黄梓桐 (HuangZiTong)	28ms	388 KiB		177 Bytes	2022-8-9 12:19:36
AC	MoonLight ( aaa)	28ms	412 KiB		239 Bytes	2022-1-25 12:08:58
AC	希蒙 (zhengxingya)	28ms	6.8 MiB		226 Bytes	2023-10-11 17:52:28
AC	NJL (NJlL)	28ms	512 KiB		211 Bytes	2022-7-6 15:20:55
AC	罗晨睿 (luochenrui)	28ms	492 KiB		199 Bytes	2022-6-29 13:34:12
AC	赵泳鑫 (zhaoyongxin)	28ms	440 KiB		233 Bytes	2022-7-17 10:54:24
AC	ywh	28ms	384 KiB		245 Bytes	2022-2-26 12:11:11
AC	坤坤荔枝小黑子 (zhonghaotian22006)	28ms	512 KiB		230 Bytes	2022-11-30 9:15:07
AC	wangzihang	28ms	436 KiB	C++	163 Bytes	2022-8-4 10:46:17
AC	谢延灏 (xeiyanhao---a handsome boy)	28ms	436 KiB		189 Bytes	2022-4-15 19:53:43
AC	时代二校-焦雨齐 (Angel)	28ms	6.8 MiB		204 Bytes	2023-6-10 15:49:53
AC	经常消失 (小萝卜)	28ms	436 KiB		234 Bytes	2022-7-17 13:57:46
AC	曹埊睿 (caodirui)	29ms	392 KiB		232 Bytes	2023-5-7 15:06:21
AC	zzl	29ms	6.8 MiB		182 Bytes	2023-11-7 1:18:55
AC	阮 (媚狐不吃道旁李)	29ms	7.1 MiB	C++98	232 Bytes	2024-5-25 16:41:31
AC	杜是贤 (dushixian)	29ms	444 KiB		186 Bytes	2022-2-27 11:20:15
AC	赵鑫宸 (xiaoxiao721)	29ms	444 KiB		293 Bytes	2022-2-27 17:37:06
AC	xiongxinyao	29ms	384 KiB		193 Bytes	2022-2-26 12:07:00
AC	王韵淮	29ms	444 KiB		168 Bytes	2022-6-5 11:20:53
AC	Tender. (05c05-zhou)	29ms	440 KiB		242 Bytes	2023-2-17 20:09:19
AC	赵一嵘 (zhaoyirong)	29ms	536 KiB		222 Bytes	2022-2-28 19:31:53
AC	陈杰晟	29ms	512 KiB		238 Bytes	2022-3-24 15:43:49
AC	zhangyh (张育菡)	29ms	440 KiB		205 Bytes	2022-7-18 8:21:18
AC	Nico	29ms	6.9 MiB		182 Bytes	2023-7-18 13:13:50
AC	wangruibo20xh	29ms	440 KiB		163 Bytes	2022-2-11 18:35:30
AC	江科毅 (jky)	29ms	512 KiB		187 Bytes	2023-5-7 14:08:27
AC	蒲梓勋 (puzixun)	29ms	512 KiB		257 Bytes	2022-8-12 17:34:21
AC	王晨志 (wangchenzhi)	29ms	436 KiB		401 Bytes	2022-7-27 19:36:15
AC	关博源	29ms	496 KiB		225 Bytes	2023-3-24 21:00:36
AC	zhm123	29ms	384 KiB		208 Bytes	2023-6-1 15:36:46
AC	时代2校-程俊燃 (chengjunran)	29ms	6.8 MiB		203 Bytes	2023-6-10 15:48:39
AC	吴恩子	29ms	6.8 MiB		188 Bytes	2023-10-9 21:39:38
AC	稻妻第一深情 (喝酒の吟游诗人)	30ms	444 KiB		1.3 KiB	2023-3-11 23:53:19
AC	AC[谭赫奕] (tanheyi)	30ms	6.7 MiB		230 Bytes	2023-9-29 16:13:23
AC	17779	30ms	436 KiB		213 Bytes	2022-3-21 17:19:14
AC	周琪渃	30ms	6.7 MiB		260 Bytes	2023-9-8 22:23:45
AC	huanglu	30ms	7.1 MiB		194 Bytes	2023-7-18 14:58:06
AC	爱琴海校区-刁钲洋 (刁钲洋)	30ms	444 KiB		270 Bytes	2023-4-16 14:45:32
AC	zvt_132 (任子轩)	30ms	6.7 MiB		203 Bytes	2023-9-1 20:35:16
AC	朱老师 (zyp)	30ms	512 KiB		221 Bytes	2022-8-7 11:26:27
AC	SYC0226	30ms	520 KiB		214 Bytes	2022-3-20 13:46:42
AC	刘锦航	30ms	384 KiB		199 Bytes	2022-12-31 19:17:24
AC	冒牌陈杰晟【MOD】 (wed)	30ms	432 KiB		221 Bytes	2022-3-6 18:29:03
AC	刘昊臻 (liuhaozhen)	31ms	436 KiB		199 Bytes	2023-5-29 20:42:08
AC	RanHao	31ms	6.9 MiB		235 Bytes	2023-7-18 15:33:24
AC	xuniaoyin (徐袅音)	31ms	6.7 MiB		226 Bytes	2023-8-30 11:48:06
AC	colin1112 (墙凌可)	31ms	6.7 MiB		212 Bytes	2023-9-4 21:19:11
AC	^_^ (ctc)	31ms	512 KiB		184 Bytes	2022-10-19 20:43:46
AC	刘蕤箎	31ms	6.7 MiB		179 Bytes	2023-8-25 16:49:31
AC	芒苒忧 (廖迦南)	31ms	528 KiB		201 Bytes	2022-8-27 16:05:29
AC	贾博涵	31ms	7.2 MiB		190 Bytes	2023-12-1 10:36:36
AC	新壹街校区--税崇峻 (税崇峻)	31ms	6.9 MiB		200 Bytes	2023-7-26 10:05:51
AC	新壹街校区-杨轩懿 (杨轩懿1)	31ms	6.9 MiB		186 Bytes	2023-7-25 11:04:54
AC	没有此人 (akm)	31ms	7 MiB		267 Bytes	2023-7-4 16:23:24
AC	黄立信	31ms	6.8 MiB		228 Bytes	2023-11-6 20:44:51
AC	小忙果 (王昱杰)	31ms	6.9 MiB		197 Bytes	2023-7-18 8:56:32
AC	孙烽轶 (sfy)	32ms	7.5 MiB		181 Bytes	2023-7-9 10:02:08
AC	张雯皓 (zhangwenhao)	32ms	7 MiB		202 Bytes	2023-12-23 11:21:31
AC	zhangxiushi	32ms	432 KiB		204 Bytes	2022-12-31 19:11:02