Submission #1033162

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033162		GrindMachine	Furniture (JOI20_furniture)	C++17	0 / 100	1 ms	860 KiB

furniture

#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;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

int a[N][N];

void solve(int test_case)
{
    int n,m; cin >> n >> m;
    rep1(i,n) rep1(j,m) cin >> a[i][j];

    vector<int> rp(n+5), dp(m+5); // rp = right path, dp = down path

    auto on_right = [&](int i, int j){
        int l = rp[i-1], r = rp[i];
        return l <= j and j <= r;
    };

    auto on_down = [&](int i, int j){
        int l = dp[j-1], r = dp[j];
        return l <= i and i <= r;
    };

    rep1(i,n){
        rp[i] = m;
    }
    rep1(j,m){
        dp[j] = n;
    }

    auto upd = [&](int i, int j){
        if(on_right(i,j) and on_down(i,j)) return 0;

        a[i][j] = 1;
        int oi = i, oj = j;

        if(on_right(i,j)){
            amin(rp[i],j-1);
            while(true){
                if(a[i][rp[i]]){
                    rp[i]--;
                }
                else if(i+1 <= n and rp[i] > rp[i+1]){
                    rp[i]--;
                }
                else{
                    if(i == 1) break;
                    if(rp[i-1] > rp[i]){
                        i--;
                    }
                    else{
                        break;
                    }
                }
            }
        }

        i = oi, j = oj;

        if(on_down(i,j)){
            amin(dp[j],i-1);
            while(true){
                if(a[dp[j]][j]){
                    dp[j]--;
                }
                else if(j+1 <= m and dp[j] > dp[j+1]){
                    dp[j]--;
                }
                else{
                    if(j == 1) break;
                    if(dp[j-1] > dp[j]){
                        j--;
                    }
                    else{
                        break;
                    }
                }
            }
        }

        return 1;        
    };

    rep1(i,n){
        rep1(j,m){
            if(a[i][j]){
                assert(upd(i,j));
            }
        }
    }

    int q; cin >> q;
    while(q--){
        int i,j; cin >> i >> j;
        int ans = upd(i,j);
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

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