首页
题库
训练
比赛
作业
评测记录
排名
登录
注册
Language
English
한국어
简体中文
正體中文
统计
递交统计
显示:
运行时间
内存占用
代码长度
提交时间
ASC
DESC
所有语言
搜索
状态
递交者
时间
内存
语言
代码
递交时间
AC
周浩楠 (开朗的周好难)
-
6.8 MiB
1.3 KiB
2023-12-11 20:10:51
AC
余秋仪
-
7.5 MiB
1.2 KiB
2023-11-11 11:34:03
AC
Accepted (周芷乐)
-
7.3 MiB
1.5 KiB
2023-11-11 11:30:56
AC
唐翰
-
7.3 MiB
1.5 KiB
2024-1-7 14:03:40
AC
鄢爱宸
-
7.1 MiB
1.5 KiB
2023-11-11 11:21:34
AC
新壹街—熊轩杭 (xiongxuanhang)
-
7.3 MiB
1.4 KiB
2024-1-22 9:40:15
AC
王芃淏
-
6.9 MiB
1.5 KiB
2023-11-9 19:48:07
AC
任童(rentong)
0ms
256 KiB
1.4 KiB
2023-1-31 17:29:16
AC
经常消失 (小萝卜)
1ms
256 KiB
1.5 KiB
2023-3-25 8:42:12
AC
LukeDid
1ms
256 KiB
1.5 KiB
2023-4-21 22:28:11
AC
冉钟宇
1ms
256 KiB
1.5 KiB
2023-5-13 20:37:13
AC
冉钟宇
1ms
256 KiB
1.5 KiB
2023-5-13 20:39:11
AC
赵沛喆
1ms
256 KiB
1.4 KiB
2022-8-3 15:56:09
AC
陇夕茹
1ms
256 KiB
1.5 KiB
2023-5-13 20:34:59
AC
韩俊毅
1ms
256 KiB
1.5 KiB
2023-5-13 20:39:04
AC
煞笔笔
1ms
256 KiB
1.5 KiB
2023-5-5 20:19:47
AC
赵耘毅
1ms
256 KiB
1.6 KiB
2023-5-13 20:40:36
AC
菠萝元帅 (sxh)
1ms
256 KiB
1.5 KiB
2023-5-13 20:20:11
AC
冉钟宇
1ms
384 KiB
1.5 KiB
2023-5-13 20:39:12
AC
德克萨斯做的到吗 (liyangbao)
1ms
256 KiB
1.3 KiB
2023-2-27 17:42:09
AC
youhonglin
1ms
256 KiB
1.5 KiB
2023-5-5 20:14:24
AC
冉钟宇
1ms
232 KiB
1.5 KiB
2023-5-13 20:39:12
AC
任凌薇
1ms
256 KiB
1.4 KiB
2023-6-1 15:50:30
AC
冉钟宇
1ms
384 KiB
1.5 KiB
2023-5-13 20:39:11
AC
任远宁 (renyuanning)
1ms
384 KiB
1.3 KiB
2022-8-30 20:47:23
AC
煞笔笔
1ms
256 KiB
1.5 KiB
2023-5-5 20:19:49
AC
王俊峰 (王子昕)
1ms
256 KiB
1.5 KiB
2023-5-13 20:47:51
AC
冉钟宇
1ms
256 KiB
1.5 KiB
2023-5-13 20:39:12
AC
朱泽晟
1ms
256 KiB
C
1.4 KiB
2022-10-1 15:44:27
AC
刘鹤枫 (liuhefeng)
1ms
256 KiB
1.6 KiB
2022-8-7 14:05:41
AC
冉钟宇
1ms
384 KiB
1.5 KiB
2023-5-13 20:39:12
AC
芒苒忧 (廖迦南)
1ms
384 KiB
1.5 KiB
2022-8-4 14:46:17
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:48:53
AC
张林吉翰
1ms
7.1 MiB
1.5 KiB
2023-11-4 17:29:24
AC
黄俊乔
1ms
7.1 MiB
1.5 KiB
2023-11-4 17:26:15
AC
董乙辰
1ms
6.8 MiB
1.5 KiB
2023-11-4 17:37:11
AC
stehpen_zuo
1ms
6.9 MiB
C++20
1.2 KiB
2024-6-1 15:22:03
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:48:56
AC
zhaoyinjie23005
1ms
6.5 MiB
1.5 KiB
2023-9-2 20:40:02
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:50:07
AC
张濯弋
1ms
6.7 MiB
1.5 KiB
2023-9-2 17:49:35
AC
爱琴海校区-刁钲洋 (刁钲洋)
1ms
6.7 MiB
1.3 KiB
2023-8-27 11:00:11
AC
金沙校区-先珂熠 (九转大肠)
1ms
7 MiB
1.5 KiB
2023-9-2 11:35:09
AC
cainuoyan
1ms
6.7 MiB
1.5 KiB
2023-9-2 12:49:52
AC
赖睿颢 (赖X颢)
1ms
6.5 MiB
1.5 KiB
2023-9-2 17:47:41
AC
金沙校区-倪晨睿 (倪晨睿)
1ms
6.5 MiB
1.5 KiB
2023-9-2 12:28:41
AC
金沙校区-李嘉齐 (李嘉齐)
1ms
6.5 MiB
1.5 KiB
2023-9-3 19:53:27
AC
大马猴 (周琳竣)
1ms
384 KiB
1.5 KiB
2023-2-5 17:58:12
AC
学神降临 (陈柯玮)
1ms
6.5 MiB
1.5 KiB
2023-9-1 20:39:30
AC
任润哲
1ms
6.7 MiB
1.5 KiB
2023-9-2 20:35:51
AC
杨岷鑫
1ms
7 MiB
C++98(O2)
1.5 KiB
2024-6-16 19:49:45
AC
刘曦蓓
1ms
6.7 MiB
1.5 KiB
2023-9-2 20:53:11
AC
technoblade
1ms
6.7 MiB
1.5 KiB
2023-8-27 11:25:06
AC
AAA? Prow max (hechenxuan23005)
1ms
6.7 MiB
1.5 KiB
2023-9-2 20:50:29
AC
洛阳 锦程 (郭思利)
1ms
6.8 MiB
1.5 KiB
2023-10-29 11:35:32
AC
陈廷恩
1ms
6.7 MiB
1.5 KiB
2023-9-1 20:41:34
AC
RanHao
1ms
6.7 MiB
1.5 KiB
2023-9-1 18:34:46
AC
王开济臣
1ms
6.5 MiB
1.5 KiB
2023-9-2 12:26:35
AC
金沙校区-周骄阳 (周骄阳)
1ms
6.6 MiB
1.6 KiB
2023-9-2 11:50:05
AC
李卓航 (鲨beeYKL)
1ms
6.5 MiB
1.5 KiB
2023-9-2 17:47:34
AC
金沙校区-王俊元 (王俊元)
1ms
6.7 MiB
1.5 KiB
2023-9-2 11:44:34
AC
MoonLight ( aaa)
1ms
384 KiB
1.5 KiB
2022-8-12 9:46:48
AC
刘梦泉
1ms
6.5 MiB
1.5 KiB
2023-9-1 20:50:16
AC
杨诗琪
1ms
6.5 MiB
1.5 KiB
2023-9-13 20:36:23
AC
王传忆
1ms
6.7 MiB
1.5 KiB
2023-9-13 21:03:10
AC
huyinuo
1ms
384 KiB
1.9 KiB
2022-8-2 13:07:50
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:48:49
AC
姚宏逸
1ms
384 KiB
1.5 KiB
2022-8-19 13:17:04
AC
胡宸瑞
1ms
6.5 MiB
1.5 KiB
2023-9-1 20:40:01
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:48:53
AC
杜俊宏
1ms
384 KiB
1.4 KiB
2022-7-31 9:55:13
AC
李彭 宋代诗人 (ljy123456)
1ms
384 KiB
1.5 KiB
2023-3-23 21:16:28
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:48:54
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:48:56
AC
xuniaoyin (徐袅音)
1ms
6.9 MiB
1.6 KiB
2023-7-23 14:53:08
AC
摸鱼人的小仓库 http://www.staggeringbeauty.com/ 大虫子 https://www.ak-ioi.com/apps/oi-2048/ 华容道 chrome://dino/ 小恐龙 https://littlealchemy2.com/ 小小炼金师 https://2048game.com/ 数字组 https://dimit.me/Fe26/index_zh_CN.html 死铁 http://www.4399.com/ 4399 https://www.mazegenerator.net/ 迷宫 https://lewan.baidu.com/rankland?idfrom=5056&gameSource=mini&gameType=0 百度游戏 [https://deepmess.com/namerena/]名字竞技场 ev.io 枪战游戏https://www.crazygames.com/game/air-wars-2 飞机 https://www.crazygames.com/game/kirka-io 枪战 https://www.crazygames.com/game/ev-io (李承璋)
1ms
6.9 MiB
1.5 KiB
2023-11-4 17:47:38
AC
pengjinhua23005
1ms
6.6 MiB
1.5 KiB
2023-8-26 15:22:57
AC
technoblade
1ms
6.5 MiB
1.5 KiB
2023-8-27 11:24:26
AC
U城校区 毕悦志 (byz)
1ms
384 KiB
1.5 KiB
2023-2-5 17:43:27
AC
唐嘉文
1ms
384 KiB
1.6 KiB
2022-9-17 15:57:34
AC
千千万万
1ms
384 KiB
1.7 KiB
2023-2-7 22:21:36
AC
邹曜丞 (13983097018)
1ms
384 KiB
1.6 KiB
2023-4-2 10:48:53
AC
徐钒予
1ms
384 KiB
1.5 KiB
2023-2-5 18:01:50
AC
陈骏逸 (chenjunyi)
1ms
384 KiB
1.5 KiB
2022-8-9 13:59:21
AC
周琪渃
1ms
384 KiB
1.4 KiB
2023-4-30 12:15:56
AC
(张洛诚)
1ms
6.6 MiB
1.7 KiB
2023-6-8 19:52:20
AC
ycy
1ms
384 KiB
1.5 KiB
2023-2-5 17:34:52
AC
周靖淞 (zhoujingsong)
1ms
392 KiB
1.5 KiB
2023-2-5 17:41:03
AC
李彭 宋代诗人 (ljy123456)
2ms
392 KiB
1.5 KiB
2023-3-23 21:16:36
AC
诸禹吉 (zhuyuji)
2ms
384 KiB
1.6 KiB
2022-8-7 22:50:29
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)
2ms
6.7 MiB
1.4 KiB
2023-8-12 14:06:08
AC
黄俊乔 (黄俊凯)
2ms
6.8 MiB
1.5 KiB
2023-11-4 17:39:19
AC
贾博涵
2ms
6.8 MiB
1.5 KiB
2023-7-10 16:44:03
AC
ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)
3ms
7.1 MiB
1.5 KiB
2023-11-11 11:17:21
AC
小白白
4ms
6.8 MiB
1.6 KiB
2023-11-24 21:23:15
AC
张三
4ms
6.7 MiB
1.6 KiB
2023-11-24 20:47:57
AC
凌胥桐1
5ms
7.3 MiB
1.5 KiB
2023-11-11 11:32:46
AC
杨淇瑞 (杨淇瑞29)
5ms
532 KiB
C++98
1.6 KiB
2024-9-5 15:44:35
AC
cj66
7ms
532 KiB
C++11(O2)
1.3 KiB
2024-9-15 10:54:21
AC
张瑞博
7ms
532 KiB
C++11
1.5 KiB
2024-9-7 15:28:33
1
2
下一页 ›
超级玛丽游戏
查看题目
递交
文件
统计
信息
ID
892
时间
1000ms
内存
256MiB
难度
7
标签
(无)
递交数
507
已通过
107
上传者
Alduin
还没有账户？
注册一个 XSM 通用账户，您就可以在我们提供的所有在线评测服务上提交代码、参与讨论。
现在注册
关闭
登录
使用您的 XSM 通用账户
用户名
密码
记住我
忘记密码或者用户名？
