QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#686542#7733. Cool, It’s Yesterday Four Times MoreKafuuChinocpp#WA 50ms7948kbC++144.0kb2024-10-29 14:08:582024-10-29 14:08:58

Judging History

你现在查看的是最新测评结果

  • [2024-10-29 14:08:58]
  • 评测
  • 测评结果:WA
  • 用时:50ms
  • 内存:7948kb
  • [2024-10-29 14:08:58]
  • 提交

answer

#include <cstdio>
#include <algorithm>
#include <queue>

using namespace std;

const int max1 = 1e3;

int T, n, m;
char Map[max1 + 5][max1 + 5], tmp[max1 + 5][max1 + 5];
int sum[max1 + 5][max1 + 5];
int L[max1 + 5], R[max1 + 5];

queue < pair <int, int> > que;
bool vis[max1 + 5][max1 + 5];

void Bfs ( int x, int y )
{
    for ( int i = 1; i <= n; i ++ )
        L[i] = m, R[i] = 0;

    for ( int i = 1; i <= n; i ++ )
        for ( int j = 1; j <= m; j ++ )
            vis[i][j] = false;

    vis[x][y] = true;
    que.push(make_pair(x, y));
    while ( !que.empty() )
    {
        pair <int, int> now = que.front();
        que.pop();

        L[now.first] = min(L[now.first], now.second);
        R[now.first] = max(R[now.first], now.second);

        --now.first;
        if ( now.first >= 1 && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        ++now.first;

        ++now.first;
        if ( now.first <= n && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        --now.first;

        --now.second;
        if ( now.second >= 1 && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        ++now.second;

        ++now.second;
        if ( now.second <= m && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        --now.second;
    }
    return;
}

bool Check ( int i, int j )
{
    int down = n + 1, up = 0;
    for ( int k = 1; k <= n; k ++ )
    {
        if ( L[k] <= R[k] )
        {
            down = min(down, k);
            up = max(up, k);
            L[k] -= j;
            R[k] -= j;

            // printf("i = %d j = %d k = %d L = %d R = %d\n", i, j, k, L[k], R[k]);
        }
    }

    // printf("up = %d down = %d\n", up, down);

    up -= i;
    down -= i;
    for ( int x = 1; x <= n; x ++ )
    {
        for ( int y = 1; y <= m; y ++ )
        {
            if ( (x != i || y != j) && Map[x][y] == '.' )
            {
                bool flag = true;
                if ( x + down >= 1 && x + up <= n )
                {
                    for ( int k = down; k <= up; k ++ )
                    {
                        // printf("x : %d y : %d %d\n", x + k, L[k + i] + y, R[k + i] + y);
                        if ( L[k + i] + y < 1 || R[k + i] + y > m || sum[x + k][R[k + i] + y] - sum[x + k][L[k + i] + y - 1] )
                            flag = false;
                    }
                }
                else
                    flag = false;
                
                // if ( flag )
                //     printf("x = %d y = %d\n", x, y);
                
                if ( flag )
                    return false;
            }
        }
    }
    return true;
}

void Work ()
{
    scanf("%d%d", &n, &m);
    for ( int i = 1; i <= n; i ++ )
        scanf("%s", Map[i] + 1);
    
    if ( n > m )
    {
        for ( int i = 1; i <= n; i ++ )
            for ( int j = 1; j <= m; j ++ )
                tmp[i][j] = Map[i][j];
        for ( int i = 1; i <= n; i ++ )
            for ( int j = 1; j <= m; j ++ )
                Map[j][i] = tmp[i][j];
        swap(n, m);
    }

    for ( int i = 1; i <= n; i ++ )
    {
        sum[i][0] = 0;
        for ( int j = 1; j <= m; j ++ )
            sum[i][j] = sum[i][j - 1] + (Map[i][j] == 'O');
    }

    int ans = 0;

    for ( int i = 1; i <= n; i ++ )
    {
        for ( int j = 1; j <= m; j ++ )
        {
            if ( Map[i][j] == '.' )
            {
                Bfs(i, j);
                ans += Check(i, j);
            }
        }
    }

    printf("%d\n", ans);
    return;
}

int main ()
{
    scanf("%d", &T);
    while ( T -- )
        Work();

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3812kb

input:

4
2 5
.OO..
O..O.
1 3
O.O
1 3
.O.
2 3
OOO
OOO

output:

3
1
0
0

result:

ok 4 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 7884kb

input:

200
2 4
OOO.
OO..
2 3
OOO
.O.
3 3
O.O
OOO
OO.
4 1
.
.
O
O
1 2
.O
1 1
.
2 5
.OO..
.O.O.
2 1
O
O
1 1
O
1 3
.OO
5 1
O
O
.
O
.
5 2
O.
..
O.
.O
..
5 3
...
...
.OO
..O
OOO
3 5
..O.O
.O.O.
.OO.O
5 2
.O
OO
O.
O.
..
2 1
O
O
3 5
.O.OO
O...O
..OO.
1 5
.....
5 1
O
.
O
.
.
5 3
OOO
OO.
.OO
OO.
O.O
2 1
O
.
5 2
O.
...

output:

3
0
0
2
1
1
3
0
0
1
0
7
9
4
4
0
6
5
2
0
1
6
4
5
2
0
0
5
3
3
1
4
1
0
7
5
2
3
7
3
0
6
2
2
2
0
4
6
6
3
3
2
3
5
2
1
0
3
3
4
4
2
2
0
7
6
4
8
5
3
2
5
2
1
2
1
4
0
0
2
5
1
4
6
6
1
6
2
2
3
4
5
2
1
0
1
9
3
4
11
0
3
2
1
0
0
4
3
1
4
3
8
3
0
3
6
2
5
1
3
3
4
0
2
11
2
2
4
0
4
4
6
2
1
2
3
0
5
0
16
4
3
2
6
0
8
3
3
1...

result:

ok 200 lines

Test #3:

score: 0
Accepted
time: 2ms
memory: 5856kb

input:

50
10 9
OOOO.O...
O...O.OOO
.....O...
..OO..O.O
...O..O.O
..OOO..O.
..OOO...O
.OO.O..OO
.O.O.OO..
.O..O.O.O
10 10
.O.OOO.OO.
...OOOOOOO
...O.O..O.
.O.O..O...
.O.O.OO..O
..OO.O..OO
O....O..OO
OO...OOOOO
OO.OO.O..O
.O.O.OOOOO
10 8
O..OOO.O
O.OOOO..
O..OO.OO
OO..OO..
.OOO..O.
.OO.OO.O
OOO..OO.
..O..OO....

output:

31
40
13
25
40
37
27
29
20
26
25
29
21
29
21
31
32
31
33
34
25
31
18
25
41
28
20
45
20
29
18
21
27
28
35
13
20
17
32
29
28
23
23
23
24
18
28
17
35
24

result:

ok 50 lines

Test #4:

score: 0
Accepted
time: 6ms
memory: 6192kb

input:

5
1 1000
....O..OO..O..O..OO...OOO.OOOO.O...O....OOOOO.....OO..OOOO.O..O....OOOO..OO..OOOO......O.O.O..O..OO.OO.OO.O....O.O.O.O.O.OO..O.O.OO..O..OO..O.OOO...O...O.O.O..O....O.OO...O..O...O.OOO..OO.O..O.OO.O.O..OOOO..O.OO.O.O....O.OO.......OOOO....O.O.O.O..OOO.O.OO.OOO..O...O.O.O.O.OO.O.OOOO...O.OO.....

output:

7
380
294
373
291

result:

ok 5 lines

Test #5:

score: 0
Accepted
time: 1ms
memory: 6136kb

input:

200
1 1
.
2 5
OOOO.
OOOOO
3 2
O.
O.
OO
3 1
O
.
O
3 2
..
OO
OO
1 5
...OO
3 5
OOOOO
OOOOO
OOO.O
4 3
OOO
OOO
OO.
OO.
1 3
O.O
3 1
O
.
.
1 2
O.
3 3
OOO
O..
...
5 4
O.OO
..OO
O.OO
OOOO
OOOO
2 2
O.
OO
3 2
OO
OO
O.
4 4
OOO.
OO..
OO.O
...O
1 4
.OOO
4 3
O..
OOO
OOO
OOO
4 1
O
.
.
O
3 2
O.
OO
OO
5 3
OO.
OOO
OOO...

output:

1
1
2
1
2
3
1
2
1
2
1
5
4
1
1
7
1
2
2
1
1
6
0
1
1
5
1
1
2
1
3
8
1
2
1
3
2
10
4
1
3
1
2
1
1
1
1
1
2
1
1
2
2
4
3
1
2
7
4
1
4
1
1
1
2
1
2
1
7
1
1
1
1
1
3
1
1
2
4
1
4
1
1
1
1
1
1
1
1
1
3
7
1
1
2
5
1
3
7
1
9
2
9
4
4
0
12
6
4
6
2
0
8
6
3
4
16
5
4
5
2
7
1
0
0
1
4
2
9
0
2
3
7
6
13
7
10
11
4
2
13
5
8
8
0
16
...

result:

ok 200 lines

Test #6:

score: 0
Accepted
time: 3ms
memory: 6168kb

input:

50
7 9
OOOOOOO..
OOOOOOO..
OOO....OO
....OO..O
.O...OOOO
.....OOOO
OO...OOOO
8 8
.OO.O...
.O......
OOO.OOOO
OO..OOOO
..O.OO.O
O...OOOO
O..OOOOO
O..OOOOO
9 8
OO....OO
OO..OOOO
O..OOOOO
..O..OOO
.....O..
.....O..
OOOOOOOO
OOOOOOOO
.OOOOOOO
8 10
.O.OOOOOOO
...OO.OOOO
......OOOO
O..O....OO
O..OOO.O.O
O....

output:

22
23
22
35
33
15
21
23
24
16
29
15
29
40
23
30
6
25
37
23
25
33
19
12
34
43
44
21
51
29
35
67
22
53
33
53
32
46
50
48
42
45
31
46
45
30
48
53
54
43

result:

ok 50 lines

Test #7:

score: 0
Accepted
time: 4ms
memory: 6180kb

input:

5
1 1000
OO.OOO....O..OOOO..OOOOOOOOOOOOOOOOOOOOOOOOOOOO..OOOOOOOOOOO....OOOOOOOOOOOO...OO.OOOOOOOOOOOO.OOOOOOO....OOOOOOO......OOOOOOOOOOOOOOOOOOOOOOOO..OOO.O.OO..OO....OOOOOOOOO.OO.OOOOO.OOOOOOO....OOOOOOOO.OOOOO...OOOOOOOOOOOOOOOO.OOOOOOOOOOOOOOOOO.OOOOOOOOOOOOOOOOOOOOOOOOOOOO..OOOOOOOOOOOOOOOO.....

output:

0
355
363
384
280

result:

ok 5 lines

Test #8:

score: 0
Accepted
time: 12ms
memory: 6152kb

input:

5
1 1000
O.O...O................OOOO........OO..........OOOO....OO...O...OO....O...OO...O.............OOOOOO......................OOO......OO..........O...............O........................OO....................O..........O..........OO.......OOOO.O..OO...OOO....O.................................O...

output:

34
458
503
370
493

result:

ok 5 lines

Test #9:

score: 0
Accepted
time: 50ms
memory: 3816kb

input:

5
1 1000
O......OOO..O..OO.OO..................................................................................................................................................................................................................................................................................

output:

966
963
971
965
963

result:

ok 5 lines

Test #10:

score: 0
Accepted
time: 20ms
memory: 3848kb

input:

5
5 200
........................................................................................................................................................................................................
.....OO...OO.OO.O..O..O.OO.OO.OOO.O.OOO...OO.OO...O.O.OO.O.O...OO..OOO..OOOOOOO.OO.O..O.O.O...

output:

508
502
508
499
506

result:

ok 5 lines

Test #11:

score: 0
Accepted
time: 29ms
memory: 7948kb

input:

5
2 500
.....................................................................................................................................................................O.................................................................................................................................

output:

996
994
992
990
988

result:

ok 5 lines

Test #12:

score: 0
Accepted
time: 28ms
memory: 4076kb

input:

5
2 500
.........................................................................................................................................................................................................................................................O.............................................

output:

997
995
993
991
989

result:

ok 5 lines

Test #13:

score: 0
Accepted
time: 24ms
memory: 6164kb

input:

5
333 3
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
.O.
...

output:

667
667
667
667
667

result:

ok 5 lines

Test #14:

score: 0
Accepted
time: 14ms
memory: 7904kb

input:

5
200 5
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O.
.O.O...

output:

401
401
401
401
401

result:

ok 5 lines

Test #15:

score: 0
Accepted
time: 11ms
memory: 6116kb

input:

5
3 333
.......................................................................................................................................................................................................................................................................................................

output:

333
333
333
333
333

result:

ok 5 lines

Test #16:

score: 0
Accepted
time: 1ms
memory: 6336kb

input:

5
2 500
O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O....

output:

0
0
0
0
0

result:

ok 5 lines

Test #17:

score: -100
Wrong Answer
time: 12ms
memory: 7928kb

input:

5
6 160
...O..O......O...O..O......O......O.O.O..O......O......O......O......O......O.....OO.O.O..O...O..O..O...O.OO..OO......O....O.O.....OO......O....O.OO..OO.O......
.O....O......O.O....O......O......O...OO.O......O.O.O..O......O......O......O......O......OO...O.O.OO...O......O......O......OO.......

output:

36
692
743
763
682

result:

wrong answer 2nd lines differ - expected: '570', found: '692'