奥运奖牌计数

状态	递交者	时间	内存	语言	代码	递交时间
AC	王韵淮	14ms	452 KiB		452 Bytes	2022-7-15 21:23:49
AC	朱泽晟	14ms	512 KiB		263 Bytes	2022-2-13 20:52:24
AC	Zongzi1	14ms	6.6 MiB	C++17(O2)	426 Bytes	2024-7-18 10:03:15
AC	姚宏逸	14ms	436 KiB		394 Bytes	2022-2-5 23:37:57
AC	新壹街校区-周士杰 (zsj)	14ms	432 KiB		224 Bytes	2023-3-3 19:54:53
AC	陈海骞 (chq)	14ms	512 KiB		248 Bytes	2022-3-12 20:46:25
AC	21035-wyf	14ms	440 KiB		239 Bytes	2022-3-8 20:57:20
AC	胡瀚文	14ms	512 KiB		301 Bytes	2022-7-18 11:24:38
AC	叶雨昊 (yeyuhao22006)	14ms	504 KiB		212 Bytes	2022-10-23 20:05:35
AC	偽艺術家 (chenyanchi22006)	14ms	452 KiB		249 Bytes	2022-8-15 23:36:17
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	512 KiB		271 Bytes	2023-5-16 19:38:11
AC	Accepted (周芷乐)	14ms	7.4 MiB	C++98	301 Bytes	2024-4-21 18:43:36
AC	chen (peter)	14ms	512 KiB		279 Bytes	2023-2-25 18:58:35
AC	谭懿轩 (yanyixuan)	14ms	436 KiB		231 Bytes	2022-2-15 20:08:20
AC	wangruibo20xh	14ms	436 KiB		246 Bytes	2022-2-11 14:23:37
AC	ganlin1	15ms	6.9 MiB		261 Bytes	2023-7-27 9:51:21
AC	疯神芭芭脱丝 (李卓修)	15ms	428 KiB		264 Bytes	2022-7-16 13:42:29
AC	yanglang	15ms	512 KiB		235 Bytes	2022-10-23 10:42:23
AC	姚宏逸	15ms	440 KiB		394 Bytes	2022-3-3 19:25:09
AC	樊竣熠 (lft1114)	15ms	432 KiB		305 Bytes	2022-8-15 12:06:53
AC	谭懿轩 (yanyixuan)	15ms	512 KiB		230 Bytes	2022-3-17 18:16:45
AC	zry	15ms	512 KiB		305 Bytes	2022-3-12 11:24:12
AC	廖永亨	15ms	428 KiB		342 Bytes	2022-11-24 18:35:31
AC	周琪渃	15ms	6.7 MiB		277 Bytes	2023-9-8 21:13:01
AC	许梓宸 (xuzichen)	15ms	6.7 MiB	C++17(O2)	416 Bytes	2024-7-17 16:14:45
AC	杨皓宇 (yanghaoyu)	15ms	6.8 MiB		395 Bytes	2023-10-21 8:49:46
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	444 KiB		465 Bytes	2022-9-27 19:49:32
AC	wuqi	15ms	6.9 MiB		237 Bytes	2023-7-27 15:47:51
AC	小忙果 (王昱杰)	15ms	6.9 MiB		280 Bytes	2023-7-18 8:43:14
AC	明轩 (吕同学)	15ms	7.2 MiB		275 Bytes	2024-1-22 14:11:15
AC	新壹街陈科言 (cky)	15ms	7 MiB		536 Bytes	2023-7-20 14:23:51
AC	陌生人 (涂玉龙)	15ms	7.1 MiB		253 Bytes	2024-1-21 14:25:49
AC	马渝杭 (mayuhang)	16ms	440 KiB		333 Bytes	2023-3-21 19:12:12
AC	colin1112 (墙凌可)	16ms	448 KiB		244 Bytes	2023-3-11 15:05:28
AC	huanglu	16ms	440 KiB		356 Bytes	2022-10-12 13:53:10
AC	时代一校-赵彦博 (zyb)	16ms	7.2 MiB		224 Bytes	2023-11-30 18:54:05
AC	黄立信	16ms	512 KiB		231 Bytes	2022-12-3 12:06:54
AC	伍芷函	16ms	436 KiB		308 Bytes	2022-8-26 18:40:00
AC	蒲梓勋 (puzixun)	16ms	6.9 MiB		336 Bytes	2023-6-9 19:43:38
AC	Nico	16ms	6.8 MiB		244 Bytes	2023-6-22 11:01:30
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	16ms	432 KiB		327 Bytes	2022-9-15 18:30:12
AC	刘致言	16ms	436 KiB		235 Bytes	2023-3-11 9:32:01
AC	RanHao	17ms	6.9 MiB		365 Bytes	2023-7-23 10:30:48
AC	杨坤霖 (steven)	17ms	512 KiB		279 Bytes	2023-1-14 10:18:52
AC	Randy Marsh (杨子腾)	17ms	444 KiB		319 Bytes	2023-1-12 13:53:31
AC	新壹街校区-陈琬舒 (空空大师)	17ms	6.9 MiB		339 Bytes	2023-7-19 19:16:51
AC	胡澜之 (666hlz666)	17ms	6.9 MiB		316 Bytes	2023-7-9 10:23:16
AC	谭红中 (不知道)	17ms	512 KiB		246 Bytes	2023-1-14 12:05:14
AC	马渝杭 (mayuhang)	18ms	512 KiB		430 Bytes	2022-10-9 20:07:55
AC	时代一校-王宥量 (wangyouliang)	18ms	436 KiB		253 Bytes	2022-11-24 13:40:30
AC	丛林 (conglin)	19ms	512 KiB		223 Bytes	2022-12-2 21:15:00
AC	huanglu	19ms	512 KiB		278 Bytes	2022-10-12 13:51:01
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	30ms	420 KiB		418 Bytes	2023-5-31 22:07:47
AC	zyl	30ms	7.3 MiB		270 Bytes	2024-1-4 10:30:46
AC	杨瀚霖 (yanghanlin)	61ms	15 MiB		370 Bytes	2023-6-24 9:50:33
AC	dyp (hhy)	62ms	544 KiB		655 Bytes	2024-1-28 11:39:43
AC	My name is Man (钟卓劭)	64ms	764 KiB		310 Bytes	2024-3-13 20:38:12
AC	jdy	67ms	768 KiB		252 Bytes	2024-3-14 17:17:50
AC	Him神	68ms	764 KiB		225 Bytes	2024-2-29 15:30:17
AC	时代2校-程俊燃 (chengjunran)	68ms	764 KiB		239 Bytes	2024-1-30 11:44:15
AC	王康瑞	69ms	764 KiB		256 Bytes	2024-3-2 10:05:38
AC	赵奕铭	70ms	552 KiB		296 Bytes	2024-3-7 18:24:12
AC	wrz	71ms	540 KiB		246 Bytes	2024-3-8 15:34:04
AC	杨博文05	71ms	532 KiB	C++98	235 Bytes	2024-9-1 12:58:03
AC	wushengyue	71ms	540 KiB	C++17	228 Bytes	2024-9-1 11:23:12
AC	fcxin	125ms	9.4 MiB	Python 3	275 Bytes	2024-8-9 10:53:25
AC	Greta	126ms	9.3 MiB	Python 3	172 Bytes	2024-7-12 11:23:17
AC	可爱酱 (张可忻)	186ms	9 MiB	Python 2	139 Bytes	2023-9-21 18:06:28
AC	安闵煜 (anzai)	190ms	9 MiB	Python 3	165 Bytes	2023-11-8 9:36:31
AC	猫不理包子	191ms	9.1 MiB	Python 3	188 Bytes	2023-6-23 17:35:02
AC	19598	191ms	9 MiB	Python 3	144 Bytes	2023-8-13 10:39:20
AC	高俊	195ms	9.1 MiB	Python 3	182 Bytes	2023-10-18 13:29:15
AC	许炜铭 (xuweiming)	197ms	9 MiB	Python 3	206 Bytes	2023-7-13 19:16:02
AC	梨冻亿 (wiueh)	203ms	3.9 MiB	Python 3	184 Bytes	2022-1-23 18:01:28
AC	kongql	203ms	4.1 MiB	Python 3	371 Bytes	2022-7-21 11:44:06
AC	Wling	205ms	3.9 MiB	Python 3	194 Bytes	2022-11-1 14:59:58
AC	苗润昊	208ms	3.9 MiB	Python 3	167 Bytes	2022-2-12 15:32:18
AC	范老师	219ms	4 MiB	Python 3	162 Bytes	2022-12-13 15:40:22
AC	AC[谭赫奕] (tanheyi)	220ms	3.9 MiB	Python 3	262 Bytes	2023-5-9 20:33:48
AC	稻妻第一深情 (喝酒の吟游诗人)	225ms	4 MiB	Python 3	200 Bytes	2023-1-14 14:00:25
AC	cola	236ms	4 MiB	Python 3	161 Bytes	2022-12-16 16:06:41
AC	Qinxiu	541ms	3.8 MiB	Python 3	377 Bytes	2024-1-31 15:58:58
AC	Qinxiu	542ms	3.8 MiB	Python 3	264 Bytes	2024-1-31 16:00:50