10908 - Largest Square

[tan_Yui]

my output is 1 ?
is there any wrong ?

Are you SRX. ?
If so, your code outputs 7, but correct answer is 1.

Thank you.

[tan_Yui]

but I excute my code and my output is 1

Oh, really? Your code outputs 7 in my PC.
I try to check my environment....

Thank you.

[tan_Yui]

I checked your code again and found the bug.
You have forgotten to initialize a boolean value, so your code outputs wrong answer in my PC.
Change to like following, you will get Accepted.

for ( mymin=ans, check = false ; mymin && !check ; mymin-- ){

Best regards.

[Observer]

Hi,

Your code gets Compile Error because you cannot use "result" as a variable name in FreePascal. Change that and you'll get Accepted.

Have fun!

P.S. Why are there so many "Guests" recently? Something wrong with the board??

[FAQ]

nice, thanks a lot, I got AC
yesterday I didn't give my password when posting => "Guest", now I can't edit that post too :-S
So how can I delete the source code now ?

[CodeMaker]

one input/output match is no big deal, specially if it is sample I/O. judge data has 1000's of inputs. most of the time sample I/O is not present in judge data. Once my friend got Accepted in a problem in contest which even doesn't match sample I/O so, keep making more I/O to test ur code.

here i am giving some I/O for you, test by them.....

input:

Code: Select all

5
7 10 5
abbbabaaaa
abbbaaaaaa
abbbbaaaaa
baabbaaaaa
aaaaaaaaaa
aaccaaaaaa
aaccaaaaaa
1 2
2 4
4 6
6 3
4 7
1 1 1
a
0 0
0 0 0
5 5 3
AAAAA
ABABA
ABABA
ABABA
AAAAA
2 2
0 0
1 1
20 30 5
111111111222222222333333311111
111111111112222233333311111444
111222111111122222222222111133
222222222222222222222222222222
333333312222222221111111111111
333333333332222222222222211111
333333311112222224444411111111
333333333332222244444411111111
333333311112222244444444444444
333333333322222224444444444443
333333333332222244444411111111
333333311112222244444444444444
333333333322222224444444444443
111111111111111111111111111111
111111111111111111111111111122
111111333311111111111111111122
111111333311111333333333333333
111111333311111111111111111111
111111333311111111111111111111
111111333311111111111111111111
1 1
8 3
17 8
7 20
5 13



output:

Code: Select all

7 10 5
3
1
3
1
5
1 1 1
1
0 0 0
5 5 3
1
1
1
20 30 5
3
7
3
3
5


[d12ag0n]

could anyone give me some critical test cases.
I got WA with my code ...
here is my code ....

Code: Select all

#include <stdio.h>

int n,x,y,q,i,r,c,rad;
char map[105][105];

int main()
{
#ifndef ONLINE_JUDGE
   freopen("10908.in","r",stdin);
   freopen("10908.out","w",stdout);
#endif
   scanf("%d",&n);
   while (n)
   {
      scanf("%d %d %d\n",&y,&x,&q);
      for (i=0;i<y;i++) gets(map[i]);
      printf("%d %d %d\n",y,x,q);
      while (q)
      {
         scanf("%d %d",&r,&c);
         rad=1;
         while (1)
         {
            if (r<rad||r+rad==y||c<rad||c+rad==x) break;
            for (i=0;i<(rad<<1)+1;i++)
               if (map[r-rad][c-rad+i]!=map[r][c] || map[r+rad][c-rad+i]!=map[r][c]) break;
            if (i<(rad<<1)+1) break;
            for (i=0;i<(rad<<1)-1;i++)
               if (map[r-rad+i][c-rad]!=map[r][c] || map[r-rad+i][c+rad]!=map[r][c]) break;
            if (i<(rad<<1)-1) break;
            rad++;
         }
         printf("%d\n",((rad-1)<<1)+1);
         q--;
      }
      n--;
   }
   return 0;
}

[d12ag0n]

i'm getting WA with my code ...
my code have passed the test case above ...
could anyone help me ???

here is my code

Code: Select all

#include <stdio.h>

int n,x,y,q,i,r,c,rad;
char map[105][105];

int main()
{
#ifndef ONLINE_JUDGE
   freopen("10908.in","r",stdin);
   freopen("10908.out","w",stdout);
#endif
   scanf("%d",&n);
   while (n)
   {
      scanf("%d %d %d\n",&y,&x,&q);
      for (i=0;i<y;i++) gets(map[i]);
      printf("%d %d %d\n",y,x,q);
      while (q)
      {
         scanf("%d %d",&r,&c);
         rad=1;
         while (1)
         {
            if (r<rad||r+rad==y||c<rad||c+rad==x) break;
            for (i=0;i<(rad<<1)+1;i++)
               if (map[r-rad][c-rad+i]!=map[r][c] || map[r+rad][c-rad+i]!=map[r][c]) break;
            if (i<(rad<<1)+1) break;
            for (i=0;i<(rad<<1)-1;i++)
               if (map[r-rad+i][c-rad]!=map[r][c] || map[r-rad+i][c+rad]!=map[r][c]) break;
            if (i<(rad<<1)-1) break;
            rad++;
         }
         printf("%d\n",((rad-1)<<1)+1);
         q--;
      }
      n--;
   }
   return 0;
}

that is my posting ... i forgot to login first ...
could anyone help me with this problem ... ???

[tan_Yui]

Hi, d12ag0n.
Try to use this input.

Input :

1
15 15 12
bbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb
bbgbgbbbbbbbbbb
bbbgbbbbbbbbbbb
bbgbgbbbbbbbbbb
bbbbbbbbbbbbbbb
bbbbbbxbxbbbbbb
bbbbbbbbbbbbbbb
bbbbbbxbxbbbbbb
bbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb
bbbbbbbbbbbbbbb
6 7
8 7
7 6
7 7
7 8
6 6
3 3
9 5
1 1
3 3
10 11
4 10

Output should be :

15 15 12
1
1
1
1
1
1
1
1
1
1
5
3

Best regards.

[d12ag0n]

thank you tan_Yui.
I have found my stupid mistake.
I got AC ...

[sumankar]

I checked all available threads for this one. My code seems to give correct output for all of them.
Can I get some more test cases?

I would like to know as well if the input is well formed i.e. can there be spaces in between a particular row description?

Regards,
Suman.

[mamun]

can there be spaces in between a particular row description?

Nope.

Input

Code: Select all

1
7 7 8
aaaaaaa
aabbbaa
abbbbba
abbbbba
abbbbba
aabbbaa
aaaaaaa
3 3
2 3
4 2
5 2
0 0
6 6
4 4
5 5

Output

Code: Select all

7 7 8
3
3
1
1
1
1
1
1

[sumankar]

Thanks mamun for your test case. But still getting correct answers at home, and a WA at uva!

[Emilio]

Maybe this test cases can be interesting:

Code: Select all

2
7 10 4
abbbaaaaaa
a bbaaaa a
abbbaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaccaaaaaa
aaccaaaaaa
1 2
2 4
4 6
5 2
1 1 1
a
7 8


[sumankar]

Code: Select all

7 10 4
1
1
5
1
1 1 1
0