QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#591071#7733. Cool, It’s Yesterday Four Times Morebruteforce_TL 23ms3776kbC++201.2kb2024-09-26 13:57:172024-09-26 13:57:17

Judging History

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

  • [2024-09-26 13:57:17]
  • 评测
  • 测评结果:TL
  • 用时:23ms
  • 内存:3776kb
  • [2024-09-26 13:57:17]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
vector<vector<bool>> mp;
int n,m;
bool solve(int ax,int ay,int bx,int by)
{
	vector vis(n+2,vector<bool>(m+2));
	queue<array<int,4>> q;
	q.push({ax,ay,bx,by});
	vis[ax][ay]=1;
	while(!q.empty())
	{
		auto [x,y,bx,by]=q.front(); q.pop();
		for(int i=0; i<=3; i++)
		{
			int nx=x+dx[i],ny=y+dy[i],nbx=bx+dx[i],nby=by+dy[i];
			if(vis[nx][ny]||mp[nx][ny]==0) continue;
			if(mp[nbx][nby]==0) return 1;
			q.push({nx,ny,nbx,nby});
			vis[nx][ny]=1;
		}
	}
	return 0;
}
void O_o()
{
	cin>>n>>m;
	mp.assign(n+2,vector<bool>(m+2,0));
	vector<array<int,2>> a;
	for(int i=1; i<=n; i++)
	{
		string s;
		cin>>s;
		for(int j=0; j<m; j++)
		{
			if(s[j]=='.')
			{
				mp[i][j+1]=1;
				a.push_back({i,j+1});
			}
				
		}
	}
	int ans=0;
	for(int i=0; i<a.size(); i++)
	{
		bool bz=1;
		for(auto j=0; j<a.size(); j++)
		{
			if(i==j) continue;
			if(!solve(a[i][0],a[i][1],a[j][0],a[j][1]))
			{
				bz=0;
				break;
			}
		}
		ans+=bz;
	}
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cout<<fixed<<setprecision(12);
	int T=1;
	cin>>T;
	while(T--)
	{
		O_o();
	}
}

详细

Test #1:

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

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: 2ms
memory: 3776kb

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: 23ms
memory: 3560kb

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

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: