Submission #1087183

#	Time	Username	Problem	Language	Result	Execution time	Memory
1087183		steveonalex	Furniture (JOI20_furniture)	C++17	5 / 100	5056 ms	7112 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());
    }

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

    int n, m; cin >> n >> m;

    int grid[n + 2][m + 2];
    memset(grid, 0, sizeof grid);

    for(int i = 1; i<=n; ++i) for(int j = 1; j<=m; ++j) cin >> grid[i][j];

    int q; cin >> q;
    while(q--){
        int x, y; cin >> x >> y;
        grid[x][y] = 1;

        bool dp[n+2][m+2]; memset(dp, 0, sizeof dp);
        dp[1][1] = 1;
        for(int i = 1; i<=n; ++i) for(int j= 1; j<=m; ++j) if (dp[i][j] && grid[i][j] == 0) {
            dp[i][j+1] = 1;
            dp[i+1][j] = 1;
        }

        if (dp[n][m]){
            cout << 1 << "\n";
        }
        else{
            cout << 0 << "\n";
            grid[x][y] = 0;
        }
    }

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

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