比赛成绩表 - XSM

#	用户	总分数	A 9/587	B 0/382	C 1/342	D 5/152
1	老六 (......)	217	50	-	67	100
2	奇怪的正义人！ (leweiqi)	215	100	7	8	100
3	旷山 (15213268688)	195	100	7	8	80
4	新一街校区Jason_LuoYouZheng (罗友峥)	192	80	14	8	90
5	何晟瑞 (hsr01)	189	50	7	32	100
6	丛林 (conglin)	187	100	7	0	80 / 0
7	杜是贤 (dushixian)	185	100	7	8	70
8	_PXY_	182	60	14	8	100
9	hanzhengmo	127	-	7	100	20
10	马渝杭 (mayuhang)	115	100	7	8	0
10	司雨来 (siyulai)	115	100	7 / 7	8	0
10	马楷航	115	100	7	8	-
13	zcx	107	100	7	0	-
14	郑岐蔚	100	100	-/ 14	0	-
14	阮 (媚狐不吃道旁李)	100	-	-	0	100
16	余晨浩 (yuchenhao)	95	80	7 / 7	8	0
16	CK (李弘毅)	95	80 / 80	7 / 28	8	0
16	任梓豪	95	80	7	8	-
19	何彦瑾 (hyj_20110811)	92	60	-	32	-
20	郭人瑀1	80	80	-	0	0
20	张玉坚 (zhangyuian)	80	80	-	0	-
20	喻兴诚 (Brian)	80	80	-	0	-
20	Jack	80	80	-	-	-
20	赵毕岑	80	80	0	-	-
25	龙沁均 (我是S神)	75	60	7	8	0
26	colin1112 (墙凌可)	74	60 / 100	14	-	-
27	杜俊宏	72	50	14	8	0
28	坤坤荔枝小黑子 (zhonghaotian22006)	65	50	7	8	-
29	王重道	58	-	-/ 14	48	10
30	Tender. (05c05-zhou)	57	50	7	0	-
30	wuqilin	57	50	7	0	-
32	向南地	52	20	-	32	0
33	黄誉翔 (黄誉翔)	50	50	0	-	-
34	陈祖明	49	10	7	32	-
35	hnd (陈皓洋)	47	40	7	0	0
36	贺睿林	45	30	7 / 14	8	0
37	李林峰 (金克拉)	42	10	-	32	-
38	dustsans (njo)	40	20	-	-	20
38	曾御城（现用名） (Jason)	40	40	-	-	-
40	MoonLight ( aaa)	35	20	7	8	-
40	CYT	35	20	7	8	-
42	陈海骞 (chq)	32	-	-	32	-
43	食不食油饼（点主页康康） (Nemo)	30	30	-	-	-
43	汤杰尧 (05c05-tjy1)	30	0	14	16	0
45	庹仕杰	27	20	7 / 0	0	0
45	dengduxi	27	20	7	-	-
45	陈风亦 (chenfengyi)	27	20	7 / 7	0	-
48	缥 (王硕2012)	25	10	7	8	0
48	(金沙天街)严皓月 (严皓月)	25	10	7 / 7	8	0
48	周靖松 (ZhouJS)	25	10 / 100	7 / 7	8	0
48	曾龙兮	25	10	7 / 7	8	0
52	龙湖时代C馆-邹镇宇 (邹镇宇)	20	20	0 / 7	0	0
52	余多多29	20	20	-	0	-
52	呵 (mohaoran)	20	20	-	0	-
55	熊奕博 (Mothefuck)	18	10	-	8	-
56	刘致言	17	10	7 / 0	-	0
56	yat	17	10	7	0	-
56	经常消失 (小萝卜)	17	10	7	-	-
59	王祎辰 (wangyichen)	15	-	7	8	0
59	什蒂尔布 (吴东航)	15	0	7	8	-
59	贾鑫豪 (Mr Sam)	15	0	7	8	0
59	luozixi	15	0	7	8	-
59	444444444 (唐跃元)	15	0 / 100	7	8	0
64	zhangheyi22006	14	0	14	0	-
65	鲜榨大肠汁	10	10	0	0	0
65	刘昱辰	10	10	0	0	0
65	张景豪	10	10	0	0	-
65	徐正旺 (xzw)	10	10	-/ 7	-	-
65	高致远 (GZY)	10	10	-	-	-
65	liulihongfan	10	10	0	0	-
65	蒋雨轩 (jiangyuxuan)	10	10	-	-	0
65	黄彦熹 (AK-203)	10	10	-	0	-
65	86想要钱 (twt)	10	10	-	0	-
65	chenyifeng	10	10	-	-	-
65	我谢谢你全家	10	10	-	-	-
65	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	10	10	0	-	-
65	杨淇瑞 (杨淇瑞29)	10	10	-	0	-
78	马兴宇 (mxy01)	8	0	-	8	-
78	李禹衡 (liyuheng22006)	8	0	0	8	-
78	林叙锦	8	-	-	8	0
78	本人天生贪生pass (05c41-cqs)	8	-	-	8	-
78	时代一校蒋帛希 (13983392730)	8	0	0	8	-
78	游云皓	8	0	-	8	-
78	我是个s* (lijinze)	8	-/ 100	-	8	-
85	zhangluocheng	7	0	7	-	-
85	wrqwc	7	0	7	-	-
85	甄一阳 (22016-zyy)	7	-	7	0	-
85	邵冠铖 (shaoguancheng22031)	7	0	7	0	-
85	李树崑 (lishukun)	7	0	7	-	-
85	暗蛆突围 (lzh)	7	-	7	-	-
91	氪鎄 (deimos)	0	-	-	0	-
91	曲奇饼干	0	0	0	0	0
91	U城校区毕悦志 (byz)	0	0	-	-	-
91	葛琮扬	0	0	-	0	-
91	lll	0	-	-	0	-
91	手搓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	-
91	王浚西 (22016-wjx)	0	0	-	-	-
91	王星然	0	0	-	0	-
91	22029-lsl	0	0	0	0	0
91	罗竣瀚	0	0	-	-	-
91	龚信丞	0	0	0	0	0
91	偽艺術家 (chenyanchi22006)	0	0	-	0	-
91	童艺涵	0	0	0	0	0
91	李龙腾 (llt)	0	-	-	0	-
91	灵光sans (wangchihao)	0	0	-	0	-
91	Z.饮月君 (张皓南)	0	-	0	0	-
91	我是曾科智儿子 (沈小童)	0	0	0	0	-
91	姜思瀚	0	0	-	-	-
91	时代一校-曾科智 (曾科智)	0	0	-	-	-
91	黄梓轩 (huangzixuan)	0	-	0	0	0
91	新壹街校区-吴鑫鹏 (吴鑫鹏)	0	0	-	-	-
91	纪承熙 (jcx001)	0	-	-	-	0
91	05c05-zzx	0	0	-	0	-
91	https://www.minecraft.net/zh-hans (王振西)	0	0	0	0	-
91	钟元朗	0	0	-	-	-
91	cupy战士 (05c05-dkf)	0	-	-	-	0
91	22029-hqh	0	0	0	0	0
91	hxb	0	0	0	-	-
91	付博plus	0	0 / 100	0	0	0
91	陆琦澔1	0	-	-	0	-
91	叶雨昊 (yeyuhao22006)	0	0	0	0	0
91	廖永亨	0	-	0	-	-
91	yanghaojun	0	0	0	0	0
91	许炜铭	0	0	0	0	0
91	新壹街校区-老师: 黄路 (陈星宇)	0	0	-	-	-
91	李昀铂1	0	-	-	0	0
91	56 (13883454928)	0	0	-	-	-
91	xiongxinyao	0	0	0	0	-
91	赵一嵘 (zhaoyirong)	0	0	-	-	-
91	王子辰29	0	0	0	0	0
91	明轩 (吕同学)	0	0	-	-	-
91	raozheng	0	0	0	0	0
91	苏晨懿	0	0	0 / 42	-	-
91	李奎龙 (Judge_lkl)	0	-	0	0	0
91	祝熙承 (zxc)	0	0	0	0	-
91	时代二校+马嘉宸 (majiachen)	0	0	-	-	-
91	zzy	0	-	-	0	-
91	王拓野1	0	0	-	0	-
91	罗晨睿 (luochenrui)	0	0	-	-	-
140	Jose (反恐皮蛋)	0	-	-	-	-
140	朱彦搏	0	-	-	-	-
140	周景炀	0	-	-	-	-
140	向俊熙 (xiangjunxi23003)	0	-	-	-	-
140	唐良瑞 (22016-tlr01)	0	-	-	-	-
140	朱老师 (zyp)	0	-/ 100	-	-	-
140	喻文博 (22016-ywb)	0	-	-	-	-
140	张家豪 (zhangjiahao)	0	-	-	-	-
140	王瀚毅 (wanghanyi)	0	-	-	-	-
140	huanglu	0	-	-	-	-
140	时代一校-王宥量 (wangyouliang)	0	-	-	-	-
140	谢秉真 (xbz)	0	-	-	-	-
140	城 (liqc)	0	-	-	-/ 100	-
140	陈杰晟 (王梓屹)	0	-	-	-	-
140	chenxiaozhun	0	-	-	-	-
140	刘老师 (图书管理员)	0	-	-	-	-
140	范老师	0	-	-	-	-
140	孙烽轶 (sfy)	0	-	-	-	-
140	jdy	0	-	-	-	-

状态

开发

支持

状态

开发

支持

还没有账户？

登录