oj.uz

Submission #797266

# Submission time Handle Problem Language Result Execution time Memory
797266 2023-07-29T08:39:29 Z finn__ L-triominoes (CEOI21_ltriominoes) C++17
28 / 100
 8000 ms 362212 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];
bmatrix transitions;
bitset<1 << W> state, state2;

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 y = 0; y < 1 << w; ++y)
    {
        queue<uint32_t> q;
        q.push(y << W);

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

            size_t i = u >> W, j = u & ((1 << W) - 1);

            if (i == (1 << w) - 1)
            {
                transitions.mat[j][y] = 1;
                continue;
            }

            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));
                        q.push((ni << W) | nj);
                    }
                    if (h + 1 < w && !(j & (1 << h)) && !(j & (1 << (h + 1))))
                    {
                        size_t ni = i ^ (1 << h), nj = j ^ (1 << h) ^ (1 << (h + 1));
                        q.push((ni << W) | nj);
                    }
                    if (h + 1 < w && !(i & (1 << (h + 1))) && !(j & (1 << h)))
                    {
                        size_t ni = i ^ (1 << h) ^ (1 << (h + 1)), nj = j ^ (1 << h);
                        q.push((ni << W) | nj);
                    }
                    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));
                        q.push((ni << W) | nj);
                    }
                }
        }
    }

    sort(p, p + k, [](auto const &a, auto const &b)
         { return a.second < b.second; });
    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:73:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   73 |     for (size_t y = 0; y < 1 << w; ++y)
      |                        ~~^~~~~~~~
ltrominoes.cpp:85:19: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |             if (i == (1 << w) - 1)
      |                 ~~^~~~~~~~~~~~~~~
ltrominoes.cpp:142:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  142 |         for (size_t i = 0; i < 1 << w; ++i)
      |                            ~~^~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 316 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Execution timed out 8073 ms 362212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 16 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 7 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 7 ms 212 KB Output is correct
17 Correct 54 ms 212 KB Output is correct
18 Correct 3 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 57 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 5 ms 316 KB Output is correct
26 Correct 31 ms 212 KB Output is correct
27 Correct 2 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 71 ms 212 KB Output is correct
31 Correct 70 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 64 ms 300 KB Output is correct
34 Correct 69 ms 300 KB Output is correct
35 Correct 71 ms 304 KB Output is correct
36 Correct 23 ms 212 KB Output is correct
37 Correct 70 ms 304 KB Output is correct
38 Correct 51 ms 212 KB Output is correct
39 Correct 45 ms 332 KB Output is correct
40 Correct 51 ms 212 KB Output is correct
41 Correct 42 ms 212 KB Output is correct
42 Correct 19 ms 328 KB Output is correct
43 Correct 22 ms 212 KB Output is correct
44 Correct 13 ms 212 KB Output is correct
45 Correct 25 ms 212 KB Output is correct
46 Correct 11 ms 212 KB Output is correct
47 Correct 14 ms 320 KB Output is correct
48 Correct 11 ms 212 KB Output is correct
49 Correct 12 ms 320 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 212 KB Output is correct
2 Correct 7 ms 212 KB Output is correct
3 Correct 58 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 276 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 72 ms 304 KB Output is correct
11 Correct 71 ms 300 KB Output is correct
12 Correct 72 ms 304 KB Output is correct
13 Correct 70 ms 212 KB Output is correct
14 Correct 64 ms 312 KB Output is correct
15 Correct 65 ms 212 KB Output is correct
16 Correct 46 ms 308 KB Output is correct
17 Correct 61 ms 300 KB Output is correct
18 Correct 60 ms 212 KB Output is correct
19 Correct 38 ms 212 KB Output is correct
20 Correct 18 ms 212 KB Output is correct
21 Correct 19 ms 324 KB Output is correct
22 Correct 15 ms 212 KB Output is correct
23 Correct 38 ms 308 KB Output is correct
24 Correct 59 ms 304 KB Output is correct
25 Correct 49 ms 312 KB Output is correct
26 Correct 56 ms 212 KB Output is correct
27 Correct 49 ms 212 KB Output is correct
28 Correct 17 ms 324 KB Output is correct
29 Correct 43 ms 212 KB Output is correct
30 Correct 20 ms 320 KB Output is correct
31 Correct 61 ms 300 KB Output is correct
32 Correct 46 ms 212 KB Output is correct
33 Correct 49 ms 212 KB Output is correct
34 Correct 8 ms 212 KB Output is correct
35 Correct 10 ms 324 KB Output is correct
36 Correct 12 ms 212 KB Output is correct
37 Correct 10 ms 328 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 316 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Execution timed out 8073 ms 362212 KB Time limit exceeded
9 Halted 0 ms 0 KB -