Submission #1087244

#	Time	Username	Problem	Language	Result	Execution time	Memory
1087244		steveonalex	Furniture (JOI20_furniture)	C++17	100 / 100	171 ms	16212 KiB

furniture

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e3 + 69;
int blocked[N][N];
int sum[N * 2];

void flood_fill(int i, int j){
    if (blocked[i][j]) return;
    sum[i + j]--;
    blocked[i][j] = 1;
    if (blocked[i+1][j-1] == 1 && blocked[i+1][j] == 0){
        flood_fill(i + 1, j);
    }
    if (blocked[i-1][j+1] == 1 && blocked[i][j+1] == 0){
        flood_fill(i, j + 1);
    }

    if (blocked[i+1][j-1] == 1 && blocked[i][j-1] == 0){
        flood_fill(i, j-1);
    }
    if (blocked[i-1][j+1] == 1 && blocked[i-1][j] == 0){
        flood_fill(i-1, j);
    }
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n, m; cin >> n >> m;
    for(int i = 0; i<=n+1; ++i) blocked[i][0] = blocked[i][m+1] = 1;
    for(int i = 0; i<=m+1; ++i) blocked[0][i] = blocked[n+1][i] = 1;
    for(int i = 1; i<=n; ++i) for(int j = 1; j<=m; ++j)
        sum[i + j]++;



    for(int i = 1; i<=n; ++i){
        for(int j = 1; j<=m; ++j) {
            int x; cin >> x;
            if (x) flood_fill(i, j);
        }
    }

    int q; cin >> q;
    while(q--){
        int i, j; cin >> i >> j;
        if (blocked[i][j]) cout << 1 << "\n";
        else{
            if (sum[i+j] == 1) cout << 0 << "\n";
            else {
                cout << 1 << "\n";
                flood_fill(i, j);
            }
        }

        // for(int i = 1; i<=n; ++i){
        //     for(int j = 1; j<=m; ++j) 
        //         cout << blocked[i][j] << " ";
        //     cout << "\n";
        // }
        // for(int i = 2; i <= n + m; ++i) cout << sum[i] << " "; cout << "\n";
    }

 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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