### I_love_tigersugar's blog

By I_love_tigersugar, 6 years ago, ,

Is there anything wrong with CF? Many submissions are in queue now.

• +28

By I_love_tigersugar, 6 years ago, ,

Today in Codeforces Round #244 (Div. 2), I found that there were too many test cases in problems C,D,E.

Problem C and E have more than 100 tests each, and problem D has about 170 tests.

As a result, the system testing phase become very slow.

Do you think that it is necessary to create such many tests? In my opinion, having more than 100 test cases doesn't make the test stronger.

• +38

By I_love_tigersugar, 6 years ago, ,

Given N distinct points on the plane. Find the pair of point with the smallest (and largest) Euclid distance between them.

I only know the Brute-Force O(n^2) algorithm to solve this.

Can someone give me any faster algorithm?

• +14

By I_love_tigersugar, 6 years ago, ,

Given a network G=(V,E) with s and t being the source and the sink of G, respectively.

For each edge (u,v), there are two numbers c(u,v) and d(u,v). They represent the minnimum and the maximum amount of flow that can pass through the edge (u,v), respectively. I.e, the flow of edge (u,v) f(u,v) must satisfies: c(u,v)<=f(u,v)<=d(u,v).

How can I find the maximum flow from s to t?

• +5

By I_love_tigersugar, 6 years ago, ,

It's about 2 months after MemSQL start[c]up Round 2, but I have not received T-shirt. Has anyone received it? Does anyone know something about it? I'm sorry if someone finds my topic annoying but it is my very first gift/souvenir about Codeforces, so this is quite important to me to be sure about it. Regards.