作业成绩表 - XSM

排名	用户	分数	总耗时	A 39/76	B 33/41	C 24/59	D 22/35	E 22/34	F 13/27	G 11/35	H 4/5	I 11/17	J 10/12	K 7/10	L 11/12	M 8/13	N 1/1	O 3/3
1	wangruibo20xh	1500	73502:41	100 4899:43	100 4899:45	100 4899:51	100 4899:54	100 4899:56	100 4899:58	100 4900:05	100 4900:18	100 4900:20	100 4900:24	100 4900:25	100 4900:26	100 4900:27	100 4900:30	100 4900:32
2	坤坤荔枝小黑子 (zhonghaotian22006)	1300	76849:05	100 5911:26	100 5911:26	100 5911:26	100 5911:27	100 5911:27	100 5911:27	100 5911:27		100 5911:28	100 5911:28	100 5911:29	100 5911:29	100 5911:29		100 5911:30
3	杨颂恩 (yangsongen)	1200	44029:53	100 2983:06	100 2983:06	100 2983:10	100 2983:12	100 2983:13	100 2983:14	100 2983:16		100 2983:22	100 2983:21	100 2983:23	100 2983:20	100 11214:02
3	何煜琦	1200	136554:03	100 11377:56	100 11377:58	100 11377:59	100 11378:03	100 11378:04	100 11380:21	100 11380:25	100 11380:29		100 11380:39	100 11380:40	100 11380:41	100 11380:42
5	汤杰尧 (05c05-tjy1)	1100	1943:13	100 176:11	100 176:12	100 176:22	100 176:30	100 176:39	100 176:40		100 176:45	100 176:49	100 176:58	100 177:00	100 177:02
5	Tender. (05c05-zhou)	1100	7186:24	100 653:14	100 653:16	100 653:16	100 653:17	100 653:17	100 653:18	100 653:18		100 653:20	100 653:21	100 653:21	100 653:21
5	My name is Man (钟卓劭)	1100	93205:47	100 8472:55	100 8472:56	100 8472:58	100 8472:59	100 8473:01	100 8473:10	100 8473:24		100 8473:32	100 8473:36	100 8473:34	100 8473:38
8	Randy Marsh (杨子腾)	1000	3231:21	100 293:33	100 293:33	100 293:34	100 293:37	100 293:38	100 293:43	100 293:50	100 293:55	100 293:56			100 293:57	0 293:58
9	xuniaoyin (徐袅音)	900	21659:39	100 2331:13	100 2331:14	100 2446:59	100 2431:40	100 2431:38	100 2447:07	100 2431:40					100 2404:02	100 2404:01
10	向南地	700	2056:45	100 293:41	100 293:42	100 293:48	100 293:54	100 293:56	100 293:45	100 293:58
10	许炜铭 (xuweiming)	700	21331:30	100 2212:33	100 2212:34	100 2212:34	100 2212:35			0 5843:12					100 2212:42	100 2212:37		100 2212:38
10	段淏泷	700	65249:50	100 9321:23	100 9321:24	100 9321:24	100 9321:26	100 9321:26							100 9321:21	100 9321:22
10	( ) (李恺伦)	700	78771:11	100 7784:51	100 7784:57	100 8209:13	100 7785:48	100 7785:53	100 7786:26			100 8209:38	0 7807:58	0 7808:06	0 7808:16
14	李昀铂 (liyunbo)	600	1762:39	100 293:39	100 293:39	100 293:43	100 293:52	100 293:49				100 293:56
14	zhouzaoyu	600	63067:13	100 10510:36	100 10510:40	100 10510:50	100 10511:17	100 10512:00	100 10511:47
16	陈风亦 (chenfengyi)	500	1254:27	100 129:38	100 129:47	100 293:41	100 293:48	100 407:30
16	~ycy~	500	1803:22	100 293:41	100 293:43	100 293:48	100 628:14	100 293:55
16	新壹街校区-罗斤天 (罗斤天)	500	11933:49	100 1988:49	100 1988:50	100 1988:59	100 1989:00	100 1989:01	0 1989:07
16	嘉宝 (王淳恺)	500	60848:54	100 12169:23	100 12169:24	100 12169:40	100 12169:49	100 12170:36
20	金沙—彭智宸 (彭智宸)	480	13480:58	100 2600:09	100 2720:02	100 2720:05	80 2720:15	100 2720:25
21	colin1112 (墙凌可)	400	401:39	100 30:58	100 123:33	100 123:33	100 123:34
21	新壹街校区-杨轩懿 (杨轩懿1)	400	15590:24	100 3897:34	100 3897:35			100 3897:37				100 3897:36
21	我是傻逼 (刘鸿瑞)	400	47446:16	100 11855:58	100 11855:58	100 11855:58		100 11878:20
21	（^-^) (蒋金卓)	400	52296:33	100 8715:54	100 8715:55	0 8715:57	100 8716:04	100 8716:16	0 8716:25
25	陈骏逸 (chenjunyi)	350	8063:18	100 2015:05	100 2015:10	100 2015:14	50 2017:48
26	(张洛诚)	300	96:33	100 32:00	100 32:09					100 32:24
26	没有此人 (akm)	300	5845:03		100 1948:18							100 1948:21	100 1948:22
26	AAA? Prow max (hechenxuan23005)	300	36429:40	100 12143:11	100 12143:13	100 12143:15
29	周靖松 (ZhouJS)	200	242:30	100 121:14	100 121:15
29	余龙恩 (小码君)	200	587:13	100 293:33	100 293:40
29	曾子墨	200	881:23	100 293:43	100 293:43	0 293:55
29	科比.布莱恩特 (董浩琰)	200	5225:40	100 2612:49									100 2612:50
29	金沙校区-先珂熠 (九转大肠)	200	17201:25	100 7929:08	100 9272:17
29	Nico	200	21022:34				100 10511:02		100 10511:32
29	张瑞博	200	35502:24	100 11834:05	100 11834:06	0 11834:12
36	marz	190	15759:02	100 7349:28								90 8409:33
36	源著校区-老师：刘扬-张博涵 (张博涵)	190	21104:57						90 10557:02	100 10547:54
38	繁星 (05c35-zzm)	100	248:50	100 248:50
38	U城校区-郭旻哲 (郭旻哲)	100	3346:03	100 3346:03
38	Turorany (郑浩然)	100	3662:03	100 1831:01	0 1831:02
38	岳鑫正	100	6166:26										100 6166:26
38	皮蛋	100	7903:56	100 7903:56
38	徐伟宸 (徐伟宸1)	100	10612:03													100 10612:03
38	zhangyouze (张佑泽)	100	30825:44	100 10275:13	0 10275:14			0 10275:17
45	hnd (陈皓洋)	0	244:23	0 122:14		0 122:08
45	时代一校蒋帛希 (13983392730)	0	1821:47	0 1821:47
45	勾晨禹	0	8423:42	0 8423:42
45	杨淇瑞 (杨淇瑞29)	0	9920:15	0 9920:15
45	马祎铭	0	9969:49	0 9969:49
50	Alduin	0	0:00
50	姚宏逸	0	0:00
50	Jose (反恐皮蛋)	0	0:00
50	scallway	0	0:00
50	刘老师 (图书管理员)	0	0:00
50	jdy	0	0:00
50	爱琴海校区-刁钲洋 (刁钲洋)	0	0:00
50	wuqi	0	0:00
50	陈杰晟	0	0:00
50	李树崑 (lishukun)	0	0:00
50	在煎鱼的肖大总铳 (肖宇航)	0	0:00
50	kapurua	0	0:00
50	余晨浩 (yuchenhao)	0	0:00
50	chenkerun	0	0:00
50	司雨来 (siyulai)	0	0:00
50	偽艺術家 (chenyanchi22006)	0	0:00
50	秦兴润	0	0:00
50	何昊宇 (22016-hhy)	0	0:00
50	刘昱辰	0	0:00
50	吴佳智 (AWM)	0	0:00
50	蒲梓勋 (puzixun)	0	0:00
50	¿¿¿??? (李睿瞳)	0	0:00
50	罗兰（漆黑襟默) (zhangxiaoci)	0	0:00
50	陈雨泽1	0	0:00
50	想了一个月的昵称	0	0:00
50	邓云恒	0	0:00
50	乐瀚阳 (yuehanyang)	0	0:00
50	手搓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)	0	0:00
50	谢雨贝	0	0:00
50	王昱祺 (12王昱祺)	0	0:00
50	谭奕辰	0	0:00
50	六 (江智昕)	0	0:00
50	王彬羽 (wby)	0	0:00
50	赵秋泽	0	0:00
50	我推的乱破 (贺俊楠)	0	0:00
50	我是蔡徐坤 (任晋辉)	0	0:00
50	冉钟宇	0	0:00
50	huanglinyi	0	0:00
50	三差学生(尘埃蓝莓) (白佳睿)	0	0:00
50	孔妘蘂	0	0:00
50	蒋青峰	0	0:00
50	韩俊毅	0	0:00
50	周靖淞 (zhoujingsong)	0	0:00
50	陈于硕(我™的) (chenyu)	0	0:00
50	新壹街陈科言 (cky)	0	0:00
50	第五人格启动 (罗子键)	0	0:00
50	煞笔笔	0	0:00
50	郭益豪的替身(笛卡尔) (guoyihaodexiaohao)	0	0:00
50	彭熙芮	0	0:00
50	美术猫映画 (mkh)	0	0:00
50	周米骐 (zsb)	0	0:00
50	谢靳骁 (XJX)	0	0:00
50	李禹呈	0	0:00
50	Chter	0	0:00
50	翁宇鑫	0	0:00
50	wanghaixi xxx	0	0:00
50	孙健涵 (hanhan090207)	0	0:00
50	张祖名	0	0:00
50	菠萝元帅 (sxh)	0	0:00
50	洛阳锦程 (郭思利)	0	0:00
50	金沙校区 - 刘昱辰 (liuyuchen002)	0	0:00
50	新壹街校区--税崇峻 (税崇峻)	0	0:00
50	新壹街-桂梦文 (桂梦文)	0	0:00
50	liuqingzi	0	0:00
50	余皓翔	0	0:00
50	曹星羽	0	0:00
50	杨皓淞	0	0:00
50	老六在此	0	0:00
50	新壹街校区-付宇轩 (fyx)	0	0:00
50	雷诺伊尔 (崔金鹏)	0	0:00
50	RanHao	0	0:00
50	edy	0	0:00
50	liuyuanxi23017	0	0:00
50	李安桐23025	0	0:00
50	余彦竺23025	0	0:00
50	罗浩瑀	0	0:00
50	郭睿	0	0:00
50	朱一凡	0	0:00
50	冯锦汶	0	0:00
50	WJF (王健沣23017)	0	0:00
50	CICI	0	0:00
50	荣子瑜	0	0:00
50	赵健羽	0	0:00
50	乖乖	0	0:00
50	陈诺	0	0:00
50	王培锦	0	0:00
50	陈信羽	0	0:00
50	wulj	0	0:00
50	丁一轩	0	0:00
50	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	0	0:00
50	赵奕铭	0	0:00
50	成njz	0	0:00
50	陈牧远	0	0:00
50	lizishuo	0	0:00
50	林禹衡	0	0:00
50	youke1	0	0:00
50	311	0	0:00
50	张寓杰	0	0:00
50	王婕斯	0	0:00
50	周莀熙	0	0:00

状态

开发

支持

状态

开发

支持

还没有账户？

登录