角谷猜想

状态	递交者	时间	内存	语言	代码	递交时间
AC	阮 (媚狐不吃道旁李)	14ms	7.2 MiB	C++98	265 Bytes	2024-5-19 13:02:58
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	14ms	384 KiB		350 Bytes	2022-1-23 18:30:19
AC	11111111	14ms	6.8 MiB	C++98(O2)	320 Bytes	2024-5-25 18:46:36
AC	蒲梓勋 (puzixun)	14ms	392 KiB		344 Bytes	2022-11-15 21:50:18
AC	陈家齐 (陈家齐1)	14ms	384 KiB		295 Bytes	2023-5-30 19:40:29
AC	时代一校-曾科智 (曾科智)	14ms	512 KiB		278 Bytes	2023-3-4 18:33:13
AC	缥 (王硕2012)	14ms	384 KiB		279 Bytes	2022-12-1 19:03:05
AC	zhanghaoran	14ms	392 KiB		272 Bytes	2022-3-12 11:11:18
AC	胡瀚文	14ms	512 KiB		330 Bytes	2022-7-17 13:34:51
AC	张月恒	14ms	6.9 MiB	C++98(O2)	281 Bytes	2024-8-23 16:07:30
AC	huyinuo	14ms	436 KiB		311 Bytes	2022-2-25 21:12:50
AC	潘光瑞 (NB牛牛大师)	14ms	436 KiB		387 Bytes	2022-8-11 11:44:55
AC	heyi	14ms	6.8 MiB	C++98(O2)	335 Bytes	2024-8-9 13:48:22
AC	11111111	14ms	6.8 MiB	C++98(O2)	315 Bytes	2024-5-25 18:46:58
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	432 KiB		392 Bytes	2023-2-20 20:29:57
AC	杜俊宏	14ms	392 KiB		287 Bytes	2022-4-9 16:58:46
AC	冒牌陈杰晟【MOD】 (wed)	14ms	384 KiB		342 Bytes	2022-3-6 15:34:30
AC	TBB (杜昊燃)	14ms	440 KiB		321 Bytes	2022-4-30 10:18:25
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	412 KiB		240 Bytes	2022-12-31 10:03:26
AC	三藏的痔疮 (不会玩是原罪)	14ms	392 KiB		387 Bytes	2022-1-21 10:58:37
AC	wuqilin	14ms	384 KiB		285 Bytes	2022-9-14 19:56:44
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	384 KiB		355 Bytes	2022-8-20 21:37:52
AC	17779	14ms	392 KiB		246 Bytes	2022-3-8 20:29:24
AC	源著校区-宋昊成 (马冬梅)	15ms	424 KiB		349 Bytes	2023-2-25 18:15:40
AC	https://www.minecraft.net/zh-hans (王振西)	15ms	384 KiB		270 Bytes	2023-4-2 14:07:31
AC	yanglang	15ms	512 KiB		277 Bytes	2022-10-22 20:52:23
AC	zhm123	15ms	392 KiB		265 Bytes	2023-3-30 15:17:10
AC	文硕 (文硕1)	15ms	436 KiB		276 Bytes	2022-2-6 13:52:01
AC	赵泳鑫 (zhaoyongxin)	15ms	436 KiB		249 Bytes	2022-3-13 9:45:20
AC	kapurua	15ms	7 MiB		255 Bytes	2024-1-20 9:29:08
AC	王重道	15ms	492 KiB		268 Bytes	2022-4-16 15:28:38
AC	kkksc03 (彭士锋)	15ms	512 KiB		312 Bytes	2022-3-11 19:02:23
AC	SYC0226	15ms	424 KiB		294 Bytes	2022-3-20 11:05:23
AC	zhoumingze23017	15ms	6.7 MiB		261 Bytes	2023-8-31 14:19:35
AC	王乐仪	15ms	492 KiB		274 Bytes	2022-2-17 19:02:56
AC	时代二校-陈天成 (鸭缩毛巾)	15ms	384 KiB		255 Bytes	2023-4-1 17:53:17
AC	殷语函	15ms	6.9 MiB	C++11	353 Bytes	2024-8-23 21:39:25
AC	中岛敦 (黄麒瑞)	15ms	6.8 MiB		356 Bytes	2023-10-3 11:20:08
AC	Tang	15ms	440 KiB		272 Bytes	2022-3-12 10:44:43
AC	刘政君 (lzj)	15ms	440 KiB		353 Bytes	2022-7-8 16:24:25
AC	444444444 (唐跃元)	15ms	512 KiB		239 Bytes	2023-1-29 20:29:41
AC	张梓辰 (DiaoDesi屌德斯)	15ms	444 KiB		307 Bytes	2022-9-14 19:39:27
AC	zjz	15ms	384 KiB		255 Bytes	2022-1-25 10:57:32
AC	时代二校+王吕棪 (wanglvyan)	15ms	384 KiB		236 Bytes	2023-4-1 17:43:53
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)	15ms	384 KiB		371 Bytes	2022-11-5 16:06:16
AC	叶哲宇 (yzy)	15ms	436 KiB		255 Bytes	2023-5-12 20:17:25
AC	zhou_1004	15ms	448 KiB		350 Bytes	2022-2-22 19:54:51
AC	zzl	15ms	512 KiB		275 Bytes	2023-1-4 16:52:25
AC	dyp (hhy)	15ms	6.8 MiB		320 Bytes	2023-10-13 16:13:07
AC	在煎鱼的肖大总铳 (肖宇航)	15ms	6.8 MiB		254 Bytes	2023-10-12 21:53:08
AC	吃小孩的viv_	15ms	512 KiB		306 Bytes	2022-8-27 14:44:29
AC	张梓浩 (zhangzihao)	15ms	384 KiB		351 Bytes	2023-3-29 21:03:15
AC	李林峰 (金克拉)	15ms	432 KiB		299 Bytes	2023-2-18 9:48:09
AC	wzzjnb2012	15ms	512 KiB		465 Bytes	2022-9-27 20:46:54
AC	86想要钱 (twt)	15ms	384 KiB		331 Bytes	2022-9-14 20:05:01
AC	曹埊睿 (caodirui)	15ms	436 KiB		318 Bytes	2023-4-18 18:41:45
AC	张祖名	15ms	6.7 MiB		372 Bytes	2023-8-30 13:43:14
AC	***	15ms	512 KiB		270 Bytes	2023-3-2 15:28:20
AC	星野光 (Hoshino Hikari)	15ms	6.8 MiB		403 Bytes	2023-10-23 20:14:37
AC	程子杰 (05c41-czj)	15ms	428 KiB		256 Bytes	2022-7-27 10:41:59
AC	yuhaodi	15ms	512 KiB		457 Bytes	2023-4-23 17:07:31
AC	龚铭俊 (哈哈哈)	15ms	6.7 MiB		310 Bytes	2023-9-3 9:09:03
AC	wuqi	15ms	6.9 MiB		388 Bytes	2023-7-27 15:03:27
AC	Nico	15ms	416 KiB		324 Bytes	2023-4-16 14:42:46
AC	谭懿轩 (yanyixuan)	15ms	440 KiB		260 Bytes	2022-2-15 16:43:53
AC	金锦泽 (jinjinze)	15ms	440 KiB		311 Bytes	2022-7-5 14:57:50
AC	赵鑫宸 (xiaoxiao721)	15ms	520 KiB		329 Bytes	2022-2-18 18:27:47
AC	朱老师 (zyp)	15ms	384 KiB		298 Bytes	2023-3-25 20:23:15
AC	贾鑫豪 (Mr Sam)	15ms	512 KiB		250 Bytes	2022-3-1 20:30:15
AC	李彦臻	15ms	6.8 MiB		274 Bytes	2023-10-4 10:16:21
AC	关博源	15ms	440 KiB		322 Bytes	2023-3-6 19:16:04
AC	葛琮扬	15ms	6.9 MiB		238 Bytes	2023-7-21 12:07:53
AC	时代2校+施皓宬 (shihaocheng)	15ms	384 KiB		324 Bytes	2023-4-1 17:45:40
AC	leisixian (22029-lyh)	15ms	432 KiB		390 Bytes	2022-11-12 10:52:31
AC	三差学生 (尘埃蓝莓)	15ms	6.8 MiB		274 Bytes	2023-10-28 19:51:16
AC	我很6 (zjj22031)	15ms	384 KiB		407 Bytes	2023-3-19 10:35:42
AC	时代一校-王宥量 (wangyouliang)	15ms	404 KiB		271 Bytes	2022-10-16 12:06:07
AC	Jose (反恐皮蛋)	15ms	384 KiB		368 Bytes	2022-11-10 20:05:34
AC	yang	15ms	440 KiB		396 Bytes	2022-8-15 14:36:14
AC	时代2校-程俊燃 (chengjunran)	15ms	440 KiB		300 Bytes	2023-4-1 17:45:37
AC	周琪渃	15ms	384 KiB		370 Bytes	2022-11-4 22:41:56
AC	时代二校+马嘉宸 (majiachen)	15ms	392 KiB		300 Bytes	2023-4-1 17:44:48
AC	小忙果 (王昱杰)	15ms	6.9 MiB		280 Bytes	2023-7-18 8:36:48
AC	yiqiuyu	15ms	384 KiB		311 Bytes	2023-3-25 20:25:09
AC	赵启程 (赵启程1)	15ms	440 KiB		295 Bytes	2023-3-25 20:28:35
AC	ganlin1	15ms	6.9 MiB		263 Bytes	2023-7-17 15:13:51
AC	xflt_dyp	15ms	6.9 MiB		363 Bytes	2023-7-22 16:46:55
AC	黄立信	15ms	6.8 MiB		226 Bytes	2023-10-14 12:35:29
AC	七叶寂照秘密主 (mohaoran)	15ms	512 KiB		240 Bytes	2023-2-24 17:38:10
AC	向俊熙 (xiangjunxi23003)	15ms	420 KiB		234 Bytes	2023-4-1 15:45:19
AC	zcx	15ms	384 KiB		245 Bytes	2022-11-5 14:36:21
AC	陈梓宇	15ms	6.7 MiB		246 Bytes	2023-9-3 9:21:07
AC	zhanglianjie	16ms	392 KiB		266 Bytes	2023-4-1 15:48:17
AC	何洋名 (heyangming)	16ms	492 KiB		248 Bytes	2022-10-6 14:11:23
AC	zhanglianchen	16ms	392 KiB		255 Bytes	2023-4-1 15:49:56
AC	22029-hqh	16ms	436 KiB		355 Bytes	2022-11-18 17:56:58
AC	希蒙 (zhengxingya)	16ms	7.2 MiB		318 Bytes	2023-6-10 11:36:04
AC	时代1校-杨宇轩 (杨宇轩)	16ms	6.9 MiB		341 Bytes	2023-8-21 13:49:30
AC	黄梓轩 (huangzixuan)	16ms	6.9 MiB		335 Bytes	2023-7-26 15:36:57
AC	杨瀚霖 (yanghanlin)	16ms	512 KiB		361 Bytes	2023-5-31 22:47:20