結果

問題 No.3293 Golden Cross
コンテスト
ユーザー noya2
提出日時 2025-10-06 22:58:14
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,691 bytes
コンパイル時間 3,393 ms
コンパイル使用メモリ 292,164 KB
実行使用メモリ 7,716 KB
最終ジャッジ日時 2025-10-06 22:58:22
合計ジャッジ時間 7,790 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 48 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

struct dat {
    ll sum;
    int top1, top2;
    dat () : sum(0), top1(iinf), top2(iinf) {}
    void add(ll a, int b){
        sum += a;
        if (b < top1){
            top2 = top1;
            top1 = b;
        }
        else if (b < top2){
            top2 = b;
        }
    }
    pli get(ll, int b){
        return {sum, (top1 == b ? top2 : top1)};
    }
};

// max(a + x) (b - cx), 0 <= x <= d

ll calc(ll a, ll b, ll c, ll d){
    auto eval = [&](ll x){
        if (b - c*x <= 0) return 0LL;
        return (a + x) * (b - c*x);
    };
    ll ans = 0;
    chmax(ans,eval(0));
    chmax(ans,eval(d));
    // (-a + b/c) / 2
    ll ctr = floor_div(-a*c*2+b,2*c);
    for (ll x = ctr-1; x <= ctr+1; x++){
        chmax(ans,eval(clamp(x,0LL,d)));
    }
    return ans;
}

void solve(){
    // x + y == t
    // max (a + x) (b + x + 2^d y)
    // max (a + x) (b + x + 2^d (t - x))
    // max (a + x) (c - ex)
    // max e (a + x) (c/e - x)
    // x == (-a + c/e) / 2
    int h, w; in(h,w);
    ll k; in(k);
    vector a(h,vector<ll>(w)); in(a);
    vector b(h,vector<int>(w)); in(b);
    vector<dat> yoko(h), tate(w);
    rep(i,h) rep(j,w){
        yoko[i].add(a[i][j],b[i][j]);
        tate[j].add(a[i][j],b[i][j]);
    }
    ll ans = 0;
    rep(i,h) rep(j,w){
        ll x = a[i][j];
        int p = b[i][j];
        auto [y, q] = yoko[i].get(x,p);
        auto [z, r] = tate[j].get(x,p);
        if (p <= q && p <= r){
            ll t = k >> p;
            ll cur = (y + t) * (z + t);
            chmax(ans,cur);
        }
        else if (p <= q){
            ll t = k >> p;
            ll rc = (k - (t << p)) >> r;
            int d = p-r;
            chmax(ans,calc(y,z+rc+(t<<d),(1LL<<d)-1,t));
        }
        else if (p <= r){
            ll t = k >> p;
            ll qc = (k - (t << p)) >> q;
            int d = p-q;
            chmax(ans,calc(z,y+qc+(t<<d),(1LL<<d)-1,t));
        }
        else {
            if (q < r){
                swap(y,z);
                swap(q,r);
            }
            ll t = k >> q;
            ll rc = (k - (t << q)) >> r;
            // f + g == t
            // max (y + f) (z + rc + 2^(q-r)g)
            // max (y + f) (z + rc + 2^(q-r) (t-f))
            int d = q-r;
            chmax(ans,calc(y,z+rc+(t<<d),1LL<<d,t));
        }
    }
    out(ans);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0