제출 #1198803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198803		Marco_Escandon	Furniture (JOI20_furniture)	C++20	0 / 100	5095 ms	320 KiB

furniture

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m;
vector<vector<ll>> cad,cad2;
ll dfs(ll x, ll y)
{
    if(x==n-1&&y==m-1) return 0;
    if(x==n||y==m||cad[x][y]==1) return 1;
    return cad2[x][y]=min(dfs(x+1,y),dfs(x,y+1));
}
int main()
{
    cin>>n>>m;
    cad.assign(n,vector<ll>(m, 0));
    cad2.assign(n,vector<ll>(m, 1));
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
            cin>>cad[i][j];
    dfs(0,0);
    vector<set<pair<ll,ll>>> s(n+m+5);
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
            if(cad2[i][j]==0) s[i+j].insert({i,j});
    ll q;
    cin>>q;
    while(q--)
    {
        ll a,b;
        cin>>a>>b;
        a--; b--;
        if(s[a+b].size()-(s[a+b].find({a,b})!=s[a+b].end())>=1)
        {
            cout<<"1\n";
            if(s[a+b].find({a,b})!=s[a+b].end())
            s[a+b].erase({a,b});
            for(int i=a; i<n; i++)
            {
                for(int j=b; j<m; j++)
                {
                    if(cad2[i][j]) break;
                    ll o1=1;if(i>0) o1=cad[i-1][j];
                    ll o2=1;if(j>0) o2=cad[i][j-1];
                    cad2[i][j]=min(o1,o2);
                    if(!cad2[i][j]) break;
                    s[i+j].erase({i,j});
                }
            }
            
        }
        else cout<<"0\n";
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95