yasolx的博客

The ElderTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1098 Accepted Submission(s): 289Problem Description Once upon a time, in the mysti

Counting CliquesTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3480 Accepted Submission(s): 1254Problem Description A clique is a complete

Balloon Robot Time Limit: 1 Second Memory Limit: 65536 KB The 2017 China Collegiate Programming Contest Qinhuangdao Site is coming! There will be teams participating in the contest, and the con

DifferenceTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1247 Accepted Submission(s): 335Problem Description Little Ruins is playing a num

基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题 X轴上有N个点，每个点除了包括一个位置数据X[i]，还包括一个权值W[i]。点P到点P[i]的带权距离 = 实际距离 * P[i]的权值。求X轴上一点使它到这N个点的带权距离之和最小，输出这个最小的带权距离之和。 Input 第1行：点的数量N。(2 <= N <= 10000) 第2 - N + 1行：每行

D. Lovely Matrix time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Lenny had an n × m matrix of positive integers. He loved the matrix so mu

B. Balanced Substring time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given a string s consisting only of characters 0 and 1. A sub

InstabilityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 592 Accepted Submission(s): 218Problem Description Long long ago, there was a pr

1499 图 基准时间限制：2 秒 空间限制：262144 KB 分值: 80 难度：5级算法题 给一个无向图，你要将这些点分成A、B两个集合，使得满足A的导出子图是一个完全图，而B的导出子图是一个没有边的图。 但是事实上你不一定能够做到，所以你允许有错误。我们定义一个完美值为： 1.如果A中两点有边相连，则增加|i-j|的完美值。 2.如果B中两点无边相连，则增加|i-j|的完美值。

F. Card Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Digital collectible card games have become very popular recently. So Vova dec

E. Selling Souvenirs time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output After several latest reforms many tourists are planning to visit Berl

Nowadays a lot of Kejin games (the games which are free to get and play, but some items or characters are unavailable unless you pay for it) appeared. For example, Love Live, Kankore, Puzzle & Dragon,

F. Expected diameter of a tree time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Pasha is a good student and one of MoJaK’s best friends. He

D. Two Melodies time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Alice is a beginner composer and now she is ready to create another master

F. Cities Excursions time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output There are n cities in Berland. Some pairs of them are connected with

Land of FarmsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 526 Accepted Submission(s): 174 Problem Description Farmer John and his broth

The merchant Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 5160 Accepted: 1776 DescriptionThere are N cities in a country, and there is one and only one simple path between eac

happy happy happyTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 299 Accepted Submission(s): 86Problem Description Today, Bob plays with a

Turning in Homework Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 1172 Accepted: 519 DescriptionBessie must turn in her homework for her C classes (1 <= C <= 1,000) at Moo U so

I: Colored Graph time limit 1000ms memory limit 131072KB In graph theory, graph colouring is a special case of graph labelling. It is an assignment of labels traditionally called colours to edges