QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#258053#7733. Cool, It’s Yesterday Four Times MoreSSH#RE 31ms6872kbC++203.0kb2023-11-19 14:41:582023-11-19 14:41:59

Judging History

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

  • [2023-11-19 14:41:59]
  • 评测
  • 测评结果：RE
  • 用时：31ms
  • 内存：6872kb
查看
  • [2023-11-19 14:41:58]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int mod = 998244353;
void solve();
signed main(){
	cin.sync_with_stdio(false);
	cin.tie(0);
	int T=1;
	cin>>T;
	while(T--){
		solve();
	}
	return 0;
}
#define N 5050
bitset<N> st[N];
char g[N];
int n,m,X[4]={0,0,1,-1},Y[4]={1,-1,0,0};
map<pair<int,int>,int>mp;
int idx;
int getid(int x,int y){
    return x*(m+2)+y+3500;
}
void solve(){
    idx=0;
    mp.clear();
    cin>>n>>m;
    for(int i=0;i<=n+1;i++){
        for(int j=0;j<=m+1;j++){
            g[getid(i,j)]='O';
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>g[getid(i,j)];
        }
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(g[getid(i,j)] != 'O'){
                cnt++;
                queue<pair<int,int>> q;
                q.push({0,0});
                set<pair<int,int>> vis;
                while(q.size()){
                    auto [dx,dy]=q.front();
                    q.pop();
                    if(vis.count({dx,dy}))continue;
                    vis.insert({dx,dy});
                    if(g[getid(i+dx,j+dy)]=='O'){
                        st[getid(dx,dy)].set(getid(i,j),1);
                        continue;
                    }
                    for(int k=0;k<4;k++){
                        int ndx=dx+X[k];
                        int ndy=dy+Y[k];
                        if(vis.count({ndx,ndy})==false){
                            q.push({ndx,ndy});
                        }
                    }
                }
            }
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            
            if(g[getid(i,j)]!='O'){
                bitset<N> nt;
                queue<pair<int,int>> q;
                q.push({0,0});
                set<pair<int,int>> vis;
                while(q.size()){
                    if(nt.count()==cnt-1){
                        ans++;
                        break;
                    }
                    auto [dx,dy]=q.front();
                    q.pop();
                    if(vis.count({dx,dy}))continue;
                    vis.insert({dx,dy});
                    if(g[getid(i+dx,j+dy)]=='O'){
                        continue;
                    }
                    else{
                        nt|=st[getid(dx,dy)];
                        if(nt.count()==cnt-1){
                            ans++;
                            break;
                        }
                    }
                    for(int k=0;k<4;k++){
                        int ndx=dx+X[k];
                        int ndy=dy+Y[k];
                        if(vis.count({ndx,ndy})==false){
                            q.push({ndx,ndy});
                        }
                    }
                }
                
            }
            
        }
    }
    cout<<ans<<"\n";
    for(int i=0;i<N;i++){
        st[i].reset();
    }
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 31ms
memory: 6872kb

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: 15ms
memory: 6656kb

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: -100
Runtime Error

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:

result:
English 繁體中文 简体中文

Server Time: 2024-12-05 10:06:38 | OpenSource Project