QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#590149#7733. Cool, It’s Yesterday Four Times MoreshiftCompile Error//C++237.3kb2024-09-25 22:01:282024-09-25 22:01:29

Judging History

你现在查看的是最新测评结果

  • [2024-09-25 22:01:29]
  • 评测
  • [2024-09-25 22:01:28]
  • 提交

answer

// #pragma once

// C
#include <cassert>
#include <cctype>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <csetjmp>
#include <cstdarg>
#include <cstddef>
#include <cstdlib>
#include <cstdint>

// C++
#include <bitset>
#include <complex>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iterator>
#include <limits>
#include <memory>
#include <new>
#include <numeric>
#include <typeinfo>
#include <utility>
#include <array>
#include <atomic>
#include <initializer_list>
#include <ratio>
#include <scoped_allocator>
#include <tuple>
#include <typeindex>
#include <type_traits>

#if _HAS_CXX17
#include <any>
// #include <execution>
#include <optional>
#include <variant>
#include <string_view>
#endif

#if _HAS_CXX20
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>
#include <source_location>
#include <version>
#endif

#if _HAS_CXX23
#include <expected>
#include <stdatomic.h>
#if __cpp_impl_coroutine
#include <coroutine>
#endif
#endif

// C
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
// #include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cuchar>

// C++
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <shared_mutex>

#if _HAS_CXX17
#include <any>
#include <charconv>
// #include <execution>
#include <filesystem>
#include <optional>
#include <memory_resource>
#include <variant>
#endif

#if _HAS_CXX20
#include <barrier>
#include <bit>
#include <compare>
#include <concepts>
#include <format>
#include <latch>
#include <numbers>
#include <ranges>
#include <span>
#include <stop_token>
#include <semaphore>
#include <source_location>
#include <syncstream>
#include <version>
#endif

#if _HAS_CXX23
#include <expected>
#include <spanstream>
#if __has_include(<stacktrace>)
#include <stacktrace>
#endif
#include <stdatomic.h>
#include <stdfloat>
#endif
using i64 = long long;

// https://github.com/Heltion/debug.h/blob/main/debug.h

template <class T, size_t size = std::tuple_size<T>::value> std::string to_debug(T, std::string s = "") requires(not std::ranges::range<T>);
std::string to_debug(auto x) requires requires(std::ostream& os) { os << x; } { return static_cast<std::ostringstream>(std::ostringstream() << x).str(); }
std::string to_debug(std::ranges::range auto x, std::string s = "") requires(not std::is_same_v<decltype(x), std::string>) {
    for (auto xi : x) { s += ", " + to_debug(xi); }
    return "[" + s.substr(s.empty() ? 0 : 2) + "]";
}
template <class T, size_t size> std::string to_debug(T x, std::string s) requires(not std::ranges::range<T>) {
    [&]<size_t... I>(std::index_sequence<I...>) { ((s += ", " + to_debug(get<I>(x))), ...); }(std::make_index_sequence<size>());
    return "(" + s.substr(s.empty() ? 0 : 2) + ")";
}

#define debug(...) std::cerr << __FILE__ ":" << __LINE__ << ": (" #__VA_ARGS__ ") = " << to_debug(std::tuple(__VA_ARGS__)) << "\n"


