与‘图论-有向图强连通分量’有关的日志

poj3592

maksyuki 发表于 oj 分类,标签: ,
0
poj3592

Instantaneous Transference

It was long ago when we played the game Red Alert. There is a magic function for the game objects which is called instantaneous transfer. When an object uses this magic function, it will be transferred to the specified po >>继续阅读

poj1904

maksyuki 发表于 oj 分类,标签: ,
0
poj1904

King's Quest

Once upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did like. The sons of the king were young and light-headed, so it w >>继续阅读

poj3160

maksyuki 发表于 oj 分类,标签: ,
0
poj3160

Father Christmas flymouse

After retirement as contestant from WHU ACM Team, flymouse volunteered to do the odds and ends such as cleaning out the computer lab for training as extension of his contribution to the team. When Christmas came, flymouse >>继续阅读

poj1236

maksyuki 发表于 oj 分类,标签:
0
poj1236

Network of Schools

A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (the “receiving schools”). Note that if B is in >>继续阅读

poj2553

maksyuki 发表于 oj 分类,标签:
0
poj2553

The Bottom of a Graph

We will use the following (standard) definitions from graph theory. Let V be a nonempty and finite set, its elements being called vertices (or nodes). Let E be a subset of the Cartesian product V×V, its elements being called e >>继续阅读

poj2186

maksyuki 发表于 oj 分类,标签:
0
poj2186

Popular Cows

Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell you that cow A thinks that cow B i >>继续阅读

poj2762

maksyuki 发表于 oj 分类,标签: ,
0
poj2762

Going from u to v or from v to u?

In order to make their sons brave, Jiajia and Wind take them to a big cave. The cave has n rooms, and one-way corridors connecting some rooms. Each time, Wind choose two rooms x and y, and ask one of their little s >>继续阅读