QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#318741#7733. Cool, It’s Yesterday Four Times Moreamirhoseinfar1385#TL 62ms7180kbC++231.4kb2024-01-31 18:52:192024-01-31 18:52:20

Judging History

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

  • [2024-01-31 18:52:20]
  • 评测
  • 测评结果:TL
  • 用时:62ms
  • 内存:7180kb
  • [2024-01-31 18:52:19]
  • 提交

answer

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000+10;
int all[maxn][maxn],n,m,vis[maxn][maxn],vis2[maxn][maxn];
void clear(){
	for(int i=0;i<=n+5;i++){
		for(int j=0;j<=m+5;j++){
			all[i][j]=0;
			vis[i][j]=0;
		}
	}
}

int cmp(int i,int j,int ii,int jj){
	if(all[i][j]==0||vis2[i][j]){
		return 1;
	}
	if(all[i][j]!=all[ii][jj]){
		return 0;
	}
	vis2[i][j]=1;
	int ret=(cmp(i-1,j,ii-1,jj)&cmp(i+1,j,ii+1,jj)&cmp(i,j-1,ii,jj-1)&cmp(i,j+1,ii,jj+1));
	vis2[i][j]=0;
	return ret;
}

int ted(int i,int j){
	if(all[i][j]==0||vis[i][j]==1){
		return 0;
	}
	vis[i][j]=1;
	return ted(i-1,j)+ted(i+1,j)+ted(i,j-1)+ted(i,j+1)+1;
}


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	for(int asd=0;asd<t;asd++){
		clear();
		cin>>n>>m;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				char c;
				cin>>c;
				if(c=='.'){
					all[i][j]=1;
				}
			}
		}
		int res=0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(vis[i][j]||all[i][j]==0){
					continue;
				}
				int te=ted(i,j);
				//cout<<i<<" "<<j<<" "<<te<<endl;
				int f=0;
				for(int ii=1;ii<=n;ii++){
					for(int jj=1;jj<=m;jj++){
						if(ii==i&&jj==j){
							continue;
						}
						if(cmp(i,j,ii,jj)){
							f=1;
						}
					}
				}
				if(f==0){
					res+=te;
				}
			}
		}
		cout<<res<<"\n";
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5760kb

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: 5780kb

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: 0ms
memory: 5840kb

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

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: 5720kb

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: 62ms
memory: 5832kb

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: 24ms
memory: 7000kb

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: