Codeforces
wzw1105
生而无畏 战至终章
展开
-
Codeforces Round #510 (Div. 2) --C. Array Product(分类讨论)
C. Array Product time limit per test:1 second ...原创 2018-09-18 00:36:18 · 319 阅读 · 0 评论 -
「CF1194D」1-2-K Game【博弈论】
D. 1-2-K Gametime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputAlice and Bob play a game. There is a paper strip which is divided into $n +...原创 2019-07-16 17:24:50 · 251 阅读 · 0 评论 -
「CF1101F」Trucks and Cities【决策单调优化dp】
F. Trucks and Citiestime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputThere are nnncities along the road, which can be represented as a str...原创 2019-06-09 21:00:22 · 307 阅读 · 0 评论 -
「CF960F」Pathwalks【dp+动态开点线段树维护】
F. Pathwalkstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a directed graph with nnn nodes and mmm edges, with all edges having...原创 2019-06-09 11:55:06 · 198 阅读 · 0 评论 -
「CF1060E」Sergey and Subway【树形dp好题】
Sergey and Subwaytime limit per test 2 secondsmemory limit per test 512 megabytesinput standard inputoutput standard outputSergey Semyonovich is a mayor of a county city NNN and he used to spend...原创 2019-06-08 20:12:57 · 269 阅读 · 0 评论 -
「CF959E」Mahmoud and Ehab and the xor-MST【OEIS】
E. Mahmoud and Ehab and the xor-MSTtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEhab is interested in the bitwise-xor operation and the sp...原创 2019-06-06 15:13:28 · 307 阅读 · 0 评论 -
Educational Codeforces Round 40 (Rated for Div. 2)题解
一年前的某场教育场,一年后才开始补这套题,发现还是错的非常惨,我好菜啊感觉这一场题目出得还是非常好的,题目都不是很难,没有搞你很偏的东西,主要是有很多实现的细节,帮助应该还是挺大的,链接:https://codeforces.com/contest/954ABC 大水题就不说了D. Fight Against Traffic题意:给你一张所有边权都为1的无向图,求出点对(x,...原创 2019-05-28 22:48:46 · 491 阅读 · 0 评论 -
CF1152E--Neko and Flashback(欧拉路径)
E. Neko and Flashback time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputDescriptionA permutation of length k ...原创 2019-04-25 19:29:54 · 347 阅读 · 0 评论 -
D. Ehab and another another xor problem-- Codeforces Round #525 (Div. 2) (思维)
D. Ehab and another another xor problem time limit per test1 second memory limit per test256 megabytes inpu...原创 2018-12-05 17:26:12 · 388 阅读 · 0 评论 -
E. Vasya and a Tree--Educational Codeforces Round 54 (Rated for Div. 2) (DFS&&差分思想)
E. Vasya and a Tree time limit per test 2 seconds ...原创 2018-12-04 20:43:17 · 236 阅读 · 0 评论 -
D. Edge Deletion--Educational Codeforces Round 54 (Rated for Div. 2)(最短路树)
传送门:https://codeforces.com/contest/1076/problem/D D. Edge Deletion time limit per ...原创 2018-12-04 15:35:38 · 194 阅读 · 0 评论 -
HDU5974--A Simple Math Problem &&CF 1076C--Meme Problem(解一元二次方程)
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=5974 A Simple Math Problem Time Limit: 2000/1000 MS (Java/Others...原创 2018-11-14 00:55:35 · 290 阅读 · 0 评论 -
F. Yet another 2D Walking--Codeforces Round #515 (Div. 3)【dp】
F. Yet another 2D WalkingDescriptionMaksim walks on a Cartesian plane. Initially, he stands at the point (0,0) and in one move he can go to any of four adjacent point...原创 2018-10-14 00:20:03 · 720 阅读 · 0 评论 -
E. Binary Numbers AND Sum--Codeforces Round #515 (Div. 3)--【前缀和】
E. Binary Numbers AND SumDescriptionYou are given two huge binary integer numbers aa and bb of lengths nn and mm respectively. You will repeat the following process: if b&...原创 2018-10-14 00:42:29 · 488 阅读 · 0 评论 -
Codeforces Round #510 (Div. 2)--D. Petya and Array--(红黑树或树状数组)
链接:https://codeforces.com/problemset/problem/1042/D D. Petya and ArrayPetya has an array aa consisting of nn integers. He has learned...原创 2018-09-20 00:28:00 · 485 阅读 · 7 评论 -
「CF1194E」Count The Rectangles【树状数组】
E. Count The Rectanglestime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputThere are nnn segments drawn on a plane; the i−thi-thi−th segment ...原创 2019-07-24 09:27:17 · 344 阅读 · 0 评论