結果

問題 No.165 四角で囲え！
ユーザー Konton7Konton7
提出日時 2020-06-06 16:47:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 145 ms / 5,000 ms
コード長 6,346 bytes
コンパイル時間 2,766 ms
コンパイル使用メモリ 227,124 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-06 02:23:20
合計ジャッジ時間 4,820 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
6,812 KB
testcase_01 AC 2 ms
6,940 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 109 ms
6,940 KB
testcase_06 AC 21 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 43 ms
6,944 KB
testcase_12 AC 18 ms
6,940 KB
testcase_13 AC 17 ms
6,940 KB
testcase_14 AC 15 ms
6,944 KB
testcase_15 AC 12 ms
6,940 KB
testcase_16 AC 145 ms
6,944 KB
testcase_17 AC 86 ms
6,940 KB
testcase_18 AC 144 ms
6,940 KB
testcase_19 AC 114 ms
6,944 KB
testcase_20 AC 87 ms
6,940 KB
testcase_21 AC 88 ms
6,944 KB
testcase_22 AC 87 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T>
vector<T> cumsum(const vector<T> &v)
{
    T s = 0;
    vector<T> ret;

    rep(i, v.size())
    {
        s += v[i];
        s %= mod;
        ret.emplace_back(s);
    }
    return ret;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

string removezero(string &s)
{
    string ret;
    for (auto z : s)
        if (z != '0')
            ret += z;
    return ret;
}

ll sumdigit(ll x)
{
    ll ans{0};
    while (x > 0)
    {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
    rep(i, frac_list.size() - 1)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    if (a < b)
        return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

const int l = -2e9 - 10;
const int r = 2e9 + 10;
template <typename T>
void coordinate_compress(vector<T> &x, map<T, int> &zip, int &xs)
{
    x.emplace_back(l), x.emplace_back(r);
    sort(x.begin(), x.end());
    x.erase(unique(x.begin(), x.end()), x.end());
    xs = x.size();
    for (int i = 0; i < xs; i++)
    {
        zip[x[i]] = i;
    }
}

void cumsum_2d(VVL &field, int h, int w)
{
    ll s;
    rep(i, h)
    {
        s = 0;
        rep(j, w)
        {
            s += field[i][j];
            field[i][j] = s;
        }
    }
    rep(j, w)
    {
        s = 0;
        rep(i, h)
        {
            s += field[i][j];
            field[i][j] = s;
        }
    }
}

struct point
{
    int y;
    int x;
};



int main()
{

    cin.tie(0);
    ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, h, w, l, r, u, d;
    ll p, b, ans{0};
    cin >> n >> b;
    vector<point> points(n);
    map<int, int> yzip, xzip;
    VI values(n), y_list, x_list;
    rep(i, n)
    {
        cin >> points[i].x >> points[i].y >> values[i];
        y_list.emplace_back(points[i].y);
        x_list.emplace_back(points[i].x);
    }

    // show1dvec(x_list);
    // show1dvec(y_list);
    coordinate_compress(x_list, xzip, w);
    coordinate_compress(y_list, yzip, h);

    VVL points_field(h, VL(w, 0));
    VVL values_field(h, VL(w, 0));

    rep(i, n)
    {
        values_field[yzip[points[i].y]][xzip[points[i].x]] = values[i];
        points_field[yzip[points[i].y]][xzip[points[i].x]] = 1;
    }

    cumsum_2d(points_field, h, w);
    cumsum_2d(values_field, h, w);
    // show2dvec(points_field);
    // show2dvec(values_field);

    rep(i, h - 1)rep(j, w - 1)
    {
        u = i;
        l = j;
        r = l + 1;
        d = h - 1;
        while (r < w && d > u)
        {
            p = values_field[u][l] - values_field[d][l] - values_field[u][r] + values_field[d][r];
            if (p > b)
            {
                d--;
            }
            else
            {
                ans = max(points_field[u][l] - points_field[d][l] - points_field[u][r] + points_field[d][r], ans);
                r++;
            }
        }
    }
    cout << ans << rt;

    return 0;
}
0