足球联赛积分

状态	递交者	时间	内存	语言	代码	递交时间
AC	黄彦熹 (AK-203)	6ms	256 KiB	C	117 Bytes	2023-3-5 18:53:50
AC	时代2校-程俊燃 (chengjunran)	11ms	7.2 MiB		120 Bytes	2023-12-28 20:36:02
AC	张瑞博	12ms	6.9 MiB	C++11	132 Bytes	2024-6-3 20:48:35
AC	(张洛诚)	12ms	7.3 MiB		132 Bytes	2024-1-6 19:52:50
AC	hxb	12ms	384 KiB		116 Bytes	2022-9-14 18:40:59
AC	zhm123	12ms	440 KiB		136 Bytes	2022-9-2 10:45:20
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	12ms	384 KiB		117 Bytes	2022-9-14 18:45:39
AC	潘佑实	13ms	396 KiB		140 Bytes	2023-2-26 17:21:59
AC	colin1112 (墙凌可)	13ms	384 KiB		117 Bytes	2022-9-16 19:00:29
AC	kql1	13ms	7.1 MiB	C++98	121 Bytes	2024-5-9 13:47:10
AC	霍弈丞小号	13ms	392 KiB		129 Bytes	2022-8-27 11:39:37
AC	wuqilin	13ms	384 KiB		162 Bytes	2022-9-14 18:42:13
AC	无尽的想象 (谭仕高)	13ms	384 KiB		137 Bytes	2023-2-22 16:14:25
AC	王昱祺 (12王昱祺)	13ms	384 KiB		172 Bytes	2023-3-5 18:44:14
AC	jinitaimei	13ms	436 KiB		106 Bytes	2022-9-15 19:50:29
AC	炸鱼4000+ (dxc)	13ms	7.4 MiB		114 Bytes	2023-6-10 17:18:46
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	13ms	6.6 MiB	C++98	144 Bytes	2024-7-29 16:29:56
AC	炸鱼4000+ (dxc)	13ms	7.4 MiB		114 Bytes	2023-6-10 17:18:46
AC	炸鱼4000+ (dxc)	13ms	7.4 MiB		114 Bytes	2023-6-10 17:18:44
AC	源著校区-宋昊成 (马冬梅)	14ms	432 KiB		129 Bytes	2023-3-5 18:41:33
AC	伍芷函	14ms	512 KiB		179 Bytes	2022-8-27 11:51:21
AC	胡熙景	14ms	384 KiB		130 Bytes	2022-9-10 13:25:57
AC	许炜铭 (xuweiming)	14ms	6.9 MiB		121 Bytes	2023-6-10 17:22:31
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:16
AC	龙湖源著校区-王子涵 (王子涵)	14ms	384 KiB		147 Bytes	2023-3-5 18:52:09
AC	赵浚言	14ms	392 KiB		124 Bytes	2023-2-3 18:05:03
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:13
AC	阮 (媚狐不吃道旁李)	14ms	432 KiB		156 Bytes	2023-3-5 16:27:47
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:16
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:14
AC	陈于硕(我™的) (chenyu)	14ms	6.9 MiB		131 Bytes	2023-6-10 17:24:48
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:15
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:16
AC	李廷旭 (litingxu)	14ms	6.8 MiB		158 Bytes	2023-9-10 17:32:38
AC	余彦瑞	14ms	384 KiB		128 Bytes	2022-8-27 11:42:41
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:16
AC	庹仕杰	14ms	7.1 MiB	C++98	153 Bytes	2024-4-23 18:45:35
AC	冉宸语	14ms	384 KiB		141 Bytes	2023-2-26 17:30:38
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:16
AC	时代一校-曾科智 (曾科智)	14ms	512 KiB		119 Bytes	2023-4-22 20:57:48
AC	不怎么聪明的家伙 (贺俊楠)	14ms	6.8 MiB		114 Bytes	2023-11-6 21:58:49
AC	不跟XXS(黄立信)一般见识 (吕同学)	14ms	512 KiB		112 Bytes	2022-9-9 22:11:57
AC	86想要钱 (twt)	14ms	420 KiB		132 Bytes	2022-9-4 17:01:12
AC	李晨希	14ms	6.9 MiB		144 Bytes	2023-6-10 17:33:08
AC	叶哲宇 (yzy)	14ms	6.7 MiB		117 Bytes	2023-9-3 17:37:49
AC	时代一校-赵彦博 (zyb)	14ms	500 KiB		152 Bytes	2022-9-16 18:35:52
AC	xuniaoyin (徐袅音)	14ms	6.7 MiB		108 Bytes	2023-8-31 11:19:38
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:15
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:15
AC	王胤钦 (wangyinqin)	14ms	424 KiB		118 Bytes	2022-9-10 10:59:39
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:09
AC	hyh	14ms	6.8 MiB		122 Bytes	2023-6-10 17:58:17
AC	曹烜豪	14ms	6.9 MiB		122 Bytes	2023-6-10 17:25:16
AC	新壹街校区-陈琬舒 (空空大师)	14ms	6.9 MiB		134 Bytes	2023-7-31 11:16:50
AC	xuaonan	14ms	512 KiB		130 Bytes	2022-10-4 16:22:10
AC	炸鱼4000+ (dxc)	14ms	7.4 MiB		114 Bytes	2023-6-10 17:18:46
AC	靳博然 (jbr)	15ms	428 KiB		162 Bytes	2023-2-26 17:18:27
AC	炸鱼4000+ (dxc)	15ms	7.4 MiB		114 Bytes	2023-6-10 17:18:46
AC	曹烜豪	15ms	6.9 MiB		122 Bytes	2023-6-10 17:25:15
AC	曹烜豪	15ms	6.9 MiB		122 Bytes	2023-6-10 17:25:15
AC	CK (李弘毅)	15ms	440 KiB		128 Bytes	2022-9-13 19:07:18
AC	王彬羽 (wby)	15ms	440 KiB		140 Bytes	2023-3-12 16:52:30
AC	希蒙 (zhengxingya)	15ms	6.8 MiB		124 Bytes	2023-10-11 17:31:24
AC	郭益豪（帅哥） (guoyihao)	15ms	452 KiB		141 Bytes	2023-2-3 18:18:57
AC	司雨来 (siyulai)	15ms	384 KiB		128 Bytes	2022-9-14 21:09:17
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	6.7 MiB		128 Bytes	2023-8-31 7:55:47
AC	炸鱼4000+ (dxc)	15ms	7.4 MiB		114 Bytes	2023-6-10 17:18:47
AC	时代一校-王宥量 (wangyouliang)	15ms	392 KiB		114 Bytes	2022-9-14 21:01:54
AC	黄梓轩 (huangzixuan)	15ms	440 KiB		130 Bytes	2022-9-16 18:55:43
AC	美术猫映画 (mkh)	15ms	7.4 MiB		108 Bytes	2023-6-10 17:39:57
AC	史韵哲	15ms	432 KiB		139 Bytes	2023-3-6 19:26:25
AC	zzzrrrxxx	15ms	6.8 MiB		106 Bytes	2023-9-10 17:32:59
AC	曹烜豪	15ms	6.9 MiB		122 Bytes	2023-6-10 17:25:16
AC	胡熙景	15ms	392 KiB		123 Bytes	2022-9-10 13:25:44
AC	时代二校-焦雨齐 (Angel)	15ms	6.9 MiB		132 Bytes	2023-7-16 8:24:44
AC	miku (阳沐珊)	15ms	6.9 MiB		129 Bytes	2023-8-20 16:15:43
AC	炸鱼4000+ (dxc)	15ms	7.4 MiB		114 Bytes	2023-6-10 17:18:46
AC	徐正旺 (xzw)	15ms	440 KiB		113 Bytes	2022-12-7 16:41:52
AC	胡宸华 (huchenhua)	15ms	6.9 MiB		121 Bytes	2023-8-9 22:40:32
AC	廖永亨	15ms	512 KiB		128 Bytes	2022-12-8 17:29:35
AC	我是曾科智儿子 (沈小童)	16ms	512 KiB		119 Bytes	2023-3-7 20:29:24
AC	陈泰羽 (chentaiyu)	16ms	512 KiB		122 Bytes	2023-3-15 19:38:22
AC	胡熙景	16ms	512 KiB		123 Bytes	2022-9-10 13:25:42
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	7 MiB		127 Bytes	2023-12-24 11:35:26
AC	爱琴海校区-黄辰浩 (huangchenhao)	16ms	512 KiB		119 Bytes	2023-3-15 20:07:11
AC	新壹街校区-杨轩懿 (杨轩懿1)	16ms	7 MiB		116 Bytes	2023-7-21 11:56:22
AC	zhangzhimo	16ms	444 KiB		120 Bytes	2022-9-8 22:27:10
AC	xuniaoyin (徐袅音)	16ms	6.9 MiB		131 Bytes	2023-8-4 12:14:55
AC	肖钦文 (xiaoqinwen)	16ms	392 KiB		240 Bytes	2022-8-27 11:48:43
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)	17ms	6.8 MiB		128 Bytes	2023-6-11 10:37:55
AC	没有此人 (akm)	18ms	440 KiB		134 Bytes	2023-3-14 21:49:25
AC	爱情海校区—沙天一 (沙天一)	18ms	7 MiB		110 Bytes	2023-12-30 9:22:20
AC	AI创客	18ms	7.3 MiB		114 Bytes	2023-12-30 11:31:51
AC	章愉霖	20ms	7 MiB		120 Bytes	2023-11-11 13:18:19
AC	史韵哲	20ms	432 KiB		139 Bytes	2023-3-17 21:13:33
AC	章愉霖	24ms	7 MiB		120 Bytes	2023-11-11 13:18:35
AC	时代一校蒋帛希 (13983392730)	25ms	384 KiB		136 Bytes	2022-9-14 18:46:12
AC	https://www.crazygames.com/game/merge-construct (陈诺)	60ms	532 KiB		120 Bytes	2024-2-6 14:01:52
AC	孙烽轶 (sfy)	68ms	764 KiB		109 Bytes	2024-2-19 20:01:16
AC	Guest	68ms	536 KiB		120 Bytes	2024-3-9 16:04:17