oj.uz

답안 #993692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
993692 2024-06-06T10:11:21 Z vyshniak_n Furniture (JOI20_furniture) C++17
5 / 100
 5000 ms 1360 KB 
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll maxn = 1e3 + 10;
const ll mod = 1e9 + 7;
const ll K = 7e6 + 100;
const ll LOG = 20;

bool dp[maxn][maxn];
ll a[maxn][maxn];

void solve() {
    ll n, m;
    cin >> n >> m;

    for (ll i = 1; i <= n; i++)
        for (ll j = 1; j <= m; j++)
            cin >> a[i][j], a[i][j] ^= 1;

    ll q;
    cin >> q;

    dp[0][1] = 1;

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

        for (ll i = 1; i <= n; i++)
            for (ll j = 1; j <= m; j++)
                dp[i][j] = 0;

        a[x][y] = 0;
        for (ll i = 1; i <= n; i++)
            for (ll j = 1; j <= m; j++)
                dp[i][j] = (dp[i - 1][j] | dp[i][j - 1]) & a[i][j];

        if (dp[n][m])
            cout << 1 << el;
        else
            cout << 0 << el, a[x][y] = 1;
    }
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 856 KB Output is correct
2 Correct 72 ms 856 KB Output is correct
3 Correct 158 ms 856 KB Output is correct
4 Correct 362 ms 1104 KB Output is correct
5 Correct 408 ms 1116 KB Output is correct
6 Correct 515 ms 1144 KB Output is correct
7 Correct 517 ms 1360 KB Output is correct
8 Correct 518 ms 1112 KB Output is correct
9 Correct 515 ms 1112 KB Output is correct

Subtask #2
0.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 856 KB Output is correct
2 Correct 72 ms 856 KB Output is correct
3 Correct 158 ms 856 KB Output is correct
4 Correct 362 ms 1104 KB Output is correct
5 Correct 408 ms 1116 KB Output is correct
6 Correct 515 ms 1144 KB Output is correct
7 Correct 517 ms 1360 KB Output is correct
8 Correct 518 ms 1112 KB Output is correct
9 Correct 515 ms 1112 KB Output is correct
10 Execution timed out 5064 ms 1276 KB Time limit exceeded
11 Halted 0 ms 0 KB -