QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#643277#7733. Cool, It’s Yesterday Four Times MoreSunwkingTL 626ms36436kbC++202.9kb2024-10-15 20:19:322024-10-15 20:19:33

Judging History

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

  • [2024-10-15 20:19:33]
  • 评测
  • 测评结果：TL
  • 用时：626ms
  • 内存：36436kb
查看
  • [2024-10-15 20:19:32]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
using LL = long long;
using PII = pair<int , int>;

int dx[] = {-1 , 0 , 1 , 0};
int dy[] = {0 , 1 , 0 , -1};

void solved(){
    int n , m;
    cin >> n >> m;

    int s = 0;
    vector<string> a(n);
    for(int i = 0 ; i < n ; i ++ )
        cin >> a[i];

    for(int i = 0 ; i < n ; i ++ )
        for(char c : a[i])
            s += (c == '.');

    map<array<int , 4> , bool> mp;
    map<array<int , 4> , bool> vis;

    queue<array<int , 4>> q;
    for(int i = 0 ; i < n ; i ++ )
        for(int j = 0 ; j < m ; j ++ )
            for(int i1 = 0 ; i1 < n ; i1 ++ )
                for(int j1 = 0 ; j1 < m ; j1 ++ ) {
                    if(i == i1 && j == j1) continue;
                    if(a[i][j] != '.' || a[i1][j1] != '.')
                        continue;
                    for(int k = 0 ; k < 4 ; k ++ ){
                        int ii = i + dx[k] , jj = j + dy[k];
                        int ii1 = i1 + dx[k] , jj1 = j1 + dy[k];
                        if(ii < 0 || ii == n || jj < 0 || jj == m || a[ii][jj] == 'O')
                            continue;
                        if(ii1 < 0 || ii1 == n || jj1 < 0 || jj1 == m || a[ii1][jj1] == 'O') {
                            q.push({i, j, i1, j1}), mp[{i, j, i1, j1}] = true;
//                            cout << i << " " << j << " " << i1 << " " << j1 << endl;
                            break;
                        }
                    }
                }

    while(!q.empty()){
        auto [i , j , i1 , j1] = q.front();
        q.pop();

        for(int k = 0 ; k < 4 ; k ++ ){
            int ii = i + dx[k] , jj = j + dy[k];
            int ii1 = i1 + dx[k] , jj1 = j1 + dy[k];
            if(ii < 0 || ii == n || jj < 0 || jj == m || a[ii][jj] == 'O')
                continue;

            if(ii1 < 0 || ii1 == n || jj1 < 0 || jj1 == m || a[ii1][jj1] == 'O')
                continue;
            if(mp.count({ii , jj , ii1 , jj1}))
                continue;
            q.push({ii , jj , ii1 , jj1});
            mp[{ii , jj , ii1 , jj1}] = true;
        }
    }

//    for(auto [x , y] : mp)
//        for(int i = 0 ; i < 4 ; i ++ )
//            cout << x[i] << " \n"[i == 3];
    int ans = 0;
    for(int i = 0 ; i < n ; i ++ )
        for(int j = 0 ; j < m ; j ++ ) {
            if(a[i][j] == 'O') continue;
            int sum = 0;
            for (int ii = 0; ii < n; ii++)
                for (int jj = 0; jj < m; jj++) {
                    if(i == ii && j == jj) continue;
                    sum += mp[{i , j , ii , jj}];
                }
            if(sum == s - 1)
                ans ++;
        }
    cout << ans << "\n";
}

int main() {

//     freopen("D:\\dev\\code\\sunwking\\1.in" , "r" , stdin);

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;

    while(t -- )
        solved();

    return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3ms
memory: 3580kb

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: 34ms
memory: 4124kb

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: 626ms
memory: 36436kb

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: 3ms
memory: 3664kb

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: 46ms
memory: 4260kb

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: 509ms
memory: 30996kb

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: -100
Time Limit Exceeded

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:

result:
English 繁體中文 简体中文

Server Time: 2024-12-03 20:48:26 | OpenSource Project