「NOIP 2010 普及组」数字统计

状态	递交者	时间	内存	语言	代码	递交时间
AC	殷语函	17ms	6.9 MiB	C++11	304 Bytes	2024-8-23 21:53:19
AC	蒲梓勋 (puzixun)	17ms	512 KiB		387 Bytes	2022-6-23 22:09:00
AC	弹射起飞 ? 冲 ! (吴周周)	17ms	384 KiB		300 Bytes	2023-4-8 17:30:08
AC	朱老师 (zyp)	17ms	6.8 MiB	C++11	280 Bytes	2024-6-26 15:23:10
AC	弹射起飞 ? 冲 ! (吴周周)	17ms	392 KiB		300 Bytes	2023-4-8 17:30:09
AC	yyds (杨骐嘉)	17ms	6.9 MiB	C++98	255 Bytes	2024-5-24 17:38:51
AC	弹射起飞 ? 冲 ! (吴周周)	17ms	388 KiB		300 Bytes	2023-4-8 17:30:07
AC	谢延灏 (xeiyanhao---a handsome boy)	18ms	424 KiB		294 Bytes	2022-5-15 12:39:32
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	392 KiB		300 Bytes	2023-4-8 17:30:06
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:10
AC	陈雨泽1	18ms	440 KiB		273 Bytes	2023-2-18 11:25:49
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:08
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:07
AC	yixingyou	18ms	444 KiB		236 Bytes	2022-10-1 15:15:08
AC	时代二校-陈天成 (鸭缩毛巾)	18ms	396 KiB		238 Bytes	2023-4-8 17:28:19
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	392 KiB		300 Bytes	2023-4-8 17:30:11
AC	呵呵呵 (陈思琦)	18ms	384 KiB		218 Bytes	2022-10-1 8:44:10
AC	周琪渃	18ms	392 KiB		365 Bytes	2022-11-13 15:58:56
AC	中岛敦 (黄麒瑞)	18ms	6.8 MiB		242 Bytes	2023-10-3 11:27:08
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:07
AC	miku (阳沐珊)	18ms	6.9 MiB		255 Bytes	2023-8-20 16:13:41
AC	杨浩灵 (金坷拉)	18ms	436 KiB		260 Bytes	2022-10-1 15:21:26
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:07
AC	kcs007	18ms	444 KiB		225 Bytes	2023-4-8 15:11:29
AC	胡程禹	18ms	6.9 MiB	C++98	254 Bytes	2024-8-23 18:45:20
AC	时代2校-程俊燃 (chengjunran)	18ms	392 KiB		259 Bytes	2023-4-8 17:27:32
AC	时代2校+施皓宬 (shihaocheng)	18ms	436 KiB		214 Bytes	2023-4-8 17:37:18
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:10
AC	soha (武夷岩)	18ms	396 KiB		324 Bytes	2022-10-1 15:16:37
AC	呵呵呵 (陈思琦)	18ms	384 KiB		218 Bytes	2022-10-1 8:44:12
AC	童艺涵	18ms	432 KiB		205 Bytes	2023-4-8 15:14:30
AC	周浩楠 (开朗的周好难)	18ms	6.7 MiB		264 Bytes	2023-8-30 15:46:59
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:27:44
AC	刘致言	18ms	384 KiB		222 Bytes	2023-3-11 9:35:20
AC	hyh22031	18ms	392 KiB		316 Bytes	2022-11-27 12:29:37
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	392 KiB		300 Bytes	2023-4-8 17:30:11
AC	zzl	18ms	512 KiB		232 Bytes	2023-5-25 11:28:37
AC	向俊熙 (xiangjunxi23003)	18ms	384 KiB		218 Bytes	2023-4-1 17:36:12
AC	时代二校-焦雨齐 (Angel)	18ms	384 KiB		230 Bytes	2023-4-8 17:25:02
AC	zhanglianjie	18ms	400 KiB		246 Bytes	2023-4-1 17:36:19
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	412 KiB		300 Bytes	2023-4-8 17:30:06
AC	scallway	18ms	392 KiB		329 Bytes	2022-10-1 13:52:42
AC	源著校区-宋昊成 (马冬梅)	18ms	440 KiB		304 Bytes	2023-2-25 18:29:00
AC	朱老师 (zyp)	18ms	448 KiB		228 Bytes	2022-7-26 9:51:13
AC	冒牌陈杰晟【MOD】 (wed)	18ms	436 KiB		210 Bytes	2022-3-6 18:16:13
AC	黄梓桐 (HuangZiTong)	18ms	512 KiB		261 Bytes	2022-8-3 16:50:10
AC	zhoumingze23017	18ms	7 MiB		257 Bytes	2023-8-31 14:53:49
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:08
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:10
AC	偽艺術家 (chenyanchi22006)	18ms	512 KiB		207 Bytes	2022-6-25 7:59:58
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	392 KiB		300 Bytes	2023-4-8 17:30:08
AC	灵光sans (wangchihao)	18ms	384 KiB		250 Bytes	2022-10-1 15:17:52
AC	詹宇航 (zyh7)	18ms	520 KiB		201 Bytes	2022-7-8 18:11:26
AC	时代二校+王吕棪 (wanglvyan)	18ms	412 KiB		216 Bytes	2023-4-8 17:26:14
AC	wangyueru	18ms	432 KiB		227 Bytes	2022-11-12 20:51:03
AC	谭懿轩 (yanyixuan)	18ms	436 KiB		205 Bytes	2022-2-26 15:33:03
AC	老六在此	18ms	7 MiB	C++20	365 Bytes	2024-8-23 17:48:23
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	392 KiB		300 Bytes	2023-4-8 17:30:08
AC	弹射起飞 ? 冲 ! (吴周周)	18ms	384 KiB		300 Bytes	2023-4-8 17:30:10
AC	贾鑫豪 (Mr Sam)	18ms	520 KiB		397 Bytes	2022-11-19 14:23:11
AC	时代一校-赵彦博 (zyb)	18ms	6.9 MiB		306 Bytes	2023-8-5 13:49:09
AC	朱老师 (zyp)	18ms	504 KiB		241 Bytes	2022-8-17 15:55:09
AC	8086	18ms	7 MiB	C++98	247 Bytes	2024-5-4 17:49:30
AC	周靖松 (ZhouJS)	18ms	384 KiB		205 Bytes	2023-4-8 14:52:17
AC	新壹街校区-陈品烨 (陈品烨)	18ms	6.8 MiB		226 Bytes	2023-10-3 9:36:44
AC	极为的好van的 (lyq)	18ms	512 KiB		196 Bytes	2022-7-28 9:41:04
AC	缥 (王硕2012)	18ms	512 KiB		277 Bytes	2022-11-21 16:10:22
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	18ms	512 KiB		269 Bytes	2022-9-24 23:08:48
AC	wangruibo20xh	18ms	7.1 MiB		244 Bytes	2023-12-18 19:17:13
AC	张智洋	19ms	400 KiB		215 Bytes	2023-4-8 17:38:31
AC	弹射起飞 ? 冲 ! (吴周周)	19ms	384 KiB		300 Bytes	2023-4-8 17:30:06
AC	邵冠铖 (shaoguancheng22031)	19ms	384 KiB		221 Bytes	2022-11-27 12:12:29
AC	李彭宋代诗人 (ljy123456)	19ms	436 KiB		397 Bytes	2023-3-23 7:09:21
AC	杨瀚霖 (yanghanlin)	19ms	6.7 MiB		266 Bytes	2023-6-9 16:14:47
AC	郑岐蔚	19ms	512 KiB		221 Bytes	2022-11-6 18:44:43
AC	wangzihang	19ms	452 KiB		208 Bytes	2022-8-5 14:51:39
AC	程子杰 (05c41-czj)	19ms	440 KiB		232 Bytes	2022-7-27 10:49:33
AC	wuqi	19ms	6.9 MiB		273 Bytes	2023-7-29 15:35:44
AC	我很6 (zjj22031)	19ms	440 KiB		228 Bytes	2022-12-1 13:34:41
AC	huanglu	19ms	6.9 MiB		237 Bytes	2023-7-18 11:25:06
AC	张智洋	19ms	436 KiB		231 Bytes	2023-4-8 17:24:35
AC	朱泽晟	19ms	424 KiB		318 Bytes	2022-1-28 21:28:06
AC	许嘉恩 (xje22031)	19ms	492 KiB		242 Bytes	2022-11-26 21:31:20
AC	ganlin1	19ms	6.9 MiB		207 Bytes	2023-7-27 12:23:15
AC	CK (李弘毅)	19ms	440 KiB		282 Bytes	2022-10-1 15:04:21
AC	不怎么聪明的家伙 (贺俊楠)	19ms	512 KiB		226 Bytes	2023-3-5 18:14:40
AC	繁星 (05c35-zzm)	19ms	512 KiB		280 Bytes	2022-11-30 21:25:26
AC	wuqi	19ms	6.9 MiB		273 Bytes	2023-7-29 15:36:30
AC	CK (李弘毅)	19ms	404 KiB		296 Bytes	2022-9-25 14:19:47
AC	laiyouming22031	19ms	512 KiB		200 Bytes	2022-11-20 13:13:15
AC	牟淳雅	19ms	6.8 MiB		265 Bytes	2023-9-24 12:15:15
AC	叶哲宇 (yzy)	19ms	6.8 MiB		221 Bytes	2023-6-23 10:43:56
AC	colin1112 (墙凌可)	19ms	512 KiB		270 Bytes	2023-3-18 15:02:23
AC	曹雅萱	19ms	7.4 MiB	C++11	369 Bytes	2024-5-18 11:42:05
AC	蓝色妖姬 (jiangpeiyu)	19ms	488 KiB		397 Bytes	2022-11-7 9:57:40
AC	邹曜丞 (13983097018)	19ms	7 MiB		311 Bytes	2023-7-18 9:45:52
AC	王晴萱	20ms	6.9 MiB		241 Bytes	2023-7-14 17:03:33
AC	Nico	20ms	6.8 MiB		264 Bytes	2023-6-22 11:13:07
AC	张梓浩 (zhangzihao)	20ms	436 KiB		226 Bytes	2023-3-29 20:38:04
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)	20ms	384 KiB		277 Bytes	2023-2-11 11:25:44