oj.uz

Submission #797912

# Submission time Handle Problem Language Result Execution time Memory
797912 2023-07-30T06:47:29 Z finn__ L-triominoes (CEOI21_ltriominoes) C++17
10 / 100
 1361 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr size_t W = 13, K = 250;

pair<size_t, size_t> p[K];
bitset<1 << W> state[2];

void find_transitions(uint32_t i, uint32_t j, size_t w, bitset<1 << W> &next_state, size_t l = 0)
{
    if (i == (1 << w) - 1)
    {
        next_state[j] = 1;
        return;
    }

    for (size_t h = l; h < w; ++h)
        if (!(i & (1 << h)))
        {
            if (h && !(j & (1 << h)) && !(j & (1 << (h - 1))))
                find_transitions(i ^ (1 << h), j ^ (1 << h) ^ (1 << (h - 1)), w, next_state, h + 1);
            if (h + 1 < w && !(j & (1 << h)) && !(j & (1 << (h + 1))))
                find_transitions(i ^ (1 << h), j ^ (1 << h) ^ (1 << (h + 1)), w, next_state, h + 1);
            if (h + 1 < w && !(i & (1 << (h + 1))) && !(j & (1 << h)))
                find_transitions(i ^ (1 << h) ^ (1 << (h + 1)), j ^ (1 << h), w, next_state, h + 2);
            if (h + 1 < w && !(i & (1 << (h + 1))) && !(j & (1 << (h + 1))))
                find_transitions(i ^ (1 << h) ^ (1 << (h + 1)), j ^ (1 << (h + 1)), w, next_state, h + 2);
            break;
        }
}

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

    size_t w, h, k;
    cin >> w >> h >> k;
    assert(h <= 1000);

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

    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 (i < k && !p[i].second)
            x |= 1ULL << p[i].first, ++i;
        state[0][x] = 1;
    }
    else
        state[0][0] = 1;

    while (i < k)
    {
        while (pos < p[i].second)
        {
            state[1].reset();
            for (size_t i = 0; i < 1 << w; ++i)
                if (state[0][i])
                    find_transitions(i, 0, w, state[1]);
            swap(state[0], state[1]);
            ++pos;
        }

        size_t x = 0;
        size_t j = i;
        while (j < k && p[j].second == p[i].second)
            x |= 1ULL << p[j].first, ++j;
        i = j;

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

    while (pos < h - 1)
    {
        state[1].reset();
        for (size_t i = 0; i < 1 << w; ++i)
            if (state[0][i])
                find_transitions(i, 0, w, state[1]);
        swap(state[0], state[1]);
        ++pos;
    }

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

Compilation message

ltrominoes.cpp: In function 'void find_transitions(uint32_t, uint32_t, size_t, std::bitset<8192>&, size_t)':
ltrominoes.cpp:11:11: warning: comparison of integer expressions of different signedness: 'uint32_t' {aka 'unsigned int'} and 'int' [-Wsign-compare]
   11 |     if (i == (1 << w) - 1)
      |         ~~^~~~~~~~~~~~~~~
ltrominoes.cpp: In function 'int main()':
ltrominoes.cpp:62:34: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |             for (size_t i = 0; i < 1 << w; ++i)
      |                                ~~^~~~~~~~
ltrominoes.cpp:76:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |         for (size_t i = 0; i < 1 << w; ++i)
      |                            ~~^~~~~~~~
ltrominoes.cpp:85:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |         for (size_t i = 0; i < 1 << w; ++i)
      |                            ~~^~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 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 212 KB Output is correct
8 Correct 51 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 109 ms 308 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1174 ms 304 KB Output is correct
17 Correct 77 ms 212 KB Output is correct
18 Correct 463 ms 312 KB Output is correct
19 Correct 4 ms 212 KB Output is correct
20 Correct 1201 ms 304 KB Output is correct
21 Correct 460 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 3 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1331 ms 304 KB Output is correct
26 Correct 1361 ms 332 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 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 212 KB Output is correct
8 Correct 51 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 109 ms 308 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1174 ms 304 KB Output is correct
17 Correct 77 ms 212 KB Output is correct
18 Correct 463 ms 312 KB Output is correct
19 Correct 4 ms 212 KB Output is correct
20 Correct 1201 ms 304 KB Output is correct
21 Correct 460 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 3 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1331 ms 304 KB Output is correct
26 Correct 1361 ms 332 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Runtime error 1 ms 468 KB Execution killed with signal 6
29 Halted 0 ms 0 KB -