乐逍遥xwl

摘要： Codeforces Round #575 (Div. 3) F - K-th Path You are given a connected undirected weighted graph consisting of n vertices and m edges. You need to pri 阅读全文

摘要： Codeforces Round #575 (Div. 3) E - Connected Component on a Chessboard You are given two integers b and w. You have a chessboard of size 109×109 with 阅读全文

摘要： Codeforces Round #575 (Div. 3) D2 - RGB Substring (hard version) The only difference between easy and hard versions is the size of the input. You are 阅读全文

摘要： Codeforces Round #575 (Div. 3) D1 - RGB Substring (easy version) The only difference between easy and hard versions is the size of the input. You are 阅读全文

摘要： Codeforces Round #575 (Div. 3) C - Robot Breakout n robots have escaped from your laboratory! You have to find them as soon as possible, because these 阅读全文

摘要： Codeforces Round #575 (Div. 3) B - Odd Sum Segments You are given an array a consisting of n integers a1,a2,…,an. You want to split it into exactly k  阅读全文

摘要： Codeforces Round #575 (Div. 3) A - Three Piles of Candies Alice and Bob have received three big piles of candies as a gift. Now they want to divide th 阅读全文