OJ Board

I got AC today, but with 8.889 seconds. I guess this would get TLE in competition, is that right?

To find a cycle, I do the following:

1. I flood fill the region beginning at some position and count the numbers of squares = numberOfElements;
2. I flood fill again, but this time I check if next ...

The tests posted by jaywinyeah:
aren't tested by the judge. The problem statement says that w, h are in the range [1, 75].

I represent the maze using 3x3 divisions for each slash mentioned above. But I got stuck in how to get the cicles. In order to find the cycles, I do the following:


maxLength=-1;
for(i=0; i<3*h; i++)
for(j=0; j<3*w; j++){
floodfill(i, j);
if(foundACycle==true){
ans++;
if(cycleLength>maxLength ...

Thank you tgoulart!
I got AC today! =D I was misusing the integral. I saw yor third figure and I figured out my error. With your third picture I got te third equation.
I'll explain how I solve this problem, since the equations given in previous codes in this forum are too hard to understand. Let's ...

I tried to get the equations above but I coudn't. I get 2 equations with 3 variables and I can't find the third one, to solve the system. So, I tried to integrate the equation sqrt(a^2 - x^2) + a, in the range (0, a/2), in order to get half of the square-lined area. After this integration, the ...

I did this problem using LIS but I get WA. I saw on board that LIS/Greedy based solutions don't work anymore. Could someone that solved this problem using another approach tell me some hints?
Thank you!

My solution to this problem run in 0.000 s and I didn't use DP. I just use a matrix to represent the streets and traverse it recursevely, counting a way everytime that it reaches the extreme point.

int ans=0;
int p[MAX][MAX];

void coutWays(int x, int y){
//if it reaches the station
if(x==l ...

little joey, My code is just like yours. In my function piece_fits_board() I do it justlike in a problem called "Graphical Editor". I traverse the board recursevely looking for a place to fit the piece. I search in all board, where there exists '*'.

I've tested all cases in this forum and my ...

please someone help me. I don't know what's wrong with my code. :-(
I'm getting crazy... I also considered diagonals... I wasn't doing that before.


#include<stdio.h>
#include<string.h>
#define MAX 50 + 1 + 1

int numCasos, N, M, S, n, m, cont, total;
char grid[MAX][MAX], bloco[MAX][MAX], visitado ...

What about of the following input:

1
3 6 1
......
......
......
3 3
...
...
...

What would be the output? Yes or No?

Thank you little joey. Could you give me some input/output examples?

Thx.

I did this problem but I keep getting WA. Could someone give some tricks inputs and outputs?
Can a piece be disconnected? I mean:
...*****..
..........
..........
....***...
?
Thanks in advance.

Hi!
Try to use the function memset. It is very fast to initialize arrays of chars. More information at http://www.cppreference.com/stdstring/memset.html
Hope it helps!

I used the same approach and I got AC.

Hi!
Could someone give me some input/output for this problem?

Thanks in advance!