计算人口增长问题

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡瀚文	12ms	392 KiB		152 Bytes	2022-7-12 16:45:29
AC	wuzhenghan	12ms	384 KiB		178 Bytes	2022-11-29 20:24:23
AC	wuzhenghan	12ms	392 KiB		178 Bytes	2022-11-29 20:24:20
AC	xiongxinyao	12ms	512 KiB		237 Bytes	2022-6-30 10:19:35
AC	坤坤荔枝小黑子 (zhonghaotian22006)	12ms	432 KiB		210 Bytes	2022-10-30 16:34:31
AC	缥 (王硕2012)	12ms	432 KiB		223 Bytes	2022-11-14 19:29:24
AC	xuniaoyin (徐袅音)	12ms	6.9 MiB		173 Bytes	2023-9-10 10:35:56
AC	城市之光	12ms	440 KiB		195 Bytes	2023-3-4 10:44:47
AC	凌肯 (lingken22006)	12ms	384 KiB		183 Bytes	2022-10-30 16:40:32
AC	源著校区-宋昊成 (马冬梅)	12ms	452 KiB		224 Bytes	2023-2-25 18:19:02
AC	时代一校-王宥量 (wangyouliang)	12ms	440 KiB		193 Bytes	2022-10-2 12:10:30
AC	wuzhenghan	12ms	384 KiB		178 Bytes	2022-11-29 20:24:20
AC	时代2校-程俊燃 (chengjunran)	12ms	6.7 MiB		272 Bytes	2023-8-25 9:04:09
AC	22029-hqh	12ms	436 KiB		230 Bytes	2022-12-3 18:50:44
AC	叶雨昊 (yeyuhao22006)	12ms	512 KiB		171 Bytes	2022-10-23 20:03:25
AC	zhangheyi22006	12ms	392 KiB		153 Bytes	2022-10-30 16:36:53
AC	wuzhenghan	12ms	384 KiB		178 Bytes	2022-11-29 20:24:21
AC	soha (武夷岩)	12ms	392 KiB		200 Bytes	2022-9-17 17:15:40
AC	zhouxifei	12ms	440 KiB		148 Bytes	2022-10-2 18:46:49
AC	郑岐蔚	12ms	436 KiB		289 Bytes	2022-10-31 19:42:44
AC	https://www.minecraft.net/zh-hans (王振西)	12ms	7 MiB		224 Bytes	2023-6-17 11:39:03
AC	scallway	12ms	384 KiB		200 Bytes	2022-9-15 14:29:19
AC	luosifu22006	12ms	384 KiB		183 Bytes	2022-10-30 16:40:04
AC	yyds (杨骐嘉)	12ms	6.8 MiB		183 Bytes	2023-10-27 18:33:51
AC	soha (武夷岩)	12ms	384 KiB		200 Bytes	2022-9-17 17:15:38
AC	11451254188 (22029-mjh)	12ms	6.8 MiB		212 Bytes	2023-6-22 9:53:27
AC	wuzhenghan	12ms	384 KiB		178 Bytes	2022-11-29 20:24:20
AC	火爆肥肠（杨弘毅） (火爆肥肠)	12ms	512 KiB		182 Bytes	2022-3-17 21:09:30
AC	soha (武夷岩)	12ms	384 KiB		200 Bytes	2022-9-17 17:15:40
AC	李晨希	12ms	6.9 MiB		199 Bytes	2023-6-28 10:56:05
AC	yanglang	12ms	432 KiB		154 Bytes	2022-10-22 21:36:37
AC	wuzhenghan	12ms	392 KiB		178 Bytes	2022-11-29 20:24:22
AC	金沙—彭智宸 (彭智宸)	12ms	6.9 MiB		150 Bytes	2023-8-15 12:17:23
AC	zyl	12ms	7.3 MiB		276 Bytes	2024-1-4 9:50:23
AC	三差学生(尘埃蓝莓) (白佳睿)	12ms	6.9 MiB		179 Bytes	2023-7-7 20:17:43
AC	时代二校-焦雨齐 (Angel)	12ms	7.1 MiB		161 Bytes	2023-10-14 15:43:05
AC	quzhibo	12ms	428 KiB		175 Bytes	2022-9-17 17:21:39
AC	ganlin1	12ms	6.9 MiB		148 Bytes	2023-7-21 18:03:33
AC	凌肯 (lingken22006)	12ms	512 KiB		183 Bytes	2022-10-30 16:40:32
AC	新壹街校区-周士杰 (zsj)	12ms	440 KiB		149 Bytes	2023-5-28 15:58:17
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	12ms	432 KiB		204 Bytes	2023-1-14 15:14:25
AC	乐瀚阳 (yuehanyang)	12ms	512 KiB		239 Bytes	2023-3-18 15:37:50
AC	colin1112 (墙凌可)	12ms	448 KiB		167 Bytes	2023-3-11 14:57:27
AC	繁星 (05c35-zzm)	13ms	444 KiB		190 Bytes	2022-11-26 10:03:30
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)	13ms	512 KiB		159 Bytes	2023-5-27 15:38:50
AC	杨坤霖 (steven)	13ms	440 KiB		187 Bytes	2023-1-9 15:23:20
AC	chenjunyao	13ms	440 KiB		154 Bytes	2023-5-13 10:39:36
AC	你猜呀	13ms	440 KiB		150 Bytes	2023-3-15 20:20:42
AC	soha (武夷岩)	13ms	384 KiB		200 Bytes	2022-9-17 17:15:41
AC	极为的好van的 (lyq)	13ms	388 KiB		167 Bytes	2023-1-12 21:50:19
AC	樊竣熠 (lft1114)	13ms	428 KiB		258 Bytes	2022-8-16 10:25:24
AC	李禹衡 (liyuheng22006)	13ms	436 KiB		158 Bytes	2022-10-30 16:39:43
AC	爱情海校区—沙天一 (沙天一)	13ms	7.1 MiB		158 Bytes	2023-7-9 9:31:58
AC	zhangjiani	14ms	436 KiB		192 Bytes	2022-9-25 20:44:54
AC	xflt_dyp	14ms	6.9 MiB		247 Bytes	2023-7-22 17:08:34
AC	胡澜之 (666hlz666)	14ms	7.4 MiB		201 Bytes	2023-6-28 20:53:47
AC	wangjun	14ms	6.5 MiB		171 Bytes	2023-11-19 11:24:44
AC	huanglu	14ms	432 KiB		243 Bytes	2022-11-4 10:58:22
AC	希蒙 (zhengxingya)	14ms	6.9 MiB		255 Bytes	2023-8-23 16:24:16
AC	杨浩灵 (金坷拉)	14ms	7.9 MiB		336 Bytes	2023-7-20 19:37:38
AC	RanHao	14ms	6.9 MiB		247 Bytes	2023-7-22 11:22:40
AC	Tender. (05c05-zhou)	15ms	512 KiB		182 Bytes	2022-10-17 20:48:01
AC	Turorany (郑浩然)	15ms	7.3 MiB		171 Bytes	2024-1-21 10:00:08
AC	yixingyou	15ms	384 KiB		178 Bytes	2022-9-17 17:06:52
AC	章愉霖	16ms	6.8 MiB		162 Bytes	2023-6-12 19:58:48
AC	葛琮扬	16ms	7.2 MiB		207 Bytes	2023-7-20 14:42:20
AC	JOKER (hhy)	16ms	7 MiB		324 Bytes	2023-12-24 16:36:56
AC	一个小黑	16ms	7 MiB		187 Bytes	2024-1-13 19:34:46
AC	许徐非凡 (非同凡响)	16ms	444 KiB		154 Bytes	2022-11-2 19:39:23
AC	wky	17ms	512 KiB		212 Bytes	2022-12-2 22:08:39
AC	我推的乱破 (贺俊楠)	20ms	7 MiB		167 Bytes	2023-12-3 14:13:58
AC	没有此人 (akm)	22ms	7 MiB		212 Bytes	2023-12-23 14:16:10
AC	pandap&a王皓宸 (WANGHAOCHEN)	27ms	512 KiB		194 Bytes	2023-2-24 17:24:16
AC	时代2校+施皓宬 (shihaocheng)	52ms	768 KiB	C++11	165 Bytes	2024-10-27 9:26:30
AC	张智洋	53ms	552 KiB	C++98	166 Bytes	2024-8-31 17:24:30
AC	新壹街校区-冉睦阳 (冉睦阳)	55ms	764 KiB	C++98	179 Bytes	2024-9-9 18:29:27
AC	代超巡	56ms	544 KiB	C++98(O2)	183 Bytes	2024-9-23 17:20:52
AC	22029-zjs	56ms	728 KiB		200 Bytes	2024-2-1 20:50:20
AC	新壹街朱启航 (zhuqihang)	57ms	768 KiB	C++98	184 Bytes	2024-9-7 10:40:19
AC	田雨杨 (tianyuyang23010)	58ms	548 KiB	C++98	180 Bytes	2024-9-14 18:43:09
AC	A小涂	58ms	536 KiB	C++17(O2)	171 Bytes	2024-11-2 20:51:41
AC	杨博文05	58ms	768 KiB	C++98	191 Bytes	2024-9-10 8:58:24
AC	赵奕铭	59ms	772 KiB		187 Bytes	2024-3-14 14:17:03
AC	王义苇 (wangyiwei)	60ms	548 KiB	C++98	162 Bytes	2024-9-6 11:15:38
AC	fcxin	97ms	9.4 MiB	Python 3	83 Bytes	2024-8-8 11:56:24
AC	高俊	143ms	9.1 MiB	Python 3	98 Bytes	2023-10-12 14:32:05
AC	伍行念 (wuxingnian)	146ms	9.1 MiB	Python 3	82 Bytes	2023-9-24 13:29:22
AC	可爱酱 (张可忻)	147ms	9.1 MiB	Python 2	86 Bytes	2023-8-27 19:00:53
AC	星野光 (Hoshino Hikari)	150ms	9.1 MiB	Python 3	149 Bytes	2023-10-23 23:07:02
AC	安闵煜 (anzai)	150ms	9.1 MiB	Python 3	102 Bytes	2023-11-6 1:32:51
AC	爱琴海校区-刁钲洋 (刁钲洋)	159ms	4 MiB	Python 3	78 Bytes	2022-8-6 20:35:44
AC	梨冻亿 (wiueh)	162ms	3.9 MiB	Python 3	228 Bytes	2022-1-23 17:43:35
AC	11111	162ms	3.9 MiB	Python 3	112 Bytes	2022-1-26 22:39:51
AC	猫不理包子	163ms	3.9 MiB	Python 3	83 Bytes	2023-1-12 11:44:32
AC	19598	165ms	9.1 MiB	Python 3	145 Bytes	2023-8-12 14:02:21
AC	11111	166ms	3.9 MiB	Python 3	112 Bytes	2022-1-26 22:39:50
AC	11111	167ms	3.9 MiB	Python 3	112 Bytes	2022-1-26 22:39:51
AC	kongql	169ms	3.9 MiB	Python 3	85 Bytes	2022-7-19 15:19:51
AC	稻妻第一深情 (喝酒の吟游诗人)	170ms	3.9 MiB	Python 3	96 Bytes	2023-1-11 21:16:51
AC	11111	173ms	3.9 MiB	Python 3	112 Bytes	2022-1-26 22:39:51