Submission #60520844

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;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H,W,D;
    cin>>H>>W>>D;
    vector<string> S(H);
    for(int i=0;i<H;i++) cin>>S[i];
    vector<pair<int,int>> floors;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(S[i][j]=='.') floors.push_back({i,j});
        }
    }
    int ans=0;
    for(int i=0;i<(int)floors.size();i++){
        for(int j=i+1;j<(int)floors.size();j++){
            int x1=floors[i].first,y1=floors[i].second;
            int x2=floors[j].first,y2=floors[j].second;
            int cnt=0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H,W,D;
    cin>>H>>W>>D;
    vector<string> S(H);
    for(int i=0;i<H;i++) cin>>S[i];
    vector<pair<int,int>> floors;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(S[i][j]=='.') floors.push_back({i,j});
        }
    }
    int ans=0;
    for(int i=0;i<(int)floors.size();i++){
        for(int j=i+1;j<(int)floors.size();j++){
            int x1=floors[i].first,y1=floors[i].second;
            int x2=floors[j].first,y2=floors[j].second;
            int cnt=0;
            for(int r=0;r<H;r++){
                for(int c=0;c<W;c++){
                    if(S[r][c]=='.'){
                        if(abs(r-x1)+abs(c-y1)<=D||abs(r-x2)+abs(c-y2)<=D) cnt++;
                    }
                }
            }
            ans=max(ans,cnt);
        }
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result