2017年10月_楚江枫

原创【Lightoj 1251 Forming the Council】& Tarjan & 2 - SAT

In a city there are n voters, and m people formed the Govt. council. The council members are numbered from 1 to m. Now everyone is complaining that the council is biased. So, they made a plan. The plan

2017-10-17 08:45:24 463

原创【Codeforces B. Balanced Substring】

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

2017-10-12 23:19:01 1265

原创【Lightoj 1063 - Ant Hills】& 割点

After many years of peace, an ant-war has broken out.In the days leading up to the outbreak of war, the ant government devoted a great deal of resources toward gathering intelligence on ant hills. It d

2017-10-12 20:19:34 709

原创【Lightoj 1026 B Critical Links】& 桥

In a computer network a link L, which interconnects two servers, is considered critical if there are at least two servers A and B such that all network interconnection paths between A and B pass throug

2017-10-12 14:24:03 417

原创【UVA 10034 Freckles】& Kruskal & 最小生成树

In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad’s back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley’s

2017-10-11 22:28:32 365

原创【UVA 10397 Connect the Campus】& 最小生成树 & Kruskal

Many new buildings are under construction on the campus of the University of Waterloo. The university has hired bricklayers, electricians, plumbers, and a computer programmer. A computer programmer?

2017-10-11 21:32:45 302

原创【Codeforces 869 C The Intriguing Obsession】& 组合数学 & 思维

C. The Intriguing Obsession time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output — This is not playing but duty as allies of justice, Nii-chan!—

2017-10-11 12:22:23 481

原创【HDU 5952 Counting Cliques】& DFS

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

2017-10-08 18:27:05 380

原创【HDU 6000 Wash】优先队列 & 贪心

WashTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 64000/64000 K (Java/Others) Total Submission(s): 1076 Accepted Submission(s): 283Problem Description Mr.Panda is about to engage in hi

2017-10-07 17:42:13 925

原创【HDU 5983 Pocket Cube】& 模拟

Pocket CubeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1075 Accepted Submission(s): 415Problem Description The Pocket Cube, also known

2017-10-07 11:46:03 526

原创【Codeforces 868 B. Race Against Time】& 模拟

B. Race Against Time time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Have you ever tried to explain to the coordinator, why it is eight ho

2017-10-06 11:51:22 344

原创【HDU 3376 Matrix Again】网络流 & 拆点 & 最大费用最大流

Matrix AgainTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others) Total Submission(s): 4444 Accepted Submission(s): 1292Problem Description Starvae very like play a

2017-10-06 09:31:40 712

原创【POJ 2135 Farm】网络流 & 最小费用最大流

Farm Tour Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17964 Accepted: 6949 DescriptionWhen FJ’s friends visit him on the farm, he likes to show them around. His farm compr

2017-10-04 16:56:26 320

原创【POJ 1149 PIGS】网络流 & 合并节点简化构图 & Dinic算法

PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21812 Accepted: 9975 DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can’t unlock any

2017-10-02 22:13:47 821

原创【UVA 673 Parentheses】 & 栈

You are given a string consisting of parentheses () and []. A string of this type is said to be correct: (a) if it is the empty string (b) if A and B are correct, AB is correct, (c) if A is correct,

2017-10-02 18:12:30 280

原创【POJ 2112 Optimal Milking】网络流 & 二分 & floyd

Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 18478 Accepted: 6594 Case Time Limit: 1000MS DescriptionFJ has moved his K (1 <= K <= 30) milking machines out

2017-10-02 16:35:54 345

原创【UVA 712 S-Tree】& 二叉树

A Strange Tree (S-tree) over the variable set Xn = {x1, x2, … , xn} is a binary tree representing a Boolean function f : {0, 1} n → {0, 1}. Each path of the S-tree begins at the root node and consist

2017-10-01 20:38:28 778

原创【UVA 548 Tree】二叉树构造 & 遍历

You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum o

2017-10-01 18:55:44 662

原创【POJ 3436 ACM Computer Factory】网络流 & 拆点 & Dinic

ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8323 Accepted: 3027 Special Judge DescriptionAs you know, all the computers used for ACM contests must b

2017-10-01 17:06:12 895

楚江枫