[NOIP2013 普及组] 计数问题

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	16ms	384 KiB		228 Bytes	2022-4-10 11:22:50
AC	赵沛喆	16ms	256 KiB		228 Bytes	2022-4-10 11:22:55
AC	Zongzi1	17ms	6.7 MiB	C++17(O2)	271 Bytes	2024-7-18 18:21:51
AC	汪致卉 (wangzh)	17ms	316 KiB		360 Bytes	2022-2-11 22:14:11
AC	曹埊睿 (caodirui)	17ms	424 KiB		266 Bytes	2023-5-7 14:57:13
AC	11451254188 (22029-mjh)	18ms	6.9 MiB		706 Bytes	2023-8-3 11:27:40
AC	文硕 (文硕1)	18ms	304 KiB		347 Bytes	2023-2-1 8:50:17
AC	稻妻第一深情 (喝酒の吟游诗人)	18ms	316 KiB		229 Bytes	2023-3-11 23:48:13
AC	姚宏逸	18ms	316 KiB	C	347 Bytes	2022-3-19 15:36:50
AC	heyi	18ms	6.8 MiB	C++98(O2)	261 Bytes	2024-8-11 11:02:04
AC	姚宏逸	19ms	296 KiB		347 Bytes	2022-1-15 15:07:33
AC	胡宸华 (huchenhua)	19ms	308 KiB		347 Bytes	2023-1-7 21:35:41
AC	MoonLight ( aaa)	19ms	256 KiB		347 Bytes	2022-1-26 20:33:33
AC	蓝色妖姬 (jiangpeiyu)	19ms	320 KiB		238 Bytes	2022-11-7 10:01:40
AC	胡宸华 (huchenhua)	19ms	384 KiB		262 Bytes	2023-1-7 21:37:31
AC	罗康恒23025	19ms	6.8 MiB	C++98(O2)	257 Bytes	2024-6-26 15:22:54
AC	姚宏逸	19ms	256 KiB		347 Bytes	2022-3-19 15:37:01
AC	杜俊宏	19ms	400 KiB		467 Bytes	2022-7-8 16:20:49
AC	张祖名	20ms	6.9 MiB	C++98(O2)	256 Bytes	2024-6-11 22:31:29
AC	金沙-文豪 (wenhao)	20ms	6.9 MiB	C++98(O2)	262 Bytes	2024-8-18 16:25:05
AC	胡宸华 (huchenhua)	20ms	308 KiB		347 Bytes	2023-1-7 21:30:51
AC	坤坤荔枝小黑子 (zhonghaotian22006)	22ms	512 KiB		674 Bytes	2022-11-24 10:37:14
AC	zhouzipu	22ms	384 KiB		312 Bytes	2022-2-19 9:27:58
AC	张楷岩	22ms	6.8 MiB	C++11	218 Bytes	2024-6-27 20:39:47
AC	kkksc03 (彭士锋)	22ms	512 KiB		414 Bytes	2022-3-18 19:11:43
AC	chen (peter)	22ms	436 KiB		414 Bytes	2022-7-19 14:26:46
AC	罗毅川 (scp-049)	22ms	384 KiB		244 Bytes	2022-2-19 9:42:35
AC	colin1112 (墙凌可)	22ms	6.8 MiB		302 Bytes	2023-10-17 20:30:53
AC	朱子龙	22ms	6.7 MiB	C++11	224 Bytes	2024-7-18 16:34:27
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	22ms	6.8 MiB		249 Bytes	2023-10-23 21:36:23
AC	彭嘉豪 (pengjiahao)	23ms	424 KiB		225 Bytes	2022-7-31 10:52:40
AC	love GanYu (爱搞笑的张浩宇)	23ms	7 MiB	C++11	363 Bytes	2024-6-28 21:43:47
AC	徐绅博	23ms	6.9 MiB	C++98	224 Bytes	2024-6-14 21:41:51
AC	周浩楠 (开朗的周好难)	23ms	6.7 MiB		284 Bytes	2023-8-30 15:44:34
AC	黄梓桐 (HuangZiTong)	23ms	384 KiB		235 Bytes	2022-8-7 11:14:56
AC	肖宇航1	23ms	6.9 MiB	C++11	200 Bytes	2024-8-16 14:13:45
AC	Accepted (周芷乐)	23ms	7 MiB	C++14	239 Bytes	2024-5-30 19:02:35
AC	阮 (媚狐不吃道旁李)	23ms	7 MiB	C++98	535 Bytes	2024-5-19 14:06:02
AC	杜俊宏	23ms	436 KiB		476 Bytes	2022-7-8 16:19:50
AC	K517	24ms	6.9 MiB	C++11	330 Bytes	2024-6-27 17:50:11
AC	zhouzipu	24ms	440 KiB		312 Bytes	2022-2-19 9:27:56
AC	yyds (杨骐嘉)	24ms	7 MiB	C++98	228 Bytes	2024-5-24 18:27:04
AC	吴俊成 (wujuncheng)	24ms	384 KiB		334 Bytes	2022-7-11 11:18:23
AC	尹浩宁2077	24ms	6.9 MiB		238 Bytes	2023-6-30 10:28:57
AC	yanglang	24ms	512 KiB		254 Bytes	2023-2-12 9:24:55
AC	SYC0226	24ms	424 KiB		247 Bytes	2022-3-20 13:44:15
AC	谭懿轩 (yanyixuan)	24ms	436 KiB		206 Bytes	2022-8-5 17:02:37
AC	朱泽晟	24ms	512 KiB		302 Bytes	2022-2-14 10:37:10
AC	17779	24ms	444 KiB		251 Bytes	2022-3-21 16:53:19
AC	啊...这 (炼狱杏寿郎)	24ms	384 KiB		233 Bytes	2022-6-29 11:39:30
AC	wangzihang	24ms	512 KiB		417 Bytes	2023-3-4 15:41:22
AC	黄鹏翰	24ms	6.9 MiB	C++11	245 Bytes	2024-6-14 21:52:20
AC	疯神芭芭脱丝 (李卓修)	24ms	436 KiB		297 Bytes	2022-7-12 17:28:54
AC	Erin	24ms	7 MiB	C++98	216 Bytes	2024-5-28 14:07:30
AC	无尽的想象 (谭仕高)	24ms	512 KiB		207 Bytes	2022-7-30 15:32:27
AC	12345	24ms	436 KiB		388 Bytes	2022-8-8 9:43:56
AC	zhuziyu	24ms	420 KiB		235 Bytes	2022-2-19 9:27:57
AC	赵泳鑫 (zhaoyongxin)	25ms	392 KiB		258 Bytes	2022-7-13 19:57:17
AC	樊竣熠 (lft1114)	25ms	436 KiB		238 Bytes	2022-6-6 18:13:18
AC	胡澜之 (666hlz666)	25ms	392 KiB		328 Bytes	2023-5-10 20:31:54
AC	史继来	25ms	6.8 MiB	C++98	206 Bytes	2024-8-25 15:17:47
AC	经常消失 (小萝卜)	25ms	448 KiB		260 Bytes	2022-7-15 17:30:38
AC	zhangyh (张育菡)	25ms	428 KiB		264 Bytes	2022-6-10 22:38:45
AC	陈杰晟	25ms	432 KiB		267 Bytes	2022-3-24 15:38:56
AC	黄立信	25ms	6.8 MiB		344 Bytes	2023-10-20 22:52:24
AC	05c05-hzy	25ms	412 KiB		245 Bytes	2023-2-12 11:37:40
AC	周琪渃	25ms	384 KiB		313 Bytes	2023-3-9 20:26:43
AC	zzl	25ms	6.8 MiB		300 Bytes	2023-11-7 1:15:48
AC	周琪渃	26ms	432 KiB		284 Bytes	2023-3-9 20:25:52
AC	爱琴海校区-刁钲洋 (刁钲洋)	26ms	6.7 MiB		306 Bytes	2023-9-14 18:49:08
AC	朱老师 (zyp)	26ms	424 KiB		275 Bytes	2022-8-7 11:17:44
AC	luoluonuoya	26ms	420 KiB		234 Bytes	2022-8-28 18:10:09
AC	Tender. (05c05-zhou)	26ms	436 KiB		302 Bytes	2022-10-18 11:39:13
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)	26ms	436 KiB		245 Bytes	2023-5-16 20:11:34
AC	wangruibo20xh	26ms	444 KiB		314 Bytes	2022-2-12 19:03:40
AC	ganlin1	26ms	6.9 MiB		210 Bytes	2023-7-28 13:28:31
AC	周琪渃	27ms	392 KiB		284 Bytes	2023-3-9 20:25:52
AC	吴佳智 (AWM)	27ms	440 KiB		328 Bytes	2023-5-10 20:31:14
AC	huanglu	27ms	7.8 MiB		216 Bytes	2023-7-18 14:49:40
AC	唐语堂	27ms	6.7 MiB	C++98	278 Bytes	2024-8-1 18:05:01
AC	叶哲宇 (yzy)	27ms	6.8 MiB		221 Bytes	2023-8-26 11:29:46
AC	周琪渃	27ms	436 KiB		284 Bytes	2023-3-9 20:25:50
AC	谢延灏 (xeiyanhao---a handsome boy)	27ms	440 KiB		294 Bytes	2022-5-15 12:44:14
AC	时代一校-赵彦博 (zyb)	27ms	6.9 MiB		306 Bytes	2023-8-5 14:25:48
AC	Nico	28ms	6.9 MiB		242 Bytes	2023-7-18 13:10:24
AC	不怎么聪明的家伙 (贺俊楠)	28ms	392 KiB		226 Bytes	2023-4-30 16:34:53
AC	RanHao	28ms	6.9 MiB		313 Bytes	2023-7-22 19:10:34
AC	任童(rentong)	28ms	428 KiB		255 Bytes	2022-12-16 14:20:18
AC	蒲梓勋 (puzixun)	29ms	6.9 MiB		271 Bytes	2023-6-9 19:50:57
AC	邹曜丞 (13983097018)	29ms	8.2 MiB		225 Bytes	2023-8-24 10:01:39
AC	时代二校-陈天成 (鸭缩毛巾)	29ms	6.5 MiB		234 Bytes	2023-6-3 22:57:30
AC	^_^ (ctc)	30ms	440 KiB		228 Bytes	2022-10-26 20:58:41
AC	向南地	32ms	412 KiB		456 Bytes	2022-2-19 9:29:09
AC	繁星 (05c35-zzm)	34ms	444 KiB		363 Bytes	2022-12-1 13:25:22
AC	yang	34ms	440 KiB		305 Bytes	2022-8-18 17:08:33
AC	zyl	35ms	7.3 MiB		214 Bytes	2024-1-5 13:51:46
AC	德克萨斯做的到吗 (liyangbao)	36ms	432 KiB		272 Bytes	2022-11-7 17:27:10
AC	新壹街.曾祥睿 (zxr)	38ms	6.9 MiB		226 Bytes	2023-12-13 21:42:49
AC	王彬羽 (wby)	42ms	7.1 MiB		309 Bytes	2023-12-7 20:05:21
AC	牟淳雅	44ms	7.3 MiB		245 Bytes	2023-12-31 10:43:36