温度统计

状态	递交者	时间	内存	语言	代码	递交时间
AC	jiangzhenghan	13ms	7.2 MiB	C++98	461 Bytes	2024-4-23 19:41:45
AC	李哲 (lizhe)	13ms	436 KiB		263 Bytes	2022-7-20 21:39:59
AC	钟元朗	13ms	384 KiB		217 Bytes	2022-10-29 20:56:33
AC	王晴萱	13ms	7.1 MiB	C++11	266 Bytes	2024-5-18 9:58:52
AC	何昊宇 (22016-hhy)	13ms	396 KiB		268 Bytes	2022-9-18 9:47:40
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	436 KiB		280 Bytes	2022-7-3 9:25:43
AC	xuniaoyin (徐袅音)	13ms	512 KiB		219 Bytes	2023-5-5 20:32:30
AC	吴思谛 (wusidi)	13ms	500 KiB		309 Bytes	2022-6-30 11:14:23
AC	郑之策	13ms	384 KiB		224 Bytes	2022-5-29 11:48:53
AC	(金沙天街)严皓月 (严皓月)	13ms	436 KiB		246 Bytes	2023-5-7 10:35:46
AC	赵一嵘 (zhaoyirong)	13ms	384 KiB		252 Bytes	2022-6-3 16:48:09
AC	靳博然 (jbr)	13ms	512 KiB		270 Bytes	2023-5-14 17:31:32
AC	缥 (王硕2012)	13ms	384 KiB		344 Bytes	2023-1-27 16:53:41
AC	新一街校区Jason_LuoYouZheng (罗友峥)	13ms	384 KiB		287 Bytes	2022-5-28 19:50:43
AC	陈秋石	13ms	384 KiB		251 Bytes	2022-6-26 10:40:54
AC	时代校区-孔令皓 (konglinghao)	13ms	6.9 MiB	C++98	257 Bytes	2024-6-10 21:51:23
AC	傅博涛	13ms	384 KiB		211 Bytes	2022-5-29 11:44:57
AC	陈佳婧	13ms	384 KiB		250 Bytes	2022-9-9 20:47:35
AC	江子墨	14ms	7 MiB	C++98	231 Bytes	2024-6-9 9:59:59
AC	wuqi	14ms	384 KiB		276 Bytes	2023-5-19 17:46:43
AC	凌肯 (lingken22006)	14ms	408 KiB		290 Bytes	2022-8-14 20:16:35
AC	hzm	14ms	444 KiB		223 Bytes	2022-9-2 14:32:11
AC	张梓浩 (zhangzihao)	14ms	424 KiB		286 Bytes	2023-5-24 20:18:53
AC	22029-zjs	14ms	384 KiB		297 Bytes	2023-5-12 21:34:29
AC	草\|\|草 (陈星佑)	14ms	384 KiB		297 Bytes	2022-6-30 11:09:36
AC	zhangheyi22006	14ms	392 KiB		234 Bytes	2022-8-13 16:55:39
AC	任舒尧	14ms	384 KiB		261 Bytes	2022-9-9 20:23:15
AC	凌肯 (lingken22006)	14ms	384 KiB		290 Bytes	2022-8-14 20:16:36
AC	黄立信	14ms	384 KiB		280 Bytes	2023-5-16 21:30:15
AC	郑之策	14ms	412 KiB		224 Bytes	2022-5-29 11:49:02
AC	罗毅川 (scp-049)	14ms	392 KiB		261 Bytes	2022-6-3 19:11: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)	14ms	440 KiB		301 Bytes	2022-12-9 17:56:17
AC	程舒然	14ms	6.9 MiB	C++11	240 Bytes	2024-8-22 11:54:58
AC	郭益豪（帅哥） (guoyihao)	14ms	400 KiB		288 Bytes	2023-4-16 17:29:53
AC	郑之策	14ms	384 KiB		224 Bytes	2022-5-29 11:48:59
AC	郑之策	14ms	384 KiB		224 Bytes	2022-5-29 11:48:59
AC	Randy Marsh (杨子腾)	14ms	384 KiB		298 Bytes	2022-5-29 11:45:42
AC	王彬羽 (wby)	14ms	448 KiB		283 Bytes	2023-5-8 20:57:46
AC	SB (mfy01)	14ms	512 KiB		233 Bytes	2023-2-2 20:37:23
AC	郑淇予 (macabaca)	14ms	436 KiB		273 Bytes	2022-6-5 9:42:50
AC	sb (吴振宇)	14ms	392 KiB		242 Bytes	2023-5-13 15:13:27
AC	陈红恺 (chk)	14ms	444 KiB		212 Bytes	2022-7-26 14:08:46
AC	何昊宇 (22016-hhy)	14ms	392 KiB		268 Bytes	2022-9-18 9:47:47
AC	TBB (杜昊燃)	14ms	420 KiB		307 Bytes	2022-9-13 16:28:00
AC	dengduxi	14ms	436 KiB		259 Bytes	2022-12-5 20:26:48
AC	冒牌陈杰晟【MOD】 (wed)	14ms	440 KiB		407 Bytes	2022-6-8 18:56:59
AC	何昊宇 (22016-hhy)	14ms	392 KiB		268 Bytes	2022-9-18 9:47:46
AC	伍芷函	14ms	512 KiB		267 Bytes	2023-5-7 12:09:19
AC	王晨志 (wangchenzhi)	14ms	444 KiB		315 Bytes	2022-7-28 18:04:27
AC	xiangsiyu	14ms	512 KiB		239 Bytes	2022-7-3 17:42:58
AC	邬文博	14ms	392 KiB		269 Bytes	2022-7-1 15:30:33
AC	杨皓淞	14ms	7.1 MiB		249 Bytes	2023-10-15 15:19:22
AC	陈致远Lynn	14ms	6.7 MiB		225 Bytes	2023-9-30 21:00:44
AC	(张洛诚)	14ms	432 KiB		312 Bytes	2023-5-5 19:09:56
AC	李林峰 (金克拉)	14ms	432 KiB		232 Bytes	2022-8-31 20:07:06
AC	灵光sans (wangchihao)	14ms	392 KiB		218 Bytes	2023-4-15 15:34:36
AC	杨滨郝 (ybh)	14ms	436 KiB		290 Bytes	2022-7-27 9:08:30
AC	ask (ayk)	14ms	384 KiB		330 Bytes	2022-10-28 21:25:11
AC	朱老师 (zyp)	14ms	440 KiB		274 Bytes	2022-7-31 16:08:38
AC	luosifu22006	14ms	440 KiB		254 Bytes	2022-8-18 17:06:29
AC	王涵熙 (水煮大肠)	14ms	436 KiB		242 Bytes	2022-7-8 9:15:22
AC	德意志第三帝国 (陈远桥)	14ms	392 KiB		223 Bytes	2022-5-29 17:42:45
AC	何昊宇 (22016-hhy)	14ms	392 KiB		268 Bytes	2022-9-18 9:47:47
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	444 KiB		228 Bytes	2023-4-30 8:07:42
AC	22029-lsl	14ms	440 KiB		311 Bytes	2022-12-9 18:04:39
AC	李樊駁	14ms	7.1 MiB		221 Bytes	2023-10-15 15:19:41
AC	时代一校林星宇 (lxy)	14ms	492 KiB		248 Bytes	2022-9-10 20:35:50
AC	dyz	14ms	6.7 MiB		265 Bytes	2023-8-26 14:09:23
AC	马兴宇 (mxy01)	14ms	420 KiB		276 Bytes	2022-10-1 18:57:28
AC	凌肯 (lingken22006)	14ms	384 KiB		290 Bytes	2022-8-14 20:16:36
AC	の (魏子恒)	14ms	440 KiB		238 Bytes	2022-8-31 18:52:51
AC	lihaotian	14ms	392 KiB		242 Bytes	2022-8-24 18:22:44
AC	冉宸语	14ms	6.7 MiB		257 Bytes	2023-10-1 15:33:28
AC	明哲瀚 (18580067605)	14ms	512 KiB		269 Bytes	2023-2-15 20:35:55
AC	miku (阳沐珊)	14ms	440 KiB		257 Bytes	2022-6-30 10:41:21
AC	李龙腾 (llt)	14ms	384 KiB		238 Bytes	2022-9-10 20:46:48
AC	陈雨泽1	14ms	392 KiB		272 Bytes	2023-1-30 17:29:23
AC	wuzhenghan	14ms	384 KiB		285 Bytes	2022-9-4 17:31:15
AC	张瑞博	14ms	7.1 MiB	C++11	216 Bytes	2024-5-12 16:59:07
AC	任童(rentong)	14ms	512 KiB		268 Bytes	2022-8-15 20:53:03
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	14ms	444 KiB		267 Bytes	2022-7-5 14:13:24
AC	时代一校蒋帛希 (13983392730)	14ms	436 KiB		220 Bytes	2023-3-2 19:30:04
AC	刘煜轩	14ms	520 KiB		239 Bytes	2023-5-13 17:29:19
AC	曹埊睿 (caodirui)	14ms	512 KiB		228 Bytes	2023-5-9 20:56:00
AC	scallway	14ms	7.1 MiB		228 Bytes	2023-10-15 15:10:17
AC	dustsans (njo)	14ms	384 KiB		230 Bytes	2022-9-9 20:40:43
AC	张梓辰 (DiaoDesi屌德斯)	14ms	392 KiB		252 Bytes	2022-9-7 19:18:21
AC	何昊宇 (22016-hhy)	14ms	392 KiB		268 Bytes	2022-9-18 9:47:46
AC	teacher_ren	14ms	384 KiB		268 Bytes	2022-5-29 18:35:07
AC	colin1112 (墙凌可)	14ms	384 KiB		300 Bytes	2023-3-21 18:49:39
AC	liuyuchen	14ms	7.1 MiB		222 Bytes	2023-10-15 15:11:47
AC	yanyuhan	14ms	384 KiB		284 Bytes	2023-5-28 15:25:46
AC	吴攸 (wuyou)	14ms	7.2 MiB		213 Bytes	2023-10-15 15:13:20
AC	何昊宇 (22016-hhy)	14ms	512 KiB		268 Bytes	2022-9-18 9:47:46
AC	李樊駁	14ms	7.2 MiB		221 Bytes	2023-10-15 15:13:41
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	436 KiB		239 Bytes	2022-9-10 21:50:13
AC	任希贤	14ms	392 KiB		221 Bytes	2023-5-13 15:01:56
AC	段淏泷	14ms	6.7 MiB	C++98	238 Bytes	2024-8-3 15:27:54
AC	SB (mfy01)	14ms	384 KiB		228 Bytes	2022-10-1 19:03:03
AC	煞笔笔	14ms	6.7 MiB		226 Bytes	2023-9-28 18:57:43