QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#276581#7733. Cool, It’s Yesterday Four Times Moredoyo#WA 1ms5720kbC++142.4kb2023-12-05 23:08:322023-12-05 23:08:32

Judging History

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

  • [2023-12-05 23:08:32]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:5720kb
  • [2023-12-05 23:08:32]
  • 提交

answer

#include<bits/stdc++.h>
#define N 1005
using namespace std;
string s[N];
int xx[4] = {0, 0, 1, -1};
int yy[4] = {1, -1, 0, 0};
int vis[N][N];
int vec[N];
void work(){
    int n, m;
    int tag = 0, ans = 0;
    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        string ss;cin>>ss;
        s[i]="O"+ss;
        for (int j = 1; j <= m; j++) vis[i][j] = 0;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            if(vis[i][j]) continue;
            if(s[i][j] == 'O') continue;
            queue<pair<int, int> > q;
            int tot = 0, sum = 1;
            vis[i][j] = ++tag;
            q.push(make_pair(i, j));
            while(!q.empty()) {
                pair<int,int> now=q.front();q.pop();
                int x = now.first, y = now.second;
                //cout << x << " " << y << " " << tag<< endl;
                for (int k = 0; k < 4; k++){
                    int X = x + xx[k], Y = y + yy[k];
                    if((X < 1 || X > n) || (Y < 1 || Y > m)) continue;
                    if(s[X][Y] == 'O') continue;
                    if(vis[X][Y]) continue;
                    vis[X][Y] = tag; q.push(make_pair(X, Y));
                    vec[++tot] = k; sum++;
                }
            }
            bool Flag = 0;
            for (int ii = 1; ii <= n; ii++)
                for (int jj = 1; jj <= m; jj++){
                    int x = ii, y = jj;
                    bool flag = 0;
                    if(s[x][y] == 'O') continue;
                    if(vis[x][y] == tag) continue;
                    for(int k = 1; k <= tot; k++){
                        x += xx[vec[k]]; y += yy[vec[k]];
                        if((x < 1 || x > n) || (y < 1 || y > m)){
                            flag = 1;
                            break;
                        }
                        if(s[x][y] == 'O') {
                            flag = 1;
                            break;
                        }
                    }
                    if(!flag) {
                        Flag = 1;
                        //cout << ii << " " << jj << endl;
                        break;
                    }
                }
            if(!Flag) ans += sum;
        }
    cout << ans << "\n";
}
int main()
{
	cin.tie(0);
	cin.sync_with_stdio(0);
	int t=1;
	cin>>t;
	while(t--)
		work();
	return 0;
}

详细

Test #1:

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

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

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: 1ms
memory: 5720kb

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
25
20
26
25
29
21
29
21
31
32
31
25
34
25
31
18
25
41
28
20
38
20
29
18
21
27
28
41
13
20
23
32
29
28
23
19
23
24
18
28
22
35
24

result:

wrong answer 8th lines differ - expected: '29', found: '25'