QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#609999#7733. Cool, It’s Yesterday Four Times MoreLittleYooWA 10ms3880kbC++201.9kb2024-10-04 14:40:212024-10-04 14:40:25

Judging History

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

  • [2024-10-04 14:40:25]
  • 评测
  • 测评结果:WA
  • 用时:10ms
  • 内存:3880kb
  • [2024-10-04 14:40:21]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
vector<pair<int, int>> dir = {
	{1, 0},
	{-1, 0},
	{0, -1},
	{0, 1}
};


void solve()
{
	int n, m;
	cin >> n >> m;
	vector a(n + 2, vector<char>(m + 2, 'O'));
	int tot = 0;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= m; ++j) {
			cin >> a[i][j];
			tot += a[i][j] == '.';
		}

	auto get = [&](int x, int y) { return (x - 1) * m + y - 1; };

	vector<bitset<1005>> f(n * m + 1);
	unordered_map<int, vector<int>> rec;

	auto bfs = [&](int x, int y)  {
		queue<pair<int, int>> q;
		vector vis(n + 2, vector<int>(m + 2));
		vis[x][y] = 1;
		q.emplace(0, 0);

		while(!q.empty()) {
			auto [dx, dy] = q.front();
			rec[get(dx + 1000, dy + 1000)].emplace_back(get(x, y));
			q.pop();

			for(auto &[ddx, ddy] : dir) {
				int sx = x + dx + ddx, sy = y + dy + ddy;
				if(vis[sx][sy] || a[sx][sy] == 'O')
					continue;
				vis[sx][sy] = 1;
				q.emplace(dx + ddx, dy + ddy);
			}
		}
	};


	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= m; ++j)
			if(a[i][j] == '.')
				bfs(i, j);

	for(int i = -n + 1000; i <= n + 1000; ++i)
		for(int j = -m + 1000; j <= m + 1000; ++j) 
			if(int cur = get(i, j); !rec[cur].empty()) {
		// cerr << "OK\n";
				bitset<1005> winner;
				for(auto &c : rec[cur])
					winner[c] = 1;

				for(int c = 0; c < n * m; ++c) 
					if(winner[c])
						for(int ii = 1; ii <= n; ++ii)
							for(int jj = 1; jj <= m; ++jj)
								if(a[ii][jj] == '.' && !winner[get(ii, jj)])
									f[c][get(ii, jj)] = 1;

		}


	auto ok = [&](int x, int y) {
		return f[get(x, y)].count() == tot - 1;
	};

	int ans = 0;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= m; ++j)
			if(a[i][j] == '.')
				ans += ok(i, j);
	cout << ans << '\n';

}

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

详细

Test #1:

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

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

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: -100
Wrong Answer
time: 10ms
memory: 3880kb

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
38
20
29
18
21
27
28
35
13
20
17
32
29
28
23
23
23
24
18
28
17
35
24

result:

wrong answer 28th lines differ - expected: '45', found: '38'