判断成绩

状态	递交者	时间	内存	语言	代码	递交时间
AC	lch (凌昌瀚)	3ms	384 KiB		227 Bytes	2022-8-1 13:43:28
AC	李玥漪	3ms	384 KiB		282 Bytes	2022-3-6 11:13:08
AC	李奕霖 (liyilin233)	3ms	392 KiB		229 Bytes	2022-5-14 18:52:46
AC	罗元邑	3ms	384 KiB		301 Bytes	2023-3-4 9:35:06
AC	神印王座	3ms	384 KiB		385 Bytes	2022-9-24 14:46:27
AC	WangXi	3ms	384 KiB		241 Bytes	2022-9-17 19:11:22
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:14
AC	Steven (王梓丞)	4ms	384 KiB		284 Bytes	2022-4-16 14:53:59
AC	18523558128zcn	4ms	384 KiB		251 Bytes	2022-4-9 15:43:54
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:14
AC	胡程禹	4ms	384 KiB		272 Bytes	2023-2-11 20:34:09
AC	草\|\|草 (陈星佑)	4ms	392 KiB		220 Bytes	2022-5-14 9:13:58
AC	dinghaoyan1	4ms	384 KiB		287 Bytes	2022-9-19 21:03:19
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	4ms	384 KiB		380 Bytes	2022-4-16 14:15:25
AC	陈杰晟	4ms	384 KiB		238 Bytes	2022-5-28 10:17:07
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	4ms	384 KiB		237 Bytes	2022-10-16 9:58:50
AC	LukeDid	4ms	408 KiB		257 Bytes	2023-4-22 13:39:49
AC	肖添宇	4ms	384 KiB		253 Bytes	2022-4-30 20:25:39
AC	曹元明	4ms	384 KiB		213 Bytes	2022-5-14 9:10:35
AC	shaoguancheng	4ms	412 KiB		211 Bytes	2022-5-29 17:15:18
AC	草\|\|草 (陈星佑)	4ms	392 KiB		220 Bytes	2022-5-14 9:13:57
AC	杨睎尧	4ms	384 KiB		242 Bytes	2022-4-9 11:44:43
AC	soha (武夷岩)	4ms	384 KiB		271 Bytes	2022-9-3 13:34:59
AC	肖添宇	4ms	384 KiB		241 Bytes	2022-4-30 20:25:28
AC	gzc	4ms	7 MiB	C++11	228 Bytes	2024-5-10 19:52:10
AC	yanxiaosong	4ms	384 KiB		243 Bytes	2022-4-4 21:19:01
AC	余彦瑞	4ms	384 KiB		235 Bytes	2022-3-6 11:00:16
AC	草\|\|草 (陈星佑)	4ms	384 KiB		220 Bytes	2022-5-14 9:13:59
AC	胡澜之 (666hlz666)	4ms	6.9 MiB	C++11	258 Bytes	2024-7-2 17:10:48
AC	yiqiuyu	4ms	384 KiB		215 Bytes	2023-2-25 17:33:48
AC	方子谦 (方子谦00)	4ms	384 KiB		285 Bytes	2022-3-6 12:18:27
AC	南坪校区-郑力博 (zhenglibo23003)	4ms	384 KiB		204 Bytes	2023-2-25 17:28:36
AC	爱琴海校区jzn (jzn)	4ms	384 KiB		197 Bytes	2023-4-3 22:03:44
AC	连弘锐	4ms	392 KiB		248 Bytes	2022-6-26 21:33:57
AC	luoluonuoya	4ms	408 KiB		343 Bytes	2022-5-8 14:36:39
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:11
AC	庹仕杰	4ms	6.7 MiB		243 Bytes	2023-10-1 10:50:05
AC	chenxiaozhun	4ms	384 KiB		233 Bytes	2023-4-8 16:22:01
AC	kkksc03 (彭士锋)	4ms	384 KiB		232 Bytes	2022-4-9 14:25:42
AC	黄梓轩 (huangzixuan)	4ms	384 KiB		263 Bytes	2022-7-1 21:49:58
AC	苏庭毅	4ms	384 KiB		256 Bytes	2023-2-11 20:01:16
AC	傅博涛	4ms	384 KiB		235 Bytes	2022-5-8 8:12:33
AC	炸鱼4000+ (dxc)	4ms	512 KiB		274 Bytes	2023-2-11 19:56:55
AC	曹烜豪	4ms	384 KiB		237 Bytes	2023-2-11 20:12:42
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:14
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:11
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	4ms	404 KiB		237 Bytes	2022-10-16 9:58:50
AC	colin1112 (墙凌可)	4ms	6.7 MiB		297 Bytes	2023-9-1 16:53:50
AC	偽艺術家 (chenyanchi22006)	4ms	384 KiB		222 Bytes	2022-6-23 22:10:47
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:13
AC	wangyueru	4ms	392 KiB		228 Bytes	2022-9-17 19:14:04
AC	icwy (zuolun)	4ms	440 KiB		243 Bytes	2022-4-16 13:48:02
AC	中岛敦 (黄麒瑞)	4ms	6.7 MiB		282 Bytes	2023-10-1 10:13:52
AC	朱老师 (zyp)	4ms	384 KiB		236 Bytes	2022-10-20 19:52:52
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:12
AC	huyinuo	4ms	432 KiB		270 Bytes	2022-4-23 15:30:47
AC	朱泽晟	4ms	384 KiB		213 Bytes	2022-8-14 19:16:29
AC	王星皓	4ms	400 KiB		245 Bytes	2022-3-6 11:45:51
AC	zhr	4ms	512 KiB		262 Bytes	2023-4-14 23:50:14
AC	高致远 (GZY)	4ms	384 KiB		252 Bytes	2023-2-12 20:36:09
AC	没有此人 (akm)	4ms	384 KiB		272 Bytes	2022-9-24 17:39:06
AC	陈家齐 (陈家齐1)	4ms	392 KiB		276 Bytes	2023-2-11 20:07:57
AC	时代一校蒋帛希 (13983392730)	4ms	384 KiB		229 Bytes	2022-8-20 11:33:11
AC	陈骏逸 (chenjunyi)	4ms	440 KiB		224 Bytes	2022-7-15 20:02:03
AC	赵泳鑫 (zhaoyongxin)	4ms	384 KiB		261 Bytes	2022-4-7 19:12:32
AC	霍弈丞	4ms	384 KiB		306 Bytes	2022-3-6 11:19:38
AC	我全家SB！！！我没母！！！ (baijinlin)	4ms	384 KiB		218 Bytes	2023-2-25 17:29:11
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:14
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:14
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	4ms	392 KiB		202 Bytes	2022-9-24 22:56:40
AC	¿¿¿??? (李睿瞳)	4ms	7.1 MiB		437 Bytes	2024-1-21 15:42:39
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:11
AC	enen	4ms	384 KiB		246 Bytes	2023-4-14 14:58:36
AC	刘沄熙	4ms	384 KiB		278 Bytes	2022-3-6 10:50:33
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:14
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	4ms	384 KiB		237 Bytes	2022-10-16 9:58:51
AC	呵呵呵 (陈思琦)	4ms	384 KiB		211 Bytes	2022-7-2 17:29:27
AC	时代一校 - 冯隆浩 (冯隆浩)	4ms	440 KiB		226 Bytes	2022-7-26 8:34:28
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	416 KiB		267 Bytes	2022-6-24 20:02:13
AC	黄相茗	4ms	412 KiB		261 Bytes	2022-4-7 19:08:49
AC	李彦臻	4ms	6.9 MiB		231 Bytes	2023-7-27 19:52:20
AC	0721 (龙浩恩)	4ms	6.8 MiB		233 Bytes	2023-11-3 23:17:36
AC	李山水	4ms	392 KiB		292 Bytes	2022-5-2 11:52:48
AC	李树崑 (lishukun)	4ms	440 KiB		253 Bytes	2022-4-19 18:40:21
AC	yu (赵子瑜)	4ms	440 KiB		249 Bytes	2022-6-19 11:42:22
AC	liangyuntian23003	4ms	384 KiB		267 Bytes	2023-2-25 17:54:08
AC	LUKHE (LukeHu)	4ms	392 KiB		306 Bytes	2022-4-16 17:07:57
AC	Randy Marsh (杨子腾)	4ms	440 KiB		262 Bytes	2022-5-26 19:02:14
AC	11111	4ms	412 KiB		222 Bytes	2022-3-20 9:17:17
AC	刘锦航	4ms	384 KiB		237 Bytes	2022-8-26 20:39:24
AC	刘泽21	4ms	440 KiB		301 Bytes	2023-4-14 13:03:47
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)	4ms	384 KiB		242 Bytes	2023-5-20 11:44:26
AC	德意志第三帝国 (陈远桥)	4ms	384 KiB		254 Bytes	2022-5-19 20:07:43
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:11
AC	经常消失 (小萝卜)	4ms	428 KiB		244 Bytes	2022-7-10 17:30:27
AC	zhangxiushi	4ms	416 KiB		311 Bytes	2022-8-26 20:53:41
AC	杜俊宏	4ms	440 KiB		257 Bytes	2022-6-9 19:14:33
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		267 Bytes	2022-6-24 20:02:11
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	4ms	384 KiB		237 Bytes	2022-10-16 9:58:56
AC	郑岐蔚	4ms	436 KiB		273 Bytes	2022-9-19 19:43:37