oj.uz

Submission #593523

# Submission time Handle Problem Language Result Execution time Memory
593523 2022-07-11T10:19:36 Z dxz05 Furniture (JOI20_furniture) C++14
0 / 100
 21 ms 340 KB 
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 5555;

bool check(vector<vector<int>> a){
    int n = (int)a.size(), m = (int)a[0].size();

    vector<int> pos(n, -1);
    for (int j = 0; j < m; j++){
        if (a[0][j] == 1){
            pos[0] = j;
            break;
        }
    }

    for (int i = 1; i < n; i++){
        if (pos[i - 1] != -1){
            for (int j = max(pos[i - 1] - 1, 0); j < m; j++){
                if (a[i][j] == 1){
                    pos[i] = j;
                    break;
                }
            }
        } else {
            int j = m - 1;
            while (j >= 0 && a[i][j] == 1) j--;

            pos[i] = (j < m - 1 ? j + 1 : -1);
        }

    }

    return pos.back() == -1;
}

void solve(int TC) {
    int n, m;
    cin >> n >> m;

    vector<vector<int>> a(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            cin >> a[i][j];
        }
    }

//    cout << check(a) << endl;

    int q;
    cin >> q;

    while (q--){
        int x, y;
        cin >> x >> y;
        --x, --y;

        a[x][y] = 1;
        if (check(a)){
            cout << 1 << endl;
        } else {
            a[x][y] = 0;
            cout << 0 << endl;
        }
    }

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Incorrect 21 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Incorrect 21 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -