QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#278279#7733. Cool, It’s Yesterday Four Times MoreSnowNorthWA 12ms8000kbC++141.9kb2023-12-07 14:33:502023-12-07 14:33:51

Judging History

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

  • [2023-12-07 14:33:51]
  • 评测
  • 测评结果:WA
  • 用时:12ms
  • 内存:8000kb
  • [2023-12-07 14:33:50]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

int n, m;
char G[1005][1005];
bool vis[1005][1005];
int dx[]{1, -1, 0, 0}, dy[]{0, 0, 1, -1};
vector<array<int, 2>> pos;

bitset<1005> b[1005][1005][4];

void dfs(int x, int y) {
	if (x < 0 || x >= n || y < 0 || y >= m || G[x][y] == 'O' || vis[x][y]) return ;
	vis[x][y] = true;
	pos.push_back({x, y});
	for (int i = 0; i < 4; i++) {
		dfs(x + dx[i], y + dy[i]);
	}
}

void add(int sx, int sy, int dir, int x, int y) {
	x = abs(x), y = abs(y);
	b[sx][sy][dir][x * n + y] = 1;
}

void solve() {
	cin >> n >> m;
	
	vector<array<int, 2>> all;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> G[i][j];
			if (G[i][j] != 'O') {
				vis[i][j] = false;
				for (int k = 0; k < 4; k++) b[i][j][k].reset();
				all.push_back({i, j});
			}
		}
	}
	
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (vis[i][j] || G[i][j] == 'O') continue ;
			pos.clear();
			dfs(i, j);
			
			for (auto e1 : pos) {
				for (auto e2 : pos) {
					int x = e2[0] - e1[0];
					int y = e2[1] - e1[1];
					if (x >= 0 && y >= 0) add(e1[0], e1[1], 0, x, y);
					if (x <= 0 && y >= 0) add(e1[0], e1[1], 1, x, y);
					if (x <= 0 && y <= 0) add(e1[0], e1[1], 2, x, y);
					if (x >= 0 && y <= 0) add(e1[0], e1[1], 3, x, y);
				}
			}
		}
	}
	
	int ans = 0;
	for (auto e1 : all) {
		bool ok = 1;
		for (auto e2 : all) {
			if (e1 == e2) continue ;
			bool flag = 0;
			for (int i = 0; i < 4; i++) {
				if ((b[e1[0]][e1[1]][i] & b[e2[0]][e2[1]][i]) != b[e1[0]][e1[1]][i]) {
					flag = 1;
					break ;
				}
			}
			if (!flag) {
				ok = 0;
				break;
			}
		}
		ans += ok; 
	}
	
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int T;
	cin >> T;
	while (T--)
	solve();
	return 0;
}

/*
1
1 1
.
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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

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
Wrong Answer
time: 12ms
memory: 8000kb

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
358
294
373
290

result:

wrong answer 2nd lines differ - expected: '380', found: '358'