oj.uz

Submission #797409

# Submission time Handle Problem Language Result Execution time Memory
797409 2023-07-29T10:38:34 Z Johann L-triominoes (CEOI21_ltriominoes) C++14
28 / 100
 8000 ms 131704 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

const int maxW = 13;
int W, H, K;
map<int, int> blocked;
typedef bitset<1 << maxW> bs;
typedef vector<bs> matrix;
typedef vector<matrix> vvbs;
bs dp[2];
bs mat[1 << maxW];
vvbs lift;

void dfs(int idx, int base, int next, bs &nextdp)
{
    if (idx == W)
    {
        nextdp[next] = true;
        return;
    }
    if (base & (1 << idx))
        dfs(idx + 1, base, next, nextdp);
    else
    {
        // _X my pos: 1 << idx

        // TT
        // _T
        if (idx < W - 1 && ((3 << idx) & next) == 0)
            dfs(idx + 1, base | (1 << idx), next | (3 << idx), nextdp);

        // _TT
        // _T_
        if (idx > 0 && ((3 << (idx - 1)) & next) == 0)
            dfs(idx + 1, base | (1 << idx), next | (3 << (idx - 1)), nextdp);

        // T_
        // TT
        if (idx < W - 1 && (base & (3 << idx)) == 0 && (next & (2 << idx)) == 0)
            dfs(idx + 2, base | (3 << idx), next | (2 << idx), nextdp);

        // _T
        // TT
        if (idx < W - 1 && (base & (3 << idx)) == 0 && (next & (1 << idx)) == 0)
            dfs(idx + 2, base | (3 << idx), next | (1 << idx), nextdp);
    }
}

void mul(bs &base, int liftidx, bs &re, int block = 0)
{
    re = 0;
    for (int j = 0; j < 1 << W; ++j)
    {
        if (!base[j])
            continue;
        if (j & block)
            continue;

        re |= lift[liftidx][j | block];
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> W >> H >> K;
    for (int k = 0, x, y; k < K; ++k)
    {
        cin >> x >> y;
        --x, --y;
        blocked[y] = blocked[y] | (1 << x);
    }

    lift.assign(ceil(log2(H) + 1), matrix(1 << W));
    for (int i = 0; i < 1 << W; ++i)
        dfs(0, i, 0, lift[0][i]);

    for (int j = 1; j < sz(lift); ++j)
        for (int i = 0; i < 1 << W; ++i)
            mul(lift[j - 1][i], j - 1, lift[j][i]);

    if (false)
    {
        dp[0] = 0;
        dp[0][0] = true;
        for (int i = 0; i < H; ++i)
        {
            int ii = i & 1;
            int ni = ii ^ 1;
            dp[ni] = 0;

            mul(dp[ii], 0, dp[ni], blocked[i]);
        }

        if (dp[H & 1][0])
            cout << "YES\n";
        else
            cout << "NO\n";
    }
    else
    {
        bs start = 0, tmp;
        start[0] = 1;
        blocked[H - 1] = blocked[H - 1] | 0;
        int h = 0;
        for (pii p : blocked)
        {
            for (int j = sz(lift) - 1; j >= 0; --j)
            {
                if (p.first - h >= (1 << j))
                {
                    h += (1 << j);
                    mul(start, j, tmp);
                    swap(start, tmp);
                }
            }
            mul(start, 0, tmp, p.second);
            swap(start, tmp);
            ++h;
        }

        if (start[0])
            cout << "YES\n";
        else
            cout << "NO\n";
    }

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 2 ms 1236 KB Output is correct
8 Correct 2747 ms 37212 KB Output is correct
9 Correct 702 ms 18772 KB Output is correct
10 Correct 45 ms 4948 KB Output is correct
11 Correct 3269 ms 41300 KB Output is correct
12 Correct 213 ms 10580 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2222 ms 33116 KB Output is correct
16 Execution timed out 8048 ms 98832 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 4564 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Execution timed out 8090 ms 131704 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 2 ms 464 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 1 ms 588 KB Output is correct
49 Correct 1 ms 468 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 5 ms 1364 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 4 ms 1748 KB Output is correct
6 Correct 2 ms 1108 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 3 ms 848 KB Output is correct
11 Correct 5 ms 1364 KB Output is correct
12 Correct 11 ms 2388 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 4 ms 1364 KB Output is correct
16 Correct 9 ms 2388 KB Output is correct
17 Correct 3 ms 1356 KB Output is correct
18 Correct 4 ms 1376 KB Output is correct
19 Correct 7 ms 2388 KB Output is correct
20 Correct 7 ms 2388 KB Output is correct
21 Correct 4 ms 1364 KB Output is correct
22 Correct 11 ms 2388 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 4 ms 1256 KB Output is correct
25 Correct 6 ms 2380 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 3 ms 1236 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 3 ms 1248 KB Output is correct
31 Correct 4 ms 1248 KB Output is correct
32 Correct 9 ms 2272 KB Output is correct
33 Correct 9 ms 2268 KB Output is correct
34 Correct 6 ms 2144 KB Output is correct
35 Correct 5 ms 2144 KB Output is correct
36 Correct 2 ms 1248 KB Output is correct
37 Correct 6 ms 2144 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4572 KB Output is correct
2 Correct 19 ms 4576 KB Output is correct
3 Correct 64 ms 7848 KB Output is correct
4 Execution timed out 8028 ms 111204 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 2 ms 1236 KB Output is correct
8 Correct 2747 ms 37212 KB Output is correct
9 Correct 702 ms 18772 KB Output is correct
10 Correct 45 ms 4948 KB Output is correct
11 Correct 3269 ms 41300 KB Output is correct
12 Correct 213 ms 10580 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2222 ms 33116 KB Output is correct
16 Execution timed out 8048 ms 98832 KB Time limit exceeded
17 Halted 0 ms 0 KB -