放米 - 题目统计

状态	递交者	时间	内存	语言	代码	递交时间
AC	1396013295	6ms	256 KiB		204 Bytes	2022-1-23 18:58:02
AC	胡宸华 (huchenhua)	6ms	320 KiB		165 Bytes	2022-3-16 23:09:33
AC	时代二校-王盼兮 (wangpanxi)	8ms	7.4 MiB		209 Bytes	2024-1-21 11:11:34
AC	NJL (NJlL)	11ms	384 KiB		264 Bytes	2022-5-15 16:51:33
AC	zhangyh (张育菡)	11ms	412 KiB		176 Bytes	2022-6-12 15:33:14
AC	何洋名 (heyangming)	11ms	384 KiB		152 Bytes	2022-3-27 9:56:52
AC	laoyang	11ms	384 KiB		158 Bytes	2022-5-19 18:46:34
AC	繁星 (05c35-zzm)	11ms	512 KiB		170 Bytes	2022-5-22 15:23:21
AC	huangxiangming(黄相茗)	11ms	384 KiB		238 Bytes	2022-5-14 12:36:57
AC	zhouzipu	11ms	512 KiB		188 Bytes	2022-8-18 22:37:04
AC	何洋名 (heyangming)	11ms	384 KiB		153 Bytes	2022-3-27 10:03:23
AC	文硕 (文硕1)	11ms	512 KiB		211 Bytes	2022-7-12 13:51:22
AC	luoluonuoya	12ms	512 KiB		308 Bytes	2022-5-6 18:14:07
AC	李山水	12ms	384 KiB		226 Bytes	2022-5-7 19:54:44
AC	陈杰晟	12ms	384 KiB		123 Bytes	2022-5-13 15:17:15
AC	姚宏逸	12ms	384 KiB		140 Bytes	2022-5-30 16:20:05
AC	杜是贤 (dushixian)	12ms	408 KiB		148 Bytes	2022-7-2 11:15:16
AC	何晟瑞 (hsr01)	12ms	440 KiB		189 Bytes	2022-8-11 16:03:49
AC	yang	12ms	384 KiB		139 Bytes	2022-9-9 20:26:07
AC	经常消失 (小萝卜)	12ms	384 KiB		173 Bytes	2022-7-17 16:32:04
AC	赵泳鑫 (zhaoyongxin)	12ms	384 KiB		199 Bytes	2022-5-8 17:02:02
AC	阮 (媚狐不吃道旁李)	12ms	7.2 MiB	C++98	187 Bytes	2024-5-18 10:46:57
AC	李哲 (lizhe)	12ms	384 KiB		148 Bytes	2022-10-5 21:46:27
AC	Erin	12ms	7 MiB	C++98	148 Bytes	2024-6-12 17:47:05
AC	Jose (反恐皮蛋)	12ms	384 KiB		322 Bytes	2022-5-19 18:48:08
AC	赵鑫宸 (xiaoxiao721)	12ms	512 KiB		230 Bytes	2022-3-26 18:39:06
AC	赵泳鑫 (zhaoyongxin)	12ms	392 KiB		199 Bytes	2022-5-7 20:09:30
AC	周琪渃	12ms	512 KiB		178 Bytes	2023-5-20 17:52:19
AC	火星伞宾——刘晏恺 (刘晏恺)	12ms	7 MiB	C++98	132 Bytes	2024-8-25 10:01:29
AC	MoonLight ( aaa)	12ms	432 KiB		122 Bytes	2022-4-28 21:03:42
AC	肖添宇	12ms	384 KiB		211 Bytes	2022-5-14 19:44:51
AC	huanglu	12ms	424 KiB		142 Bytes	2023-5-12 20:03:30
AC	芒苒忧 (廖迦南)	12ms	452 KiB		163 Bytes	2022-3-13 18:25:59
AC	HIMMZXC	12ms	512 KiB		187 Bytes	2022-3-5 14:42:55
AC	王乐仪	12ms	432 KiB		146 Bytes	2022-4-14 18:57:21
AC	luosifu22006	12ms	392 KiB		188 Bytes	2022-11-13 16:28:38
AC	Tender. (05c05-zhou)	12ms	424 KiB		209 Bytes	2022-10-23 13:50:55
AC	蒋青峰	13ms	440 KiB		183 Bytes	2023-5-7 11:13:27
AC	霍弈丞小号	13ms	432 KiB		160 Bytes	2023-4-16 17:16:51
AC	邹曜丞 (13983097018)	13ms	7.2 MiB		191 Bytes	2023-11-4 17:46:49
AC	zhangheyi22006	13ms	384 KiB		161 Bytes	2022-11-13 16:21:33
AC	huyinuo	13ms	432 KiB		141 Bytes	2022-7-20 13:59:54
AC	郑岐蔚	13ms	436 KiB		194 Bytes	2023-4-12 19:52:17
AC	偽艺術家 (chenyanchi22006)	13ms	512 KiB		175 Bytes	2023-5-5 20:50:53
AC	cupy战士 (05c05-dkf)	13ms	432 KiB		195 Bytes	2023-4-9 16:23:07
AC	zzzrrrxxx	13ms	6.8 MiB		134 Bytes	2023-10-19 21:35:44
AC	城 (liqc)	13ms	392 KiB		169 Bytes	2022-10-4 22:17:17
AC	缥 (王硕2012)	13ms	432 KiB		229 Bytes	2023-5-3 22:01:10
AC	蒲梓勋 (puzixun)	13ms	444 KiB		173 Bytes	2022-8-12 17:42:42
AC	RanHao	13ms	6.9 MiB		151 Bytes	2023-8-19 13:33:00
AC	王韵淮	13ms	440 KiB		130 Bytes	2022-5-1 11:27:57
AC	zhuqiwei22006	13ms	384 KiB		164 Bytes	2022-11-13 16:30:26
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	6.9 MiB		206 Bytes	2023-6-17 19:17:41
AC	凌肯 (lingken22006)	13ms	392 KiB		186 Bytes	2022-11-13 16:31:40
AC	李禹衡 (liyuheng22006)	13ms	384 KiB		183 Bytes	2022-11-13 16:26:48
AC	xuniaoyin (徐袅音)	13ms	6.8 MiB		159 Bytes	2023-9-3 14:33:33
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	440 KiB		202 Bytes	2022-11-13 16:19:07
AC	朱老师 (zyp)	14ms	436 KiB		175 Bytes	2022-7-25 19:36:19
AC	zhm123	14ms	424 KiB		170 Bytes	2022-12-30 9:40:04
AC	我是周靖松长得帅 (mouyunqi)	14ms	436 KiB		204 Bytes	2023-6-3 7:32:28
AC	lihaotian	14ms	6.7 MiB		140 Bytes	2023-8-28 15:20:57
AC	colin1112 (墙凌可)	14ms	6.8 MiB		882 Bytes	2023-8-20 10:45:26
AC	李树崑 (lishukun)	14ms	428 KiB		186 Bytes	2022-11-27 10:58:38
AC	我是个s* (lijinze)	14ms	392 KiB		167 Bytes	2023-5-27 16:51:40
AC	11451254188 (22029-mjh)	14ms	6.8 MiB		190 Bytes	2023-6-19 21:06:04
AC	黄梓桐 (HuangZiTong)	14ms	392 KiB		159 Bytes	2022-11-13 10:43:44
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	512 KiB		163 Bytes	2023-5-28 11:06:22
AC	CYT	14ms	436 KiB		174 Bytes	2023-3-22 12:06:47
AC	zcx	14ms	6.8 MiB		203 Bytes	2023-6-21 18:37:44
AC	凌肯 (lingken22006)	14ms	392 KiB		186 Bytes	2022-11-13 16:31:40
AC	金沙—彭智宸 (彭智宸)	15ms	6.9 MiB		160 Bytes	2023-8-19 10:42:28
AC	爱琴海校区-黄辰浩 (huangchenhao)	15ms	6.8 MiB		174 Bytes	2023-6-29 13:53:22
AC	zlx (xiao)	15ms	512 KiB		277 Bytes	2022-11-26 19:42:24
AC	不怎么聪明的家伙 (贺俊楠)	15ms	7 MiB		197 Bytes	2024-1-20 19:30:49
AC	爱琴海校区-刁钲洋 (刁钲洋)	15ms	6.8 MiB		198 Bytes	2023-6-29 13:53:02
AC	新壹街朱启航 (zhuqihang)	15ms	7.3 MiB		195 Bytes	2024-1-21 18:33:17
AC	疯神芭芭脱丝 (李卓修)	16ms	512 KiB		199 Bytes	2022-7-12 11:29:40
AC	新壹街校区-陈琬舒 (空空大师)	16ms	7.2 MiB		169 Bytes	2023-11-12 19:18:46
AC	小忙果 (王昱杰)	17ms	7.1 MiB		201 Bytes	2023-12-3 14:21:29
AC	Guest	17ms	7.1 MiB		153 Bytes	2023-11-11 21:06:40
AC	yanyuhan	18ms	7.2 MiB		175 Bytes	2023-12-31 16:37:05
AC	叶哲宇 (yzy)	18ms	6.9 MiB		144 Bytes	2023-8-3 21:17:35
AC	新壹街—熊轩杭 (xiongxuanhang)	20ms	7.1 MiB		180 Bytes	2024-1-20 19:29:15
AC	zyl	21ms	7.3 MiB		136 Bytes	2024-1-21 9:54:22
AC	胡澜之 (666hlz666)	23ms	7 MiB		221 Bytes	2023-12-6 18:39:18
AC	张瑞博	50ms	536 KiB	C++11	191 Bytes	2024-9-1 17:16:05
AC	时代2校-程俊燃 (chengjunran)	58ms	764 KiB		186 Bytes	2024-1-31 16:20:42
AC	jdy	59ms	536 KiB		204 Bytes	2024-3-6 16:44:46
AC	张智洋	59ms	788 KiB		163 Bytes	2024-3-16 16:29:26
AC	U城校区-邓皓月 (邓皓月)	61ms	764 KiB		196 Bytes	2024-3-31 9:22:28
AC	赵奕铭	62ms	536 KiB		188 Bytes	2024-3-8 22:00:37
AC	拥抱幸福小熊(吴沛篪)	62ms	536 KiB		148 Bytes	2024-4-6 10:50:54
AC	赵奕铭	63ms	768 KiB		190 Bytes	2024-3-8 22:00:28
AC	唐一航	66ms	764 KiB	C++11	186 Bytes	2024-9-14 13:18:19
AC	My name is Man (钟卓劭)	67ms	768 KiB		146 Bytes	2024-3-31 9:16:56
AC	梨冻亿 (wiueh)	173ms	3.9 MiB	Python 3	69 Bytes	2022-1-23 19:59:31
AC	谭红中 (不知道)	180ms	4 MiB	Python 3	30 Bytes	2022-4-17 21:38:57
AC	苗润昊	183ms	3.9 MiB	Python 3	29 Bytes	2022-2-13 16:53:49
AC	赵沛喆	188ms	3.9 MiB	Python 3	38 Bytes	2022-5-8 11:32:37