Submission #52854959

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n)  for(int i=0;i<(n);++i)
#define sizc(x) ((int)x.size())
#define allc(x) x.begin(),x.end()
#define fir first
#define sec second
namespace KnownError_{
    constexpr int N = 1005;
    int n,m;
    bool ok[N][N],st[N][N];
    bool vis[N][N];
    int ans=1;
    unordered_set<int> se;
    int id(int x,int y){return x*m+y;}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n)  for(int i=0;i<(n);++i)
#define sizc(x) ((int)x.size())
#define allc(x) x.begin(),x.end()
#define fir first
#define sec second
namespace KnownError_{
    constexpr int N = 1005;
    int n,m;
    bool ok[N][N],st[N][N];
    bool vis[N][N];
    int ans=1;
    unordered_set<int> se;
    int id(int x,int y){return x*m+y;}
    void dfs(int x,int y){
        se.insert(id(x,y));
        vis[x][y]=1;
        if(st[x-1][y]&&!vis[x-1][y])dfs(x-1,y);
        if(st[x+1][y]&&!vis[x+1][y])dfs(x+1,y);
        if(st[x][y-1]&&!vis[x][y-1])dfs(x,y-1);
        if(st[x][y+1]&&!vis[x][y+1])dfs(x,y+1);
        if(ok[x-1][y]&&!st[x-1][y])se.insert(id(x-1,y));
        if(ok[x+1][y]&&!st[x+1][y])se.insert(id(x+1,y));
        if(ok[x][y-1]&&!st[x][y-1])se.insert(id(x,y-1));
        if(ok[x][y+1]&&!st[x][y+1])se.insert(id(x,y+1));
    }
    void main(){
        cin>>n>>m;
    	rep(i,1,n)rep(j,1,m)ok[i][j]=st[i][j]=1;
        rep(i,1,n)rep(j,1,m){
            char ch;
            cin>>ch;
            if(ch=='#')ok[i][j]=st[i][j]=st[i-1][j]=st[i][j-1]=st[i+1][j]=st[i][j+1]=0;
        }
        rep(i,1,n)rep(j,1,m)if(st[i][j]&&!vis[i][j])unordered_set<int>().swap(se),dfs(i,j),ans=max(ans,sizc(se));
        cout<<ans<<'\n';
    }
}
signed main(){
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    KnownError_::main();
}

Submission Info

Judge Result