Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
Begin:
1525784400000
2018SCUACM Training 8 图论
End:
1526389200000
Elapsed:
Remaining:
Overview
Problem
Status
Rank
Discuss
Setting
Clone
Stat
#
Origin
Title
A
HDU 1874
The Road to Radio
B
POJ 3259
耳机楼的通道
C
POJ 1287
设计网络
D
POJ 1611
缉毒
E
UVA 821
最短距离
F
HDU 1232
新的目标
G
HDU 2544
不，是你的T-shirt
H
POJ 1679
猫的游戏
A
B
C
D
E
F
G
H
Status
My Status
Translate
PDF
Rejudge
Select a statement for participants:
Run ID
Username
Prob
All
Result
All
Accepted
Presentation Error
Wrong Answer
Time Limit Exceed
Memory Limit Exceed
Output Limit Exceed
Runtime Error
Compile Error
Remote OJ Unavailable
Judge Failed
Unknown Error
Submit Failed
Queuing && Judging
Time
(ms)
Mem
(MB)
Length
Lang
All
C
C++
C#
D
Go
Haskell
Java
JavaScript
Kotlin
Lua
Objective-C
Pascal
Perl
PHP
Python
Ruby
Rust
Scala
Swift
Other
Submit Time
×
{"id":227960,"title":"2018SCUACM Training 8 图论","type":0,"openness":0,"authStatus":1,"begin":1525784400000,"end":1526389200000,"createTime":1525771323000,"started":true,"ended":true,"managerId":157105,"managerName":"SCU2018","fav":false,"description":{"format":"MD","content":""},"announcement":"本次训练涉及最短路径、并查集、最小生成树等相关知识。","problems":[{"pid":17632,"title":"The Road to Radio","oj":"HDU","probNum":"1874","num":"A","publicDescId":2869769217610851,"publicDescVersion":1525784637000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2008%D5%E3%B4%F3%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C8%C8%C9%ED%C8%FC%A3%A82%A3%A9%A1%AA%A1%AA%C8%AB%D5%E6%C4%A3%C4%E2\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008浙大研究生复试热身赛（2）——全真模拟 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elinle\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10533,"title":"耳机楼的通道","oj":"POJ","probNum":"3259","num":"B","publicDescId":2869767112206589,"publicDescVersion":1525784120000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2006+December+Gold\"\u003eUSACO 2006 December Gold\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":27372,"title":"设计网络","oj":"POJ","probNum":"1287","num":"C","publicDescId":2869774934441940,"publicDescVersion":1525771852000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dSoutheastern+Europe+2002\"\u003eSoutheastern Europe 2002\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10536,"title":"缉毒","oj":"POJ","probNum":"1611","num":"D","publicDescId":2869809223341413,"publicDescVersion":1525783668000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"20000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dAsia+Kaohsiung+2003\"\u003eAsia Kaohsiung 2003\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":27138,"title":"最短距离","oj":"UVA","probNum":"821","num":"E","publicDescId":2869801400780298,"publicDescVersion":1525780663000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":19355,"title":"新的目标","oj":"HDU","probNum":"1232","num":"F","publicDescId":2869798528002559,"publicDescVersion":1525780702000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2005%C4%EA\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙大计算机研究生复试上机考试-2005年 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10951,"title":"不，是你的T-shirt","oj":"HDU","probNum":"2544","num":"G","publicDescId":2869795952327769,"publicDescVersion":1525781789000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dUESTC+6th+Programming+Contest+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e UESTC 6th Programming Contest Online \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17124,"title":"猫的游戏","oj":"POJ","probNum":"1679","num":"H","publicDescId":2869828340822835,"publicDescVersion":1525782886000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dPOJ+Monthly--2004.06.27+srbga%40POJ\"\u003ePOJ Monthly--2004.06.27 srbga@POJ\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"982fcd38f11e30f82feca6df52a600fb","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}
