QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#650240#7733. Cool, It’s Yesterday Four Times MoreCalculatelove#WA 15ms4264kbC++141.9kb2024-10-18 14:12:132024-10-18 14:12:13

Judging History

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

  • [2024-10-18 14:12:13]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:4264kb
  • [2024-10-18 14:12:13]
  • 提交

answer

#include<cstdio>
#include<bitset>
const int N=1010;
std::bitset<N<<1>G[N];
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
int n,m;
int id(int x,int y){
    return (x-1)*m+y;
}
int iid(int x,int y){
	return x*(2*m+1)+y;
}
#include<queue>
struct node{
    int x,y;
};
std::queue<node>q;
char s[N][N];
void bfs(int x,int y){
    while(!q.empty())q.pop();
    q.push(node{x,y});
    int now=id(x,y);
//    G[now][now]=1;
    while(!q.empty()){
        node p=q.front();q.pop();
//        printf("%d %d\n",p.x,p.y);
        for(int i=0;i<4;i++){
            int nowx=p.x+dx[i],nowy=p.y+dy[i];
            if(1<=nowx&&nowx<=n&&1<=nowy&&nowy<=m&&s[nowx][nowy]=='.'&&!G[now][iid(nowx-x+n,nowy-y+m)]){
                q.push(node{nowx,nowy});
                G[now][iid(nowx-x+n,nowy-y+m)]=1;
            }
        }
    }
}
void work(){
//	puts("yues");
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%s",s[i]+1);
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)G[id(i,j)].reset();
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(s[i][j]=='.')bfs(i,j);
//    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(s[i][j]=='.')printf("%d ",id(i,j));
//    puts("");
    int ans=0;
//    puts("yes");
//	for(int i=1;i<=5;i++){
//		for(int j=0;j<=20;j++)if(G[i][j])putchar('1');else putchar('0');
//		puts("");
//	}
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(s[i][j]=='.'){
        int flag=1;
        for(int xx=1;xx<=n;xx++)for(int yy=1;yy<=m;yy++)if((xx!=i||yy!=j)&&s[xx][yy]=='.'){
            if((G[id(i,j)]|G[id(xx,yy)])==G[id(xx,yy)]){
//            	printf("%d %d %d %d\n",i,j,xx,yy);
                flag=0;
                goto Qzong;
            }
        }
        Qzong:;
        if(flag)ans++;
//		if(flag)printf("%d %d\n",i,j); 
    }
    printf("%d\n",ans);
}
int main(){
//    freopen("a.in","r",stdin);
//    freopen("a.out","w",stdout);
    int t;
    scanf("%d",&t);
    while(t--)work();
    return 0;
}

詳細信息

Test #1:

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

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

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

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: 15ms
memory: 4264kb

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:

6
329
240
321
171

result:

wrong answer 1st lines differ - expected: '7', found: '6'