#921503 (C++23) No.2509 Beam Shateki

提出ソース

結果

問題	No.2509 Beam Shateki
ユーザー	nono00
提出日時	2023-10-20 23:36:54
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	8,863 bytes
コンパイル時間	3,317 ms
コンパイル使用メモリ	267,376 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-20 23:38:34
合計ジャッジ時間	6,326 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	3 ms 6,940 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	3 ms 6,940 KB
testcase_14	AC	3 ms 6,940 KB
testcase_15	AC	3 ms 6,940 KB
testcase_16	AC	3 ms 6,944 KB
testcase_17	AC	4 ms 6,940 KB
testcase_18	AC	3 ms 6,940 KB
testcase_19	AC	3 ms 6,940 KB
testcase_20	AC	3 ms 6,940 KB
testcase_21	AC	3 ms 6,940 KB
testcase_22	AC	3 ms 6,940 KB
testcase_23	AC	3 ms 6,944 KB
testcase_24	AC	3 ms 6,940 KB
testcase_25	AC	3 ms 6,944 KB
testcase_26	AC	3 ms 6,940 KB
testcase_27	AC	3 ms 6,940 KB
testcase_28	AC	3 ms 6,944 KB
testcase_29	AC	3 ms 6,948 KB
testcase_30	AC	3 ms 6,944 KB
testcase_31	AC	3 ms 6,940 KB
testcase_32	AC	3 ms 6,940 KB
testcase_33	AC	2 ms 6,944 KB
testcase_34	AC	2 ms 6,944 KB
testcase_35	AC	3 ms 6,940 KB
testcase_36	RE	-
testcase_37	RE	-
testcase_38	AC	2 ms 6,944 KB
testcase_39	RE	-
testcase_40	AC	3 ms 6,944 KB
testcase_41	RE	-
testcase_42	RE	-
testcase_43	RE	-
testcase_44	RE	-
testcase_45	RE	-
testcase_46	RE	-
testcase_47	AC	3 ms 6,944 KB
testcase_48	AC	2 ms 6,940 KB
testcase_49	RE	-
testcase_50	AC	3 ms 6,940 KB
testcase_51	RE	-
testcase_52	RE	-
testcase_53	AC	2 ms 6,940 KB
testcase_54	AC	2 ms 6,940 KB
testcase_55	AC	2 ms 6,944 KB
testcase_56	AC	2 ms 6,940 KB
testcase_57	AC	2 ms 6,944 KB
testcase_58	AC	2 ms 6,940 KB
testcase_59	AC	2 ms 6,940 KB
testcase_60	AC	2 ms 6,940 KB
testcase_61	WA	-
testcase_62	AC	2 ms 6,944 KB
testcase_63	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

#include <initializer_list>
#include <vector>

namespace nono {

template <typename T>
class Matrix {
  public:
    Matrix() = default;
    Matrix(int row, int column): row_(row), column_(column), data_(row, std::vector<T>(column)) {}
    Matrix(int row, int column, T elem): row_(row), column_(column), data_(row, std::vector<T>(column, elem)) {}
    explicit Matrix(const std::vector<std::vector<T>>& data)
        : row_(data.size()),
          column_(data.front().size()),
          data_(data) {
        for (int i = 0; i < row_; i++) {}
    }
    Matrix(std::initializer_list<std::vector<T>> init): data_(init.begin(), init.end()) {
        row_ = data_.size();
        column_ = data_.front().size();
        for (int i = 0; i < row_; i++) {}
    }

    const std::vector<T>& operator[](const int pos) const {
        return data_[pos];
    }

    std::vector<T>& operator[](const int pos) {
        return data_[pos];
    }

    Matrix& operator+=(const T rhs) {
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                data_[i][j] += rhs;
            }
        }
        return *this;
    }

    Matrix& operator-=(const T rhs) {
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                data_[i][j] -= rhs;
            }
        }
        return *this;
    }

    Matrix& operator*=(const T rhs) {
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                data_[i][j] *= rhs;
            }
        }
        return *this;
    }

    Matrix& operator/=(const T rhs) {
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                data_[i][j] /= rhs;
            }
        }
        return *this;
    }

    friend Matrix operator+(const Matrix& lhs, const T rhs) {
        return Matrix(lhs) += rhs;
    }
    friend Matrix operator+(const T lhs, const Matrix& rhs) {
        return Matrix(rhs) += lhs;
    }
    friend Matrix operator-(const Matrix& lhs, const T rhs) {
        return Matrix(lhs) -= rhs;
    }
    friend Matrix operator-(const T lhs, const Matrix& rhs) {
        return Matrix(rhs) -= lhs;
    }
    friend Matrix operator*(const Matrix& lhs, const T rhs) {
        return Matrix(lhs) *= rhs;
    }
    friend Matrix operator*(const T lhs, const Matrix& rhs) {
        return Matrix(rhs) *= lhs;
    }
    friend Matrix operator/(const Matrix& lhs, const T rhs) {
        return Matrix(lhs) /= rhs;
    }
    friend Matrix operator/(const T lhs, const Matrix& rhs) {
        return Matrix(rhs) /= lhs;
    }

    Matrix& operator+=(const Matrix& rhs) {
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                data_[i][j] += rhs.data_[i][j];
            }
        }
        return *this;
    }

    Matrix& operator-=(const Matrix& rhs) {
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                data_[i][j] -= rhs.data_[i][j];
            }
        }
        return *this;
    }

    Matrix& operator*=(const Matrix& rhs) {
        std::vector<std::vector<T>> mat(row_, std::vector<T>(rhs.column_));
        for (int i = 0; i < row_; i++) {
            for (int k = 0; k < column_; k++) {
                for (int j = 0; j < rhs.column_; j++) {
                    mat[i][j] += data_[i][k] * rhs.data_[k][j];
                }
            }
        }
        data_ = std::move(mat);
        column_ = rhs.column_;
        return *this;
    }

    friend Matrix operator+(const Matrix& lhs, const Matrix& rhs) {
        return Matrix(lhs) += rhs;
    }
    friend Matrix operator-(const Matrix& lhs, const Matrix& rhs) {
        return Matrix(lhs) -= rhs;
    }
    friend Matrix operator*(const Matrix& lhs, const Matrix& rhs) {
        return Matrix(lhs) *= rhs;
    }

    [[nodiscard]] Matrix pow(long long exp) const {
        Matrix result(row_, column_);
        Matrix base(*this);
        for (int i = 0; i < row_; i++) {
            result[i][i] = static_cast<T>(1);
        }
        while (exp > 0) {
            if (exp & 1) {
                result *= base;
            }
            base *= base;
            exp >>= 1;
        }
        return result;
    }

    [[nodiscard]] Matrix rotate() {
        std::vector<std::vector<T>> result(column_, std::vector<T>(row_));
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                result[j][row_ - i - 1] = data_[i][j];
            }
        }
        return Matrix(result);
    }

    [[nodiscard]] Matrix transpose() {
        std::vector<std::vector<T>> result(column_, std::vector<T>(row_));
        for (int i = 0; i < row_; i++) {
            for (int j = 0; j < column_; j++) {
                result[j][i] = data_[i][j];
            }
        }
        return Matrix(result);
    }

    int row() {
        return row_;
    }

    int column() {
        return column_;
    }

  private:
    int row_, column_;
    std::vector<std::vector<T>> data_;
};

}  //  namespace nono

