成绩判定

状态	递交者	时间	内存	语言	代码	递交时间
AC	强愉堃 (强愉堃1)	7ms	392 KiB		229 Bytes	2023-3-11 20:22:01
AC	强愉堃 (强愉堃1)	7ms	384 KiB		229 Bytes	2023-3-11 20:22:00
AC	第五人格启动 (罗子键)	7ms	384 KiB		249 Bytes	2023-3-11 20:18:50
AC	zzzhhhooonnnggg	7ms	512 KiB		297 Bytes	2023-3-19 18:35:04
AC	黄梓桐 (HuangZiTong)	7ms	392 KiB		205 Bytes	2022-10-1 10:57:19
AC	第五人格启动 (罗子键)	7ms	384 KiB		249 Bytes	2023-3-11 20:18:48
AC	王瀚毅 (wanghanyi)	7ms	432 KiB		285 Bytes	2022-10-22 20:46:23
AC	南坪校区-郑力博 (zhenglibo23003)	7ms	440 KiB		252 Bytes	2023-2-18 17:13:47
AC	乐瀚阳 (yuehanyang)	7ms	512 KiB		270 Bytes	2023-3-18 15:35:11
AC	hyh	7ms	384 KiB		295 Bytes	2023-3-18 11:40:50
AC	第五人格启动 (罗子键)	7ms	412 KiB		249 Bytes	2023-3-11 20:18:49
AC	葛琮扬	7ms	7.1 MiB		289 Bytes	2023-7-20 12:08:29
AC	赵彬鸿	7ms	384 KiB		237 Bytes	2022-8-12 15:36:22
AC	zhuziyu	7ms	432 KiB		335 Bytes	2022-2-26 9:47:56
AC	钟元朗	7ms	440 KiB		255 Bytes	2022-9-10 10:05:48
AC	刘致言	7ms	512 KiB		254 Bytes	2023-3-11 9:20:34
AC	刘思齐	7ms	6.9 MiB	C++98	284 Bytes	2024-6-26 17:15:10
AC	六 (江智昕)	7ms	384 KiB		322 Bytes	2022-12-29 18:12:37
AC	韩思辰 (hansichen)	7ms	440 KiB		291 Bytes	2022-11-17 17:47:48
AC	吴卓轩	7ms	452 KiB		315 Bytes	2022-10-1 15:08:14
AC	明哲瀚 (18580067605)	7ms	384 KiB		323 Bytes	2022-9-28 21:22:23
AC	肖添宇	7ms	420 KiB		250 Bytes	2022-8-28 15:08:55
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	7ms	7 MiB		267 Bytes	2023-12-16 10:26:50
AC	苏庭毅	7ms	392 KiB		283 Bytes	2023-3-11 20:17:51
AC	RanHao	7ms	6.9 MiB		321 Bytes	2023-7-20 16:59:13
AC	肖艺勋	7ms	6.8 MiB		351 Bytes	2023-10-27 17:42:04
AC	江坤锜	7ms	396 KiB		325 Bytes	2023-3-11 20:13:32
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)	7ms	440 KiB		406 Bytes	2022-9-24 15:39:20
AC	源著校区-宋昊成 (马冬梅)	7ms	428 KiB		329 Bytes	2023-2-25 17:16:36
AC	xiongxinyao	7ms	384 KiB		344 Bytes	2023-4-6 18:55:08
AC	甄一阳 (22016-zyy)	7ms	512 KiB		317 Bytes	2022-10-30 11:16:51
AC	wuzhenghan	7ms	520 KiB		242 Bytes	2022-11-1 18:45:20
AC	zhuqiwei22006	7ms	392 KiB		223 Bytes	2022-10-20 20:55:23
AC	言年想摆烂~	7ms	6.9 MiB		278 Bytes	2023-6-10 20:34:42
AC	奇怪的正义人！ (leweiqi)	7ms	432 KiB		253 Bytes	2022-10-26 19:50:28
AC	新壹街陈科言 (cky)	7ms	6.9 MiB		273 Bytes	2023-7-19 11:19:24
AC	一片落叶 (yeyuhao)	7ms	6.7 MiB		314 Bytes	2023-8-24 15:01:45
AC	第五人格启动 (罗子键)	8ms	384 KiB		249 Bytes	2023-3-11 20:18:47
AC	明轩 (吕同学)	8ms	520 KiB		307 Bytes	2022-8-27 13:26:52
AC	德克萨斯做的到吗 (liyangbao)	8ms	436 KiB		333 Bytes	2022-10-29 11:53:45
AC	希蒙 (zhengxingya)	8ms	6.9 MiB		314 Bytes	2023-8-14 15:11:18
AC	余晨浩 (yuchenhao)	8ms	6.7 MiB		249 Bytes	2023-8-31 14:47:19
AC	支彦淇	8ms	440 KiB		255 Bytes	2022-10-5 15:12:37
AC	UsMt1 (jiangyuan)	8ms	6.9 MiB		269 Bytes	2023-7-23 15:45:54
AC	新壹街朱启航 (zhuqihang)	8ms	7.4 MiB		239 Bytes	2023-7-11 9:40:59
AC	11451254188 (22029-mjh)	8ms	512 KiB		329 Bytes	2022-11-12 10:57:00
AC	郑尧 (zhengyao)	8ms	6.7 MiB		222 Bytes	2023-8-26 18:54:12
AC	leisixian (22029-lyh)	8ms	384 KiB		329 Bytes	2022-10-1 10:06:39
AC	AAA家电维修李师傅 (libo)	8ms	7.3 MiB	C++11	456 Bytes	2024-4-21 15:30:18
AC	苏庭毅	8ms	384 KiB		283 Bytes	2023-3-11 20:17:52
AC	tyx_9192596	8ms	440 KiB		240 Bytes	2023-3-18 14:39:21
AC	liusitong	8ms	384 KiB		218 Bytes	2022-12-25 14:40:50
AC	龙思颖 (lsy)	8ms	492 KiB		384 Bytes	2023-3-6 20:12:09
AC	余晨浩 (yuchenhao)	8ms	7 MiB		249 Bytes	2023-8-31 14:51:51
AC	zyp (wangjunling23010)	8ms	384 KiB		345 Bytes	2023-3-24 20:21:07
AC	六 (江智昕)	8ms	384 KiB		322 Bytes	2022-12-29 18:12:42
AC	何星震 (Jacob)	8ms	436 KiB		254 Bytes	2022-10-7 9:35:54
AC	苏庭毅	8ms	384 KiB		283 Bytes	2023-3-11 20:17:54
AC	六 (江智昕)	8ms	384 KiB		322 Bytes	2022-12-29 18:12:39
AC	余晨浩 (yuchenhao)	8ms	6.7 MiB		249 Bytes	2023-8-31 14:47:49
AC	孙烽轶 (sfy)	8ms	6.9 MiB		216 Bytes	2023-8-7 13:03:31
AC	hzm	8ms	384 KiB		238 Bytes	2022-10-1 9:21:11
AC	六 (江智昕)	8ms	392 KiB		322 Bytes	2022-12-29 18:12:40
AC	第五人格启动 (罗子键)	8ms	384 KiB		249 Bytes	2023-3-11 20:18:47
AC	ganlin1	8ms	6.9 MiB		255 Bytes	2023-7-12 13:55:38
AC	余晨浩 (yuchenhao)	8ms	6.9 MiB		249 Bytes	2023-8-31 14:56:50
AC	李睿杰	8ms	440 KiB		258 Bytes	2023-1-4 11:20:32
AC	huanglu	8ms	6.7 MiB		321 Bytes	2023-6-4 19:19:38
AC	SB (mfy01)	8ms	436 KiB		271 Bytes	2022-12-2 13:37:00
AC	田雨杨 (tianyuyang23010)	8ms	7.2 MiB	C++98	363 Bytes	2024-5-10 20:38:44
AC	新壹街-王俊博 (王俊博)	8ms	7.4 MiB		216 Bytes	2023-7-10 9:50:22
AC	sb (吴振宇)	8ms	440 KiB		286 Bytes	2023-1-6 21:23:12
AC	10255	8ms	392 KiB		221 Bytes	2022-12-25 14:43:38
AC	第五人格启动 (罗子键)	8ms	384 KiB		249 Bytes	2023-3-11 20:18:48
AC	时代二校-陈天成 (鸭缩毛巾)	8ms	444 KiB		222 Bytes	2023-3-11 16:21:15
AC	余晨浩 (yuchenhao)	8ms	6.7 MiB		249 Bytes	2023-8-31 14:49:22
AC	pandap&a王皓宸 (WANGHAOCHEN)	8ms	512 KiB		264 Bytes	2022-11-5 11:19:47
AC	蒲梓勋 (puzixun)	8ms	444 KiB		255 Bytes	2022-10-4 23:28:21
AC	余晨浩 (yuchenhao)	8ms	6.7 MiB		249 Bytes	2023-8-31 14:56:30
AC	强愉堃 (强愉堃1)	8ms	384 KiB		229 Bytes	2023-3-11 20:22:00
AC	金沙校区-先珂熠 (九转大肠)	8ms	7.1 MiB		256 Bytes	2024-1-1 18:50:50
AC	月下的九尾银狐	8ms	6.8 MiB		278 Bytes	2023-6-11 19:53:09
AC	xzf	8ms	6.8 MiB		295 Bytes	2023-6-23 16:14:32
AC	邵冠铖 (shaoguancheng22031)	8ms	440 KiB		241 Bytes	2022-10-6 10:59:47
AC	李禹衡 (liyuheng22006)	8ms	384 KiB		254 Bytes	2022-10-18 20:40:43
AC	第五人格启动 (罗子键)	8ms	384 KiB		249 Bytes	2023-3-11 20:18:50
AC	jiangjc	8ms	6.8 MiB		252 Bytes	2023-6-11 16:15:06
AC	苏庭毅	8ms	384 KiB		283 Bytes	2023-3-11 20:17:50
AC	xieyubei	8ms	512 KiB		275 Bytes	2022-10-15 12:09:09
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	8ms	540 KiB		298 Bytes	2022-10-2 11:31:17
AC	赵锦昊	8ms	436 KiB		247 Bytes	2023-3-25 14:22:55
AC	wzzjnb2012	8ms	432 KiB		232 Bytes	2022-9-26 11:33:55
AC	苏庭毅	8ms	384 KiB		283 Bytes	2023-3-11 20:17:53
AC	第五人格启动 (罗子键)	8ms	392 KiB		249 Bytes	2023-3-11 20:18:49
AC	maobohan	8ms	436 KiB		302 Bytes	2023-3-11 10:37:56
AC	22029-zjs	8ms	7.1 MiB		301 Bytes	2024-1-23 9:06:56
AC	苏庭毅	8ms	392 KiB		283 Bytes	2023-3-11 20:17:51
AC	新壹街罗田雨 (罗田雨29)	8ms	6.9 MiB		280 Bytes	2023-11-28 23:22:41
AC	马某克	8ms	420 KiB		280 Bytes	2022-12-18 10:54:28
AC	李山水	8ms	436 KiB		301 Bytes	2022-8-28 18:55:00