Submission #7329944

---

Source Code Expand

// 42:13
#define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll, ll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define INF 1111111111111111111LL
#define MOD 1000000007LL  // 10**9 + 7
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#endif
template <typename Head>
void dump_1(const char* str, Head&& h)
{
    cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char* str, Head&& h, Tail&&... t)
{
    while (*str != ',') {
        cerr << *str++;
    }
    cerr << ": " << h << ' ';
    dump_1(str + 1, t...);
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& v)
{
    os << '(' << v.first << ", " << v.second << ')';
    return os;
}
template <typename T1, typename T2, typename T3>
ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& v)
{
    os << '(' << get<0>(v) << ", " << get<1>(v) << ", " << get<2>(v) << ')';
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const map<T1, T2>& v)
{
    os << '{';
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ", ";
        }
        os << it->first << ':' << it->second;
    }
    os << '}';
    return os;
}
void Yes(void) { cout << "Yes" << '\n'; }
void No(void) { cout << "No" << '\n'; }
void YES(void) { cout << "YES" << '\n'; }
void NO(void) { cout << "NO" << '\n'; }
template <typename T>
void chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
    }
}
template <typename T>
void chmin(T& a, const T& b)
{
    if (a > b) {
        a = b;
    }
}
template <typename T>
void vin(vector<T>& v, ll len)
{
    for1 (i, len) {
        cin >> v[i];
    }
}
template <typename Head>
void in_1(Head& h)
{
    cin >> h;
}
template <typename Head, typename... Tail>
void in_1(Head& h, Tail&... t)
{
    cin >> h;
    in_1(t...);
}
template <typename Head>
void print_1(Head&& h)
{
    cout << h << '\n';
}
template <typename Head, typename... Tail>
void print_1(Head&& h, Tail&&... t)
{
    cout << h << ' ';
    print_1(t...);
}
//---------------------------------------------------------
void solve()
{
    ll N;
    in(N);
    vvll D(N, vll(N));
    vvll D1(N + 1, vll(N + 1));
    vvll D2(N + 1, vll(N + 1));
    for1 (h, N) {
        for1 (w, N) {
            // in(D[h][w]);
            cin >> D[h][w];
        }
    }
    ll Q;
    in(Q);
    vll P(Q);
    for1 (i, Q) {
        // in(P[i]);
        cin >> P[i];
    }

    for1 (h, N) {
        D1[h][0] = 0;
        for1 (w, N) {
            D1[h][w + 1] = D1[h][w] + D[h][w];
        }
    }
    for1 (w, N + 1) {
        D2[0][w] = 0;
        for1 (h, N) {
            D2[h + 1][w] = D2[h][w] + D1[h][w];
        }
    }

    for1 (h, N + 1) {
        for1 (w, N + 1) {
            cerr << D2[h][w] << " ";
        }
        cerr << endl;
    }

    for1 (i, Q) {
        ll ans = 0;
        set<ll> div;
        div.clear();
        for (ll j = 1; j * j <= P[i]; ++j) {
            if (P[i] % j == 0) {
                div.insert(j);
                div.insert(P[i] / j);
            }
        }
        for (ll w : div) {
            ll h = P[i] / w;
            dump(h, w);
            chmin(h, N);
            chmin(w, N);
            // dump(h, w);
            for1 (h2, N - h + 1) {
                for1 (w2, N - w + 1) {
                    ll area = D2[h2 + h][w2 + w] - D2[h2 + h][w2] -
                              D2[h2][w2 + w] + D2[h2][w2];
                    chmax(ans, area);
                }
            }
        }
        print(ans);
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(20);
    solve();
}

Submission Info

Judge Result