Krydom: 暁の水平线に胜利を刻むのです

ソロモンの悪夢、見せてあげる!

@krydom2年前

08/21
19:49
最大流

Usaco93 Drainage Ditches [poj 1273]

00:00/00:00

IMG_1877   IMG_1875

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of drainage ditches so that Bessie's clover patch is never covered in water. Instead, the water is drained to a nearby stream. Being an ace engineer, Farmer John has also installed regulators at the beginning of each ditch, so he can control at what rate water flows into that ditch. Read More →

Usaco93 Drainage Ditches [poj 1273]

@krydom2年前

08/21
19:04
二分图匹配 最大流

Machine Schedule [poj 1325 zoj 1364]

00:00/00:00

大祭司 千秋万代 一统江湖! qwq qwq qwq

efa07f87e950352aab9ac3775543fbf2b3118baecf1f140fd9f9d72a3dcef662d22a2834359bbbff964528224f4a20a40eb4dab896529822730ed0ff

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

    As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that must be satisfied and the type of schedule desired. Here we consider a 2-machine scheduling problem. Read More →

Machine Schedule [poj 1325 zoj 1364]

@krydom2年前

08/21
18:31
主席树

Feed the dogs [poj 2761]

00:00/00:00

有没有wifi有没有wifi有而且耐用五毛勒!有没有wifi有没有wifi有而且耐用五毛勒!!

203fb80e7bec54e717bd766dbf389b504fc26a6b   m3xj2kmf5lajpg

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

 Wind loves pretty dogs very much, and she has n pet dogs. So Jiajia has to feed the dogs every day for Wind. Jiajia loves Wind, but not the dogs, so Jiajia use a special way to feed the dogs. At lunchtime, the dogs will stand on one line, numbered from 1 to n, the leftmost one is 1, the second one is 2, and so on. In each feeding, Jiajia choose an inteval[i,j], select the k-th pretty dog to feed. Read More →

Feed the dogs [poj 2761]

@krydom2年前

08/20
19:11
背包动规

[bzoj 1677] Usaco2008Jan Sumsets 求和

20131208173503_QxZGW   32fa828ba61ea8d3abec1bb0950a304e241f58b3

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

 Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that sum to 7: 1) 1+1+1+1+1+1+1 2) 1+1+1+1+1+2 3) 1+1+1+2+2 4) 1+1+1+4 5) 1+2+2+2 6) 1+2+4 Help FJ count all possible representations for a given integer N .给出一个N,使用一些2的若干次幂的数相加来求之.问有多少种方法

Read More →

[bzoj 1677] Usaco2008Jan Sumsets 求和

@krydom2年前

08/20
18:51
暴力 模拟

[bzoj 1622] Usaco2008Open World Power 名字的能量

00:00/00:00

20140722161627_vdUGm.thumb.700_0   005Is9Z6zy6Lvyr7O8C56

ps:lx学长问我虐题有意思吗QAQ 我只不过想提高排名而已QAQ 再说我这么弱QAQ 铁牌滚粗的人QAQ

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

     约翰想要计算他那N(1≤N≤1000)只奶牛的名字的能量.每只奶牛的名字由不超过1000个字待构成,没有一个名字是空字体串,  约翰有一张“能量字符串表”,上面有M(1≤M≤100)个代表能量的字符串.每个字符串由不超过30个字体构成,同样不存在空字符串.一个奶牛的名字蕴含多少个能量字符串,这个名字就有多少能量.所谓“蕴含”,是指某个能量字符串的所有字符都在名字串中按顺序出现(不一定一个紧接着一个). Read More →

[bzoj 1622] Usaco2008Open World Power 名字的能量

@krydom2年前

08/20
18:19
最大流

[bzoj 1280 poj 1149] Emmy卖猪pigs

00:00/00:00

20150113100124_2ns3S.thumb.700_0   20141221204942_42vSL.thumb.700_0

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

Emmy在一个养猪场工作。这个养猪场有M个锁着的猪圈,但Emmy并没有钥匙。顾客会到养猪场来买猪,一个接着一个。每一位顾客都会有一些猪圈的钥匙,他们会将这些猪圈打开并买走固定数目的猪。 所有顾客有的钥匙和他们需要买猪的数量在事先都告诉了Emmy,于是Emmy要订一个计划,使得卖出去的猪最多。 买卖的过程是这样的:一个顾客前来,并打开所有他可以打开的猪圈。 Read More →

[bzoj 1280 poj 1149] Emmy卖猪pigs

@krydom2年前

08/18
19:16
树状数组 线段树

Usaco2007Jan Balanced Lineup [bzoj 1636 1699 poj 3264]

00:00/00:00

  b7003af33a87e9506842c61e11385343fbf2b46e67b67855gw1e11cgpdmtrj

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

 For the daily milking, Farmer John's N cows (1 <= N <= 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguous range of cows from the milking lineup to play the game. However, for all the cows to have fun they should not differ too much in height.

Read More →

Usaco2007Jan Balanced Lineup [bzoj 1636 1699 poj 3264]

@krydom2年前

08/18
18:15
bfs

Usaco2004Jan 培根距离 [bzoj 3361]

00:00/00:00

3779644f74a2fb2841eef4269d44c53f  1430270426757

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

     贝茜和其他奶牛联系是通过一连串的中间奶牛传递的,所以当第一头牛和贝茜联系,第二头牛和第一头牛联系,第三头牛和第二头牛联系,…一贝茜就能依次联系到其中的每一头奶牛. 联系长度是指传递过程中涉及的奶牛的数目(不包括贝茜).任何一头奶牛(不包括贝茜)的培根距离是指从贝茜到该奶牛的最小联系长度.最小的培根距离是1(当贝茜能够直接与该奶牛联系时).约输有C头牛,编号1到C,贝茜是1号.有P组奶牛相互联系.请找到最大的培根距离.

Read More →

Usaco2004Jan 培根距离 [bzoj 3361]

@krydom2年前

08/17
17:40
并查集 离散化

[bzoj 4195] NOI2015 程序自动分析

20141229153836_VyBdh      174523rshddvlforez67do

 

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

在实现程序自动分析的过程中,常常需要判定一些约束条件是否能被同时满足。

    考虑一个约束满足问题的简化版本:假设x1,x2,x3,…代表程序中出现的变量,给定n个形如xi=xj或xi≠xj的变量相等/不等的约束条件,请判定是否可以分别为每一个变量赋予恰当的值,使得上述所有约束条件同时被满足。例如,一个问题中的约束条件为:x1=x2,x2=x3,x3=x4,x1≠x4,这些约束条件显然是不可能同时被满足的,因此这个问题应判定为不可被满足。
    现在给出一些约束满足问题,请分别对它们进行判定。

Read More →

[bzoj 4195] NOI2015 程序自动分析