namespace nono {

struct Init {};

void solve([[maybe_unused]] const Init& init) {
    int h, w;
    std::cin >> h >> w;
    Matrix<int> a(h, w);
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            std::cin >> a[i][j];
        }
    }

    int ans = 0;

    std::vector<int> row(h);
    std::vector<int> column(h);
    std::vector<int> naname1(h + w - 1);
    std::vector<int> naname2(h + w - 1);

    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            row[i] += a[i][j];
            column[j] += a[i][j];
            naname1[i + j] += a[i][j];
            naname2[h - 1 - i + j] += a[i][j];
        }
    }

    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            ans = std::max(ans, row[i] + column[j] - a[i][j]);
        }
    }

    for (int i = 0; i < h; i++) {
        for (int k = 0; k + 1 < h + w - 1; k++) {
            int j = k - i;
            if (0 <= j && j < w) {
                ans = std::max(ans, row[i] + naname1[k] - a[i][j]);
            } else {
                ans = std::max(ans, row[i] + naname1[k]);
            }
        }
    }

    for (int i = 0; i < h; i++) {
        for (int k = 0; k + 1 < h + w - 1; k++) {
            int j = k - h + 1 + i;
            if (0 <= j && j < w) {
                ans = std::max(ans, row[i] + naname2[k] - a[i][j]);
                if (row[i] + naname2[k] - a[i][j] == 24) {
                    std::cerr << i << ' ' << j << ' ' << k << std::endl;
                }
            } else {
                ans = std::max(ans, row[i] + naname2[k]);
            }
        }
    }

    for (int j = 0; j < w; j++) {
        for (int k = 0; k + 1 < h + w - 1; k++) {
            int i = k - j;
            if (0 <= i && i < h) {
                ans = std::max(ans, column[j] + naname1[k] - a[i][j]);
            } else {
                ans = std::max(ans, column[j] + naname1[k]);
            }
        }
    }

    for (int j = 0; j < w; j++) {
        for (int k = 0; k + 1 < h + w - 1; k++) {
            int i = h - 1 + j - k;
            if (0 <= i && i < h) {
                ans = std::max(ans, column[j] + naname1[k] - a[i][j]);
            } else {
                ans = std::max(ans, column[j] + naname1[k]);
            }
        }
    }

    for (int k1 = 0; k1 + 1 < h + w - 1; k1++) {
        for (int k2 = 0; k2 + 1 < h + w - 1; k2++) {
            bool flag = false;
            if ((k1 + k2 - h + 1) % 2 == 0) {
                int j = (k1 + k2 - h + 1) / 2;
                int i = k1 - j;
                if (0 <= i && i < h && 0 <= j && j < w) {
                    flag = true;
                    ans = std::max(ans, naname1[k1] + naname2[k2] - a[i][j]);
                }
            }
            if (!flag) {
                ans = std::max(ans, naname1[k1] + naname2[k2]);
            }
        }
    }

    std::ranges::sort(row, std::greater());
    std::ranges::sort(column, std::greater());
    std::ranges::sort(naname1, std::greater());
    std::ranges::sort(naname2, std::greater());

    ans = std::max(ans, row[0]);
    ans = std::max(ans, column[0]);
    ans = std::max(ans, naname1[0]);
    ans = std::max(ans, naname2[0]);
    if (row.size() > 1) ans = std::max(ans, row[0] + row[1]);
    if (column.size() > 1) ans = std::max(ans, column[0] + column[1]);
    if (naname1.size() > 1) ans = std::max(ans, naname1[0] + naname1[1]);
    if (naname2.size() > 1) ans = std::max(ans, naname2[0] + naname2[1]);

    std::cout << ans << std::endl;
}

}  //  namespace nono

int main() {
    std::cin.tie(0)->sync_with_stdio(0);
    std::cout << std::fixed << std::setprecision(16);

    int t = 1;
    nono::Init init;

    while (t--) nono::solve(init);
}

yukicoder

結果

テストケース

ソースコード