oj.uz

Submission #797220

# Submission time Handle Problem Language Result Execution time Memory
797220 2023-07-29T08:05:55 Z finn__ L-triominoes (CEOI21_ltriominoes) C++17
28 / 100
 71 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr size_t W = 6, K = 250;

struct bmatrix
{
    bitset<1 << W> mat[1 << W];

    bmatrix transpose() const
    {
        bmatrix res;
        for (size_t i = 0; i < 1U << W; ++i)
            for (size_t j = 0; j < 1U << W; ++j)
                res.mat[i][j] = mat[j][i];
        return res;
    }

    bmatrix operator*(bmatrix const &y) const
    {
        bmatrix x = y.transpose();
        bmatrix res;

        for (size_t i = 0; i < 1U << W; ++i)
            for (size_t j = 0; j < 1U << W; ++j)
                res.mat[i][j] = (mat[i] & x.mat[j]).any();

        return res;
    }

    bmatrix pow(size_t n) const
    {
        bmatrix a = *this;
        bmatrix res;
        for (size_t i = 0; i < 1U << W; ++i)
            res.mat[i][i] = 1;

        while (n)
        {
            if (n & 1)
                res = res * a;
            a = a * a;
            n >>= 1;
        }

        return res;
    }

    bitset<1 << W> mul_vec(bitset<1 << W> const &v) const
    {
        bitset<1 << W> res;
        for (size_t i = 0; i < 1U << W; ++i)
            res[i] = (mat[i] & v).any();
        return res;
    }
};

pair<size_t, size_t> p[K];
bitset<1 << W> f[1 << W];
vector<uint32_t> pre[1 << W][1 << W];
bitset<1 << (W << 1)> visited;

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

    size_t w, h, k;
    cin >> w >> h >> k;

    for (size_t i = 0; i < k; ++i)
        cin >> p[i].first >> p[i].second, --p[i].first, --p[i].second;

    for (size_t i = 0; i < 1U << w; ++i)
        f[i][0] = 1;
    for (size_t i = 0; i < 1U << w; ++i)
        for (size_t j = 0; j < 1U << w; ++j)
            if (f[i][j])
                for (size_t h = 0; h < w; ++h)
                    if (!(i & (1 << h)))
                    {
                        if (h && !(j & (1 << h)) && !(j & (1 << (h - 1))))
                        {
                            size_t ni = i ^ (1 << h), nj = j ^ (1 << h) ^ (1 << (h - 1));
                            f[ni][nj] = 1;
                            pre[ni][nj].push_back((i << W) | j);
                        }
                        if (h + 1 < w && !(j & (1 << h)) && !(j & (1 << (h + 1))))
                        {
                            size_t ni = i ^ (1 << h), nj = j ^ (1 << h) ^ (1 << (h + 1));
                            f[ni][j] = 1;
                            pre[ni][nj].push_back((i << W) | j);
                        }
                        if (h + 1 < w && !(i & (1 << (h + 1))) && !(j & (1 << h)))
                        {
                            size_t ni = i ^ (1 << h) ^ (1 << (h + 1)), nj = j ^ (1 << h);
                            f[ni][nj] = 1;
                            pre[ni][nj].push_back((i << W) | j);
                        }
                        if (h + 1 < w && !(i & (1 << (h + 1))) && !(j & (1 << (h + 1))))
                        {
                            size_t ni = i ^ (1 << h) ^ (1 << (h + 1)), nj = j ^ (1 << (h + 1));
                            f[ni][nj] = 1;
                            pre[ni][nj].push_back((i << W) | j);
                        }
                    }

    bmatrix transitions;
    for (size_t i = 0; i < 1 << w; ++i)
    {
        queue<uint32_t> q;
        q.push((((1 << w) - 1) << W) | i);
        visited.reset();

        while (!q.empty())
        {
            uint32_t u = q.front();
            q.pop();

            if (!(u & ((1 << W) - 1)))
            {
                transitions.mat[i][u >> W] = 1;
            }

            for (auto const &v : pre[u >> W][u & ((1 << W) - 1)])
                if (!visited[v])
                {
                    q.push(v);
                    visited[v] = 1;
                }
        }
    }

    sort(p, p + k, [](auto const &a, auto const &b)
         { return a.second < b.second; });
    bitset<1 << W> state, state2;
    size_t i = 0, pos = 0;
    if (k && !p[0].second)
    {
        size_t x = 0;
        while (!p[i].second)
            x |= 1 << p[i].first, ++i;
        state[x] = 1;
    }
    else
        state[0] = 1;

    while (i < k)
    {
        state = transitions.pow(p[i].second - pos).mul_vec(state);
        pos = p[i].second;
        size_t x = 0;
        size_t j = i;
        while (j < k && p[j].second == p[i].second)
            x |= 1 << p[j].first, ++j;
        i = j;

        state2.reset();
        for (size_t i = 0; i < 1 << w; ++i)
            if (!(i & x) && state[i])
                state2[i ^ x] = 1;
        state = state2;
    }

    if (pos != h - 1)
    {
        state = transitions.pow(h - 1 - pos).mul_vec(state);
    }

    cout << (state[(1 << w) - 1] ? "YES" : "NO") << '\n';
}

