CQUPT 训练题 2017/4/10

Begin: 1491802500000

CQUPT 训练题 2017/4/10

End: 1492270500000

Elapsed:

Remaining:

#	Origin	Title
A	LightOJ 1080	Binary Simulation
B	LightOJ 1088	Points in Segments
C	LightOJ 1072	Calm Down
D	LightOJ 1047	Neighbor House
E	LightOJ 1082	Array Queries
F	LightOJ 1094	Farthest Nodes in a Tree

Status

My Status

Translate

PDF

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":158057,"title":"CQUPT 训练题 2017/4/10","type":0,"openness":0,"authStatus":1,"begin":1491802500000,"end":1492270500000,"createTime":1491802423000,"started":true,"ended":true,"managerId":44245,"managerName":"cqupt","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":26797,"title":"Binary Simulation","oj":"LightOJ","probNum":"1080","num":"A","publicDescId":3125630955959333,"publicDescVersion":1713922666000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26805,"title":"Points in Segments","oj":"LightOJ","probNum":"1088","num":"B","publicDescId":3128387352520269,"publicDescVersion":1713593161000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26789,"title":"Calm Down","oj":"LightOJ","probNum":"1072","num":"C","publicDescId":3125588576390077,"publicDescVersion":1713485364000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26767,"title":"Neighbor House","oj":"LightOJ","probNum":"1047","num":"D","publicDescId":3125519196567263,"publicDescVersion":1713728007000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26799,"title":"Array Queries","oj":"LightOJ","probNum":"1082","num":"E","publicDescId":3125619992185023,"publicDescVersion":1713709351000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26811,"title":"Farthest Nodes in a Tree","oj":"LightOJ","probNum":"1094","num":"F","publicDescId":3128406201375771,"publicDescVersion":1713711666000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]}],"problemsHash":"1df955737f8669201579033e565cf78a","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}