제출 #311800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311800		MarcoMeijer	Furniture (JOI20_furniture)	C++14	100 / 100	404 ms	16940 KiB

furniture

#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 1001;
const int MX2 = 2e6;

int n, m;
int c[MX][MX];
int q;

int dx[]={-1, 0};
int dy[]={ 0,-1};
bool isInside(int i, int j) {return i>=0 && i<n && j>=0 && j<m;}

inline bool isSolid(int x, int y) {
    return !isInside(x,y) || c[x][y];
}

stack<ii> stck;
int difX[MX];
int difY[MX];
bool stop;
void place(int x, int y) {
    if(stop) return;
    c[x][y] = 1;
    stck.push({x,y});
    difX[y]++;
    difY[x]++;
    if(difX[y] == n) {
        stop = 1;
        return;
    }
    if(difY[x] == m) {
        stop = 1;
        return;
    }
    if(x && !c[x-1][y] && isSolid(x-1, y+1)) place(x-1,y);
    if(y && !c[x][y-1] && isSolid(x+1, y-1)) place(x,y-1);
}

void program() {
    IN(n, m);
    RE(i,n) RE(j,m) IN(c[i][j]);

    RE(i,n) RE(j,m) if(c[i][j]) place(i, j);
    RE(i,n) difY[i] = 0;
    RE(i,m) difX[i] = 0;

    IN(q);
    RE(i,q) {
        int x, y; IN(x,y); x--; y--;

        if(c[x][y] == 0) {
            if(difX[y] == n-1) goto cancel;
            if(difY[x] == m-1) goto cancel;
            stop = 0;
            while(!stck.empty()) stck.pop();
            place(x,y);
            if(c[0][0] || stop) {
                while(!stck.empty()) {
                    ii p = stck.top(); stck.pop();
                    c[p.fi][p.se] = 0;
                    difX[p.se]--;
                    difY[p.fi]--;
                }
            }
        }
        
        cancel:
        OUTL(c[x][y]);
    }
}

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