제출 #441349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441349		zaneyu	Furniture (JOI20_furniture)	C++14	0 / 100	11 ms	740 KiB

furniture

/*input
2 3
0 0 1 
0 0 0
2
1 2
2 2
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-3;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=1e3+5;
const int maxlg=__lg(maxn)+2;
set<int> r[maxn],c[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    REP(i,n) REP(j,m){
        int x;
        cin>>x;
        if(x) r[i].insert(j),c[j].insert(i);
    }
    REP(i,n) r[i].insert(m);
    REP(i,m) c[i].insert(n);
    int q;
    cin>>q;
    while(q--){
        int x,y;
        cin>>x>>y;
        --x,--y;
        r[x].insert(y),c[y].insert(x);
        bool die=1;
        int st=0;
        REP(i,n){
            st=*r[i].lower_bound(st-1);
            if(st==0){
                die=0;
                break;
            }
        }
        if(st!=m) die=0;
        st=0;
        REP(i,m){
            st=*c[i].lower_bound(st-1);
            if(st==0){
                die=0;
                break;
            }
        }
        if(st!=n) die=0;
        cout<<die<<'\n';
        if(!die){
            r[x].erase(r[x].find(y)),
            c[y].erase(c[y].find(x));
        }
    }
}   

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