結果
問題 |
No.3293 Golden Cross
|
ユーザー |
![]() |
提出日時 | 2025-10-03 22:36:47 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,245 ms / 2,000 ms |
コード長 | 9,800 bytes |
コンパイル時間 | 2,529 ms |
コンパイル使用メモリ | 224,436 KB |
実行使用メモリ | 7,716 KB |
最終ジャッジ日時 | 2025-10-03 22:37:23 |
合計ジャッジ時間 | 31,949 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 49 |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <deque> #include <forward_list> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iostream> #include <limits> #include <list> #include <map> #include <memory> #include <numeric> #include <optional> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); } template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); } template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); } template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec); template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr); template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec); template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa); template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec); template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa); template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp); template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp); template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl); template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; } template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr) #else #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif // max (c + x + y)(r + x) s.t. 2^bx x + 2^by y <= K lint Subsolve1(lint c, lint r, int bx, int by, int K) { if (bx <= by) { const lint x = K >> bx; return (c + x) * (r + x); } assert(bx > by); const int b = bx - by; const int md = (K % (1LL << bx)) >> by; K >>= bx; c += md; // max (c + x + 2^b y)(r + x) s.t. x + y <= K // max(c + 2^b K - (2^b - 1)x)(r + x) s.t. 0 <= x <= K const lint num = ((lint)K << b) + c - r * ((1LL << b) - 1); const lint x0 = clamp((num / ((1LL << b) - 1)) / 2, 0LL, (lint)K); // dbg(x0); auto eval = [&](lint x) -> lint { if (0 <= x and x <= K) { lint y = K - x; return (c + x + (y << b)) * (r + x); } else { return -1; } }; lint ret = 0; for (lint x = x0 - 1; x <= x0 + 1; ++x) chmax(ret, eval(x)); return ret; } lint Subsolve1BF(lint c, lint r, int bx, int by, int K) { lint ret = 0; for (lint x = 0; (x << bx) <= K; ++x) { const lint y = (K - (x << bx)) >> by; chmax(ret, (c + x + y) * (r + x)); } return ret; } // max (c + y)(r + z) s.t. 2^by y + 2^bz z <= K lint Subsolve2(lint c, lint r, int by, int bz, int K) { if (by < bz) { swap(c, r); swap(by, bz); } const int md = (K % (1LL << by)) >> bz; r += md; K >>= by; by -= bz; // max (c + y)(r + 2^by z) s.t. y + z == K const lint y0 = clamp<lint>(((r >> by) + (K - c)) / 2, 0, lint(K)); auto eval = [&](lint y) -> lint { if (0 <= y and y <= K) { lint z = K - y; return (c + y) * (r + (z << by)); } else { return -1; } }; lint ret = 0; for (lint y = y0 - 1; y <= y0 + 1; ++y) chmax(ret, eval(y)); return ret; } // max (c + x + y)(r + x + z) s.t. 2^bx x + 2^by y + 2^bz z <= K lint Subsolve(lint c, lint r, int bx, int by, int bz, int K) { lint ret = Subsolve1(c, r, bx, by, K); chmax(ret, Subsolve1(r, c, bx, bz, K)); chmax(ret, Subsolve2(c, r, by, bz, K)); return ret; } int main() { // REP(c, 50) REP(r, 50) REP(bx, 5) REP(by, 5) REP(K, 100) { // lint sol = Subsolve1(c, r, bx, by, K); // lint bru = Subsolve1BF(c, r, bx, by, K); // // chmax(ans2, Subsolve1BF(r, c, bx, bz, K)); // // chmax(ans2, Subsolve2(c, r, by, bz, K)); // if (sol != bru) { // dbg(c); // dbg(r); // dbg(bx); // dbg(by); // dbg(K); // dbg(sol); // dbg(bru); // return 0; // } // } int H, W, K; cin >> H >> W >> K; vector A(H, vector<int>(W)); vector B(H, vector<int>(W)); cin >> A >> B; dbg(K); dbg(A); dbg(B); lint ret = 0; REP(i, H) REP(j, W) { lint r = 0, c = 0; int by = 30, bz = 30; REP(row, H) { c += A.at(row).at(j); chmin(by, B.at(row).at(j)); } REP(col, W) { r += A.at(i).at(col); chmin(bz, B.at(i).at(col)); } chmax(ret, Subsolve(c, r, B.at(i).at(j), by, bz, K)); } cout << ret << '\n'; }