Oops的博客

Food Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6626    Accepted Submission(s): 2250 Problem Description 　　You, a part-time dining

https://www.nowcoder.com/acm/contest/143/E 题意：有n个寝室，每个寝室有四个人，给你第一年和第二年住在一个寝室的人，问要让第一年变成第二年的样子最少需要多少学生换。 思路：把一个寝室当成两个点来看，分别为第一年和第二年的，然后暴力跑每个寝室这两年的学生不一样的个数乘2当做费用，然后用最小费用最大流做 代码： #include<bits/std...

C - A Plug for UNIX   You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the f

Marriage Match IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4780    Accepted Submission(s): 1432 Problem Description Do not since

Escape Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 11707    Accepted Submission(s): 2847 Problem Description 2012 If this is the en

Leapin' Lizards Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3289    Accepted Submission(s): 1352 Problem Description Your platoon o

Control Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3935    Accepted Submission(s): 1648 Problem Description 　　You, the head of Dep

Power Network Time Limit: 2000MS   Memory Limit: 32768K Total Submissions: 29460   Accepted: 15278 Description A power network consists of nodes (power stations, consum

Marriage Match II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4550    Accepted Submission(s): 1506 Problem Description Presumably,

The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbances this is causing in world economy, an imperialist military s

Island Transport Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 10240    Accepted Submission(s): 3292 Problem Description 　　In the v

Minimum Cost Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 17761   Accepted: 6243 Description Dearboy, a goods victualer, now comes to a big problem, and

第五次入围！——我校晋级第42届ACM国际大学生程序设计竞赛全球总决赛 Going Home Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6139    Accepted Submission(s): 32

Dining Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 20254   Accepted: 9009 Description Cows are such finicky eaters. Each cow has a preference for certa

ACM Computer Factory Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8672   Accepted: 3155   Special Judge Description As you know, all the computers use

http://acm.hdu.edu.cn/showproblem.php?pid=6437   题意： 一天有N个小时，有m个节目（每种节目都有类型），有k个人，连续看相同类型的节目会扣w快乐值 每一种节目有都一个播放区间[s,t]。每个人同一时间只能看一个节目，看完可以获得快乐值。问最多可以获得多少快乐？ 思路： 我们可以将每部电影拆成两个点来看，建立源点和汇点，还有次源点，因为要...