void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<std::string> g(n);
    for(int i = 0; i < n; i ++ ) {
        std::cin >> g[i];
    }

    int can[n][m][n][m];
    std::array<int, 4> vis[n][m][n][m];
    
    for(int i = 0; i < n; i ++ ) {
        for(int j = 0; j < m; j ++ ) {
            for(int u = 0; u < n; u ++ ) {
                for(int v = 0; v < m; v ++ ) {
                    can[i][j][u][v] = 0;
                    vis[i][j][u][v] = {-1, -1, -1, -1};
                }
            }
        }
    }

    static int dx[] = {0, 0, -1, 1};
    static int dy[] = {-1, 1, 0, 0};
    
    auto bfs = [&]() -> void {
        auto ok = [&](int i, int j) -> bool  {
            return (i >= 0 and i < n and j >= 0 and j < m and g[i][j] == '.');
        };
        
        auto Go = [&](int sa, int sb, int sc, int sd) -> void {
            std::queue<std::tuple<int, int, int, int>> q;
            q.push({sa, sb, sc, sd});
            vis[sa][sb][sc][sd] = {sa, sb, sc, sd};
            while(not q.empty()) {
                auto [a, b, c, d] = q.front(); q.pop();
                for(int i = 0; i < 4; i ++ ) {
                    int ra = a + dx[i], rb = b + dy[i];
                    int rc = c + dx[i], rd = d + dy[i];
                    if(not ok(ra, rb)) continue;
                    if(not ok(rc, rd)) {
                        auto [i1, j1, i2, j2] = vis[a][b][c][d];
                        can[i1][j1][i2][j2] = true;
                    }
                    if(vis[ra][rb][rc][rd][0] != -1) continue;
                    q.push({ra, rb, rc, rd});
                    vis[ra][rb][rc][rd] = vis[a][b][c][d];
                }
            }
        };
        
        for(int i = 0; i < n; i ++ ) {
            for(int j = 0; j < m; j ++ ) {
                for(int u = 0; u < n; u ++ ) {
                    for(int v = 0; v < m; v ++ ) {
                        if(g[i][j] == '.' and g[u][v] == '.') {
                            if(vis[i][j][u][v][0] == -1) {
                                Go(i, j, u, v);
                            }
                        }
                    }
                }
            }
        }
    };

    bfs();

    int ans = 0;
    for(int a = 0; a < n; a ++ ) {
        for(int b = 0; b < m; b ++ ) {
            if(g[a][b] != '.') continue;
            int ok = true;
            for(int c = 0; c < n; c ++ ) {
                for(int d = 0; d < m; d ++ ) {
                    if((a != c or b != d) and g[a][b] == '.' and g[c][d] == '.') {
                        auto [i1, j1, i2, j2] = vis[a][b][c][d];
                        ok &= can[i1][j1][i2][j2];
                    }
                }
            }
            ans += ok;
        }
    }

    std::cout << ans << '\n';
}

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

    int T = 1;
    std::cin >> T;
    while(T -- ) {
        solve();
    }
    return 0;
}

详细

answer.code: In lambda function:
answer.code:233:13: sorry, unimplemented: capture of variably-modified type ‘std::array<int, 4> [n][m][n][m]’ that is not an N3639 array of runtime bound
  233 |             vis[sa][sb][sc][sd] = {sa, sb, sc, sd};
      |             ^~~
answer.code:233:13: note: because the array element type ‘std::array<int, 4> [m][n][m]’ has variable size
answer.code:241:49: sorry, unimplemented: capture of variably-modified type ‘std::array<int, 4> [n][m][n][m]’ that is not an N3639 array of runtime bound
  241 |                         auto [i1, j1, i2, j2] = vis[a][b][c][d];
      |                                                 ^~~
answer.code:241:49: note: because the array element type ‘std::array<int, 4> [m][n][m]’ has variable size
answer.code:242:25: sorry, unimplemented: capture of variably-modified type ‘int [n][m][n][m]’ that is not an N3639 array of runtime bound
  242 |                         can[i1][j1][i2][j2] = true;
      |                         ^~~
answer.code:242:25: note: because the array element type ‘int [m][n][m]’ has variable size
answer.code:244:24: sorry, unimplemented: capture of variably-modified type ‘std::array<int, 4> [n][m][n][m]’ that is not an N3639 array of runtime bound
  244 |                     if(vis[ra][rb][rc][rd][0] != -1) continue;
      |                        ^~~
answer.code:244:24: note: because the array element type ‘std::array<int, 4> [m][n][m]’ has variable size
answer.code:246:21: sorry, unimplemented: capture of variably-modified type ‘std::array<int, 4> [n][m][n][m]’ that is not an N3639 array of runtime bound
  246 |                     vis[ra][rb][rc][rd] = vis[a][b][c][d];
      |                     ^~~
answer.code:246:21: note: because the array element type ‘std::array<int, 4> [m][n][m]’ has variable size
answer.code:246:43: sorry, unimplemented: capture of variably-modified type ‘std::array<int, 4> [n][m][n][m]’ that is not an N3639 array of runtime bound
  246 |                     vis[ra][rb][rc][rd] = vis[a][b][c][d];
      |                                           ^~~
answer.code:246:43: note: because the array element type ‘std::array<int, 4> [m][n][m]’ has variable size
answer.code: In lambda function:
answer.code:256:32: sorry, unimplemented: capture of variably-modified type ‘std::array<int, 4> [n][m][n][m]’ that is not an N3639 array of runtime bound
  256 |                             if(vis[i][j][u][v][0] == -1) {
      |                                ^~~
answer.code:256:32: note: because the array element type ‘std::array<int, 4> [m][n][m]’ has variable size