CUC拿不到牌全单身——尺取法+二分答案

Begin: 1565838000000

CUC拿不到牌全单身——尺取法+二分答案

End: 1566450000000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 3061	Subsequence
B	POJ 3320	Jessica's Reading Problem
C	POJ 2566	Bound Found
D	POJ 2100	Graveyard Design
E	POJ 2739	Sum of Consecutive Prime Numbers
F	UVA 11572	Unique Snowflakes
G	POJ 3579	Median
H	POJ 3122	Pie
I	POJ 3258	River Hopscotch
J	POJ 2289	Jamie's Contact Groups
K	POJ 2455	Secret Milking Machine
L	POJ 2253	Frogger
M	POJ 3662	Telephone Lines
N	CodeForces 676C	Vasya and String
O	CodeForces 616D	Longest k-Good Segment
P	CodeForces 670D2	Magic Powder - 2
Q	HihoCoder 1362	修补木桶
R	CodeForces 670D1	Magic Powder - 1
S	UVA 264	Count on Cantor

Status

My Status

Translate

PDF

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

{"id":320030,"title":"CUC拿不到牌全单身——尺取法+二分答案","type":0,"openness":0,"authStatus":1,"begin":1565838000000,"end":1566450000000,"createTime":1565837861000,"started":true,"ended":true,"managerId":216955,"managerName":"zongziyu","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":21444,"title":"Subsequence","oj":"POJ","probNum":"3061","num":"A","enabledDescKeys":[3110202258371776],"descBriefs":[{"key":3110202258371776,"updateDate":"2024-06-24","version":1719187669000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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\u003dSoutheastern+Europe+2006\"\u003eSoutheastern Europe 2006\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":24699,"title":"Jessica\u0027s Reading Problem","oj":"POJ","probNum":"3320","num":"B","enabledDescKeys":[3104315033264032],"descBriefs":[{"key":3104315033264032,"updateDate":"2024-06-21","version":1718936824000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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\u003dPOJ+Monthly--2007.08.05\"\u003ePOJ Monthly--2007.08.05\u003c/a\u003e, Jerry\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":39361,"title":"Bound Found","oj":"POJ","probNum":"2566","num":"C","enabledDescKeys":[3219773680689802],"descBriefs":[{"key":3219773680689802,"updateDate":"2024-06-25","version":1719316679000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","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\u003dUlm+Local+2001\"\u003eUlm Local 2001\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":39270,"title":"Graveyard Design","oj":"POJ","probNum":"2100","num":"D","enabledDescKeys":[3221154243059565],"descBriefs":[{"key":3221154243059565,"updateDate":"2024-06-23","version":1719141103000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Case time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"64000 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\u003dNortheastern+Europe+2004\"\u003eNortheastern Europe 2004\u003c/a\u003e, Northern Subregion\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":18023,"title":"Sum of Consecutive Prime Numbers","oj":"POJ","probNum":"2739","num":"E","enabledDescKeys":[3153874525862581],"descBriefs":[{"key":3153874525862581,"updateDate":"2024-06-19","version":1718790502000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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\u003dJapan+2005\"\u003eJapan 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":25998,"title":"Unique Snowflakes","oj":"UVA","probNum":"11572","num":"F","enabledDescKeys":[3123614600690959],"descBriefs":[{"key":3123614600690959,"updateDate":"2024-06-19","version":1718737138000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"2000 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":24230,"title":"Median","oj":"POJ","probNum":"3579","num":"G","enabledDescKeys":[3102806436067752],"descBriefs":[{"key":3102806436067752,"updateDate":"2024-06-22","version":1719032542000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.04.13\"\u003ePOJ Founder Monthly Contest – 2008.04.13\u003c/a\u003e, Lei Tao\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":17088,"title":"Pie","oj":"POJ","probNum":"3122","num":"H","enabledDescKeys":[3153353768900384],"descBriefs":[{"key":3153353768900384,"updateDate":"2024-06-25","version":1719313520000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","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\u003dNorthwestern+Europe+2006\"\u003eNorthwestern Europe 2006\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":16277,"title":"River Hopscotch","oj":"POJ","probNum":"3258","num":"I","enabledDescKeys":[3150124234470993],"descBriefs":[{"key":3150124234470993,"updateDate":"2024-06-22","version":1719020247000,"author":"0","remarks":"Initialization."}],"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+Silver\"\u003eUSACO 2006 December Silver\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":11086,"title":"Jamie\u0027s Contact Groups","oj":"POJ","probNum":"2289","num":"J","enabledDescKeys":[3158503256593811],"descBriefs":[{"key":3158503256593811,"updateDate":"2024-06-21","version":1718935072000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"7000 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\u003dShanghai+2004\"\u003eShanghai 2004\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":10504,"title":"Secret Milking Machine","oj":"POJ","probNum":"2455","num":"K","enabledDescKeys":[3159719594254084],"descBriefs":[{"key":3159719594254084,"updateDate":"2024-06-20","version":1718885460000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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+2005+February+Gold\"\u003eUSACO 2005 February 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":11759,"title":"Frogger","oj":"POJ","probNum":"2253","num":"L","enabledDescKeys":[3161663607745949],"descBriefs":[{"key":3161663607745949,"updateDate":"2024-06-22","version":1718998247000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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\u003dUlm+Local+1997\"\u003eUlm Local 1997\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":12427,"title":"Telephone Lines","oj":"POJ","probNum":"3662","num":"M","enabledDescKeys":[3160965403332569],"descBriefs":[{"key":3160965403332569,"updateDate":"2024-06-24","version":1719168211000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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+2008+January+Silver\"\u003eUSACO 2008 January Silver\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":391012,"title":"Vasya and String","oj":"CodeForces","probNum":"676C","num":"N","enabledDescKeys":[3271294783640132],"descBriefs":[{"key":3271294783640132,"updateDate":"2024-06-24","version":1719162723000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/676\"\u003eCodeforces Round 354 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    dp\r\n\n\r\n    strings\r\n\n\r\n    two pointers\r\n\n\r\n    *1500\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/45031\" title\u003d\"45031\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":306224,"title":"Longest k-Good Segment","oj":"CodeForces","probNum":"616D","num":"O","enabledDescKeys":[3240423090190559],"descBriefs":[{"key":3240423090190559,"updateDate":"2024-06-22","version":1719058221000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/616\"\u003eEducational Codeforces Round 5\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    data structures\r\n\n\r\n    two pointers\r\n\n\r\n    *1600\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/22691\" title\u003d\"Educational Codeforces Round 5\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/22712\" title\u003d\"Editorial of Educational Codeforces Round 5\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":378023,"title":"Magic Powder - 2","oj":"CodeForces","probNum":"670D2","num":"P","enabledDescKeys":[3268192100013952],"descBriefs":[{"key":3268192100013952,"updateDate":"2024-06-22","version":1719060131000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/670\"\u003eCodeforces Round 350 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    implementation\r\n\n\r\n    *1500\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/44715\" title\u003d\"Codeforces Round #350 (Div.2) Editorial\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":544504,"title":"修补木桶","oj":"HihoCoder","probNum":"1362","num":"Q","enabledDescKeys":[3358900416866795],"descBriefs":[{"key":3358900416866795,"updateDate":"2022-08-08","version":1659949803000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"[Offer收割]编程练习赛6","spoiler":true}],"weight":1,"submitTips":"HihoCoder is down.","submitMethods":[false,false,false]},{"pid":378022,"title":"Magic Powder - 1","oj":"CodeForces","probNum":"670D1","num":"R","enabledDescKeys":[3268163456383349],"descBriefs":[{"key":3268163456383349,"updateDate":"2024-06-22","version":1718992420000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/670\"\u003eCodeforces Round 350 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    brute force\r\n\n\r\n    implementation\r\n\n\r\n    *1400\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/44715\" title\u003d\"Codeforces Round #350 (Div.2) Editorial\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":19110,"title":"Count on Cantor","oj":"UVA","probNum":"264","num":"S","enabledDescKeys":[3106609001453216],"descBriefs":[{"key":3106609001453216,"updateDate":"2024-06-21","version":1718904886000,"author":"0","remarks":"Initialization."}],"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]}],"problemsHash":"97e7488c5245ecef59a3134810e5cf6c","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}