codeforces
让我改变你的心智
这个作者很懒,什么都没留下…
展开
-
722C - Destroying Array 线段树
Destroying Arrayoutputstandard outputYou are given an array consisting of n non-negative integersa1, a2, ..., an.You are going to destroy integers in the array one by one. Thus,原创 2016-10-02 16:00:34 · 524 阅读 · 1 评论 -
Codeforces Round #375 (Div. 2) D Lakes in Berland
E. One-Way Reformtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n cities and m two-way roads in Berland, each road co...原创 2018-10-10 15:29:46 · 220 阅读 · 0 评论 -
codeforces 484D. Shark
D. Sharktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFor long time scientists study the behavior of sharks. Sharks, as many other species, alter...原创 2018-05-20 14:12:00 · 511 阅读 · 0 评论 -
codeforcese 477 D.Resource Distribution
D. Resource Distributiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne department of some software company has nn servers of different specif...原创 2018-04-30 16:59:59 · 339 阅读 · 0 评论 -
codeforces 917B. MADMAX
B. MADMAXtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs we all know, Max is the best video game player among her原创 2018-01-31 19:34:05 · 666 阅读 · 0 评论 -
codeforces Round 447 div2 D Ralph And His Tour in Binary Country
D. Ralph And His Tour in Binary Countrytime limit per test2.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRalph is in the Binary Coun原创 2017-11-22 23:08:50 · 258 阅读 · 0 评论 -
codeforc H. Palindromic Cut
H. Palindromic Cuttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKolya has a string s of length n consisting of l原创 2017-10-26 19:30:59 · 288 阅读 · 0 评论 -
codeforces 848B - Rooter's Song 瞎搞
B. Rooter's Songtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWherever the destination is, whoever we meet, let's原创 2017-09-02 20:43:02 · 615 阅读 · 0 评论 -
858D Polycarp's phone book 字典树
D. Polycarp's phone booktime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n phone numbers in Polycarp's cont原创 2017-09-19 13:23:39 · 584 阅读 · 0 评论 -
cf Manthan, Codefest 17 E. Salazar Slytherin's Locket
E. Salazar Slytherin's Lockettime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHarry came to know from Dumbledore that原创 2017-09-25 13:18:06 · 384 阅读 · 0 评论 -
codeforces 55D. Beautiful numbers
D. Beautiful numberstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVolodya is an odd boy and his taste is strange a原创 2017-08-30 22:34:33 · 285 阅读 · 0 评论 -
842C Ilya And The Tree
C. Ilya And The Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIlya is very fond of graphs, especially trees. D原创 2017-08-30 12:31:45 · 648 阅读 · 0 评论 -
580D - Kefa and Dishes
When Kefa came to the restaurant and sat at a table, the waiter immediately brought him the menu. There weren dishes. Kefa knows that he needs exactlym dishes. But at that, he doesn't want to orde原创 2017-08-04 14:32:32 · 313 阅读 · 0 评论 -
796D - Police Stations
D. Police Stationstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputInzane finally found Zane with a lot of money to s原创 2017-04-26 21:23:09 · 338 阅读 · 0 评论 -
789C Mike and gcd problem
C. Mike and gcd problemtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputMike has a sequence A = [a1, a2, ...,原创 2017-04-24 13:47:20 · 404 阅读 · 0 评论 -
Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2) C Fountains
C. Fountainstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputArkady plays Gardenscapes a lot. Arkady wants to build t原创 2017-05-12 13:39:16 · 260 阅读 · 0 评论 -
791D Bear and Tree Jumps
D. Bear and Tree Jumps A tree is an undirected connected graph without cycles. The distance between two vertices is the number of edges in a simple path between them.Limak is a little polar bear.原创 2017-03-22 22:23:27 · 702 阅读 · 0 评论 -
codeforces 131D Subway
D. Subwaytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA subway scheme, classic for all Berland cities is represented by a set...原创 2018-11-16 16:05:03 · 283 阅读 · 0 评论