OJ Board

Hi,

This problems seems to be just a maximum flow problem but I cannot make it run in Time Limit. I tried 3 algorithms 1) Using breadth search 2) using depth search 3) preflux method. Still nothing .

How to do it in time limit ?

I make a graph of max 202 vertices. I double every regulator for ...

Try this test Your program says "YES"

I think Even is right for the following inputs


10
500
100 1
300 1
350 1
501 10

101
100 100
102 1

100

101

200
100 10

201
100 10

201
101 10

50
25 10

150
100 10
151 20

150
100 10
151 20
152 1




I get the results

970

301

Impossible

Impossible

2000 ...

Hi,

How to generate all prime numbers in interval 2-50.000.000 fastly ? I can do it in almost 8 sec but it's not enough.

Or how to solve the problem in 10 sec ?

I tried to get my program accepted but I couldnt.

I will write my idea, maybe it is wrong.

Consider the path consists of positions a1, a2, a3, .. an with a1=entrance. Suppose we delete position ai (it is the unknown wall) we have to reconstruct the path as a1, a2, a3 .. a(i-1) b1 b2 .. an. Sure ...

Hi. When I submit my program it gets WA. Can somebody check whether my program gives the correct answer for the following tests? Are there any tricky tests? Id appreciate any tests for checking my program


3
5 18
X..#.#............
.#.....##..#....#.
..#..#.#..#.#..#..
.#.##.##.#...##...
.....E ...

How to solve 301 in time 0.00

I've tried some kind of opptimized backtracking and it run for 4.661 sec.

How to make this time 0.00 ?

Is there any other method ?

How to solve 10385

Hello

I've tested all tests that were on the previous pages and all are correct. I don't understand why I get WA :x :x

[c]#include <stdio.h>
#include <memory.h>
#include <math.h>
#include <stdlib.h>

#define max 50000

typedef struct
{
float x,y;
} point;

int n, first, choosen, k, region=0, i ...