Compilation message

ltrominoes.cpp: In function 'int main()':
ltrominoes.cpp:109:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  109 |     for (size_t i = 0; i < 1 << w; ++i)
      |                        ~~^~~~~~~~
ltrominoes.cpp:159:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  159 |         for (size_t i = 0; i < 1 << w; ++i)
      |                            ~~^~~~~~~~

Subtask #1
0 / 10.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 340 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 7 ms 424 KB Output is correct
7 Runtime error 1 ms 596 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 4 ms 420 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 16 ms 416 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 9 ms 416 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 53 ms 420 KB Output is correct
18 Correct 3 ms 416 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 56 ms 340 KB Output is correct
21 Correct 1 ms 420 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 5 ms 424 KB Output is correct
26 Correct 33 ms 404 KB Output is correct
27 Correct 2 ms 420 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 70 ms 340 KB Output is correct
31 Correct 68 ms 416 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 64 ms 340 KB Output is correct
34 Correct 68 ms 404 KB Output is correct
35 Correct 69 ms 400 KB Output is correct
36 Correct 22 ms 412 KB Output is correct
37 Correct 71 ms 404 KB Output is correct
38 Correct 52 ms 408 KB Output is correct
39 Correct 47 ms 468 KB Output is correct
40 Correct 50 ms 340 KB Output is correct
41 Correct 41 ms 404 KB Output is correct
42 Correct 19 ms 428 KB Output is correct
43 Correct 23 ms 340 KB Output is correct
44 Correct 13 ms 424 KB Output is correct
45 Correct 24 ms 420 KB Output is correct
46 Correct 11 ms 340 KB Output is correct
47 Correct 14 ms 416 KB Output is correct
48 Correct 11 ms 340 KB Output is correct
49 Correct 12 ms 432 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 57 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 70 ms 408 KB Output is correct
11 Correct 70 ms 408 KB Output is correct
12 Correct 70 ms 340 KB Output is correct
13 Correct 68 ms 416 KB Output is correct
14 Correct 62 ms 404 KB Output is correct
15 Correct 63 ms 340 KB Output is correct
16 Correct 45 ms 436 KB Output is correct
17 Correct 60 ms 340 KB Output is correct
18 Correct 59 ms 408 KB Output is correct
19 Correct 37 ms 340 KB Output is correct
20 Correct 17 ms 452 KB Output is correct
21 Correct 19 ms 340 KB Output is correct
22 Correct 15 ms 456 KB Output is correct
23 Correct 35 ms 344 KB Output is correct
24 Correct 58 ms 416 KB Output is correct
25 Correct 48 ms 424 KB Output is correct
26 Correct 55 ms 340 KB Output is correct
27 Correct 48 ms 340 KB Output is correct
28 Correct 16 ms 424 KB Output is correct
29 Correct 43 ms 408 KB Output is correct
30 Correct 20 ms 432 KB Output is correct
31 Correct 60 ms 340 KB Output is correct
32 Correct 47 ms 340 KB Output is correct
33 Correct 47 ms 340 KB Output is correct
34 Correct 8 ms 456 KB Output is correct
35 Correct 10 ms 456 KB Output is correct
36 Correct 15 ms 340 KB Output is correct
37 Correct 10 ms 460 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.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 340 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 7 ms 424 KB Output is correct
7 Runtime error 1 ms 596 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -