Submission #72909910

---

Source Code Expand

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

using ll=long long;
using ull=unsigned long long;

void solve(){
    ll N, C; cin>>N>>C;
    vector<string> S(N);
    for(int i=0; i<N; ++i)cin>>S[i];

    for(int x=0; x<N; ++x)for(int y=N-1; y>=0; --y){
        if(S[y][x]=='#'){
            S[y][x]='p';
            break;
        }
        S[y][x]='p';
    }

    vector<vector<bool>> seen(N, vector<bool>(N));
    queue<pair<ll, ll>> Q;
    Q.push({N-1, C-1});
    while(!Q.empty()){
        auto [y, x]=Q.front(); Q.pop();

        if(seen[y][x])continue;
        seen[y][x]=true;

        if(S[y][x]=='p')for(int y=0; y<N; ++y)S[y][x]='o';
        S[y][x]='o';

        for(int i=-1; i<=1; ++i){
            int ny=y-1, nx=x+i;
            if(ny<0||N<=ny||nx<0||N<=nx)continue;
            if(S[ny][nx]=='#')continue;
            Q.push({ny, nx});
        }
    }

    for(int x=0; x<N; ++x)cout<<(S[0][x]=='o'?1:0);
    cout<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout<<fixed<<setprecision(17);
    int T=1; cin>>T;
    while(T--)solve();
    return 0;
}

Submission Info

Judge Result