1 solutions

  • 0
    @ 2025-4-24 18:36:10
    #include<bits/stdc++.h>
    using namespace std;
    const int N=510;
    char s[N][N];
    int main()
    {
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                cin>>s[i][j];
            }
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(s[i][j]=='.')
                {
                    if(s[i-1][j]=='#'&&s[i+1][j]=='#'||s[i][j-1]=='#'&&s[i][j+1]=='#')
                    {
                        cout<<i<<' '<<j;
                        return 0;
                    }
                    if(s[i][j+1]=='#'&&s[i+1][j]=='#'||s[i][j-1]=='#'&&s[i+1][j]=='#'||s[i-1][j]=='#'&&s[i][j+1]=='#'||s[i-1][j]=='#'&&s[i][j-1]=='#')
                    {
                        cout<<i<<' '<<j;
                        return 0;
                    }
                }
            }
        }
        return 0;
    }
    
    • 1

    [ABC305C] 饼干收集者(Snuke the Cookie Picker)

    Information

    ID
    2469
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    3
    Tags
    # Submissions
    2
    Accepted
    2
    Uploaded By