제출 #797432

#제출 시각아이디문제언어결과실행 시간메모리
797432finn__L-triominoes (CEOI21_ltriominoes)C++17
0 / 100
8045 ms508 KiB
#include <bits/stdc++.h> using namespace std; constexpr size_t W = 13, K = 250; pair<size_t, size_t> p[K]; vector<uint32_t> transitions[1 << 13]; bitset<1 << W> state[2]; 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[y].push_back(j); 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[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]) for (size_t j : transitions[i]) state[1][j] = 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 |= 1 << 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]); } if (pos != h - 1) { state[1].reset(); for (size_t i = 0; i < 1 << w; ++i) if (state[0][i]) for (size_t j : transitions[i]) state[1][j] = 1; swap(state[0], state[1]); ++pos; } cout << (state[0][(1 << w) - 1] ? "YES" : "NO") << '\n'; }

컴파일 시 표준 에러 (stderr) 메시지

ltrominoes.cpp: In function 'int main()':
ltrominoes.cpp:22:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |     for (size_t y = 0; y < 1 << w; ++y)
      |                        ~~^~~~~~~~
ltrominoes.cpp:34:19: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |             if (i == (1 << w) - 1)
      |                 ~~^~~~~~~~~~~~~~~
ltrominoes.cpp:85:34: 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)
      |                                ~~^~~~~~~~
ltrominoes.cpp:100:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  100 |         for (size_t i = 0; i < 1 << w; ++i)
      |                            ~~^~~~~~~~
ltrominoes.cpp:109:30: 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)
      |                            ~~^~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...