oj.uz

답안 #594453

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594453 2022-07-12T13:16:02 Z dxz05 Furniture (JOI20_furniture) C++14
0 / 100
 348 ms 660 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();

    queue<int> q;
    vector<bool> used(n * m, false);
    q.push(0);
    used[0] = true;

    while (!q.empty()){
        int x = q.front();
        q.pop();

        if (x % m != m - 1 && !used[x + 1] && a[x / m][x % m + 1] == 0){
            used[x + 1] = true;
            q.push(x + 1);
        }

        if (x / m != n - 1 && !used[x + m] && a[x / m + 1][x % m] == 0){
            used[x + m] = true;
            q.push(x + m);
        }
    }

    return used.back();
}

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;

    int ans = 0;
    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;
            ans++;
        }
    }

    assert(ans <= n + m - 4);

}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 340 KB Output is correct
2 Correct 39 ms 352 KB Output is correct
3 Correct 121 ms 380 KB Output is correct
4 Correct 201 ms 396 KB Output is correct
5 Correct 231 ms 404 KB Output is correct
6 Runtime error 348 ms 660 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 340 KB Output is correct
2 Correct 39 ms 352 KB Output is correct
3 Correct 121 ms 380 KB Output is correct
4 Correct 201 ms 396 KB Output is correct
5 Correct 231 ms 404 KB Output is correct
6 Runtime error 348 ms 660 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -