QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#594753	#7733. Cool, It’s Yesterday Four Times More	zhangboju^#	WA	1ms	5996kb	C++14	2.3kb	2024-09-28 10:06:30	2024-09-28 10:06:30

Judging History

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

[2024-09-28 10:06:30]
评测

测评结果：WA
用时：1ms
内存：5996kb

查看

[2024-09-28 10:06:30]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1010;
const int mx[4]={0,1,0,-1};
const int my[4]={1,0,-1,0};
int n,m;
char ch[MAXN][MAXN];
int tot;
bool vis[MAXN][MAXN];
bool flag[MAXN][MAXN<<1];
vector<int> vec[MAXN];
int trans(int i,int j){
    return 2*i*n+j;
}
void dfs(int stx,int sty,int x,int y){
    int id=trans(x-stx,y-sty);
    // cout<<x-stx<<' '<<y-sty<<' '<<id<<endl;
    // cout<<ch[x][y]<<endl;
    flag[tot][id]=true;
    vec[tot].push_back(id);
    vis[x][y]=true;
    for(int i=0;i<4;++i){
        int nx=x+mx[i],ny=y+my[i];
        if(vis[nx][ny]||nx<1||ny<1||nx>n||ny>m||ch[nx][ny]=='O')continue;
        // cout<<nx<<' '<<ny<<' '<<ch[nx][ny]<<' '<<(ch[nx][ny]=='0')<<endl;
        dfs(stx,sty,nx,ny);
    }
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;++i){
            scanf("%s",ch[i]+1);
        }
        tot=0;
        for(int i=1;i<=n;++i){
            for(int j=1;j<=m;++j){
                if(!vis[i][j]&&ch[i][j]!='O'){
                    ++tot;
                    // cout<<"!"<<endl;
                    dfs(i,j,i,j);
                }
            }
        }
        // for(int i=1;i<=tot;++i){
        //     for(auto x: vec[i]){
        //         cout<<x<<' ';
        //     }
        //     cout<<endl;
        // }
        int ans=0;
        for(int i=1;i<=tot;++i){
            bool ck=true;
            for(int j=1;j<=tot;++j){
                if(i==j)continue;
                bool fl=false;
                for(auto x: vec[i]){
                    // cout<<'?'<<x<<' '<<flag[j][x]<<endl;
                    if(!flag[j][x]){
                        fl=true;
                        break;
                    }
                }
                // cout<<i<<' '<<j<<' '<<fl<<endl;
                if(!fl){
                    ck=false;
                    break;
                }
            }
            if(ck)ans+=vec[i].size();
        }
        printf("%d\n",ans);
        for(int i=1;i<=tot;++i){
            for(auto x: vec[i]){
                vis[i][x]=false;
            }
            vec[i].clear();
        }
        for(int i=1;i<=n;++i){
            for(int j=1;j<=m;++j){
                vis[i][j]=false;
            }
        }
    }
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 5852kb

input:

4
2 5
.OO..
O..O.
1 3
O.O
1 3
.O.
2 3
OOO
OOO

output:

result:

ok 4 lines

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 5996kb

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:

result:

wrong answer 7th lines differ - expected: '3', found: '5'