paintbarn.cpp

#include <iostream>
#include <string>
#include <utility>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <unordered_set>
#include <ctime>

using namespace std;

template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define F0R1(i, a) for (int i=1; i<=(a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define F0Rd1(i, a) for (int i=a; i>0; i--)
#define SORT(vec) sort(vec.begin(), vec.end())
#define MIN(a, b) a = min(a, b)
#define MAX(a, b) a = max(a, b)

#define INF 1000000010
#define LL_INF 4500000000000000000
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define pA first
#define pB second
#define mp make_pair
#define pb push_back
#define PI acos(-1.0)
#define ll long long
#define MOD (int)(2e+9+11)
#define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val;
#define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val;
#define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val;
#define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;
#define READGRID(arr, dim) F0R(i, dim) F0R(j, dim) cin >> arr[i][j];
#define all(x) (x).begin(), (x).end()

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vl;

void setupIO(const string &PROB) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ifstream infile(PROB + ".in");
    if (infile.good()) {
        freopen((PROB + ".in").c_str(), "r", stdin);
        freopen((PROB + ".out").c_str(), "w", stdout);
    }
}

/* ============================ */

int ct[210][210];

int getCt(int topBound, int botBound, int leftBound, int rightBound) {
    return ct[rightBound][topBound]
           - (botBound == -1 ? 0 : ct[rightBound][botBound])
           - (leftBound == -1 ? 0 : ct[leftBound][topBound])
           + (leftBound == -1 || botBound == -1 ? 0 : ct[leftBound][botBound]);
}

int main() {
    setupIO("paintbarn");

    int n, k; cin >>n >> k;
    int ps[210][210]; SET2D(ps, 0, 210, 210);
    int existing = 0;
    F0R(i, n) {
        int a, b, c, d; cin >> a >> b >> c >> d;
        ps[a][d]--;
        ps[c][d]++;
        ps[a][b]++;
        ps[c][b]--;
    }
    F0R(i, 210) {
        F0R(j, 210) {
            ps[i][j] += (i == 0 ? 0 : ps[i-1][j]) + (j == 0 ? 0 : ps[i][j-1]) - (i == 0 || j == 0 ? 0 : ps[i-1][j-1]);
            if (ps[i][j] == k) existing++;
        }
    }
    SET2D(ct, 0, 210, 210);
    F0R(i, 210) {
        F0R(j, 210) {
            ct[i][j] += (i == 0 ? 0 : ct[i-1][j]) + (j == 0 ? 0 : ct[i][j-1]) - (i == 0 || j == 0 ? 0 : ct[i-1][j-1]);
            if (ps[i][j] == k) ct[i][j]--;
            else if (ps[i][j] == k - 1) ct[i][j]++;
        }
    }

    int ans = 0;
    int bestMat[210][210]; SET2D(bestMat, 0, 210, 210);
    F0R(low, 200) {
        FOR(hi, low, 200) {
            int leftBound = -1;
            int sum = 0;
            F0R(rightBound, 200) {
                sum = getCt(hi, low - 1, leftBound, rightBound);
                MAX(ans, sum);
                MAX(ans, sum + max((leftBound <= 0 || hi <= 0 ? 0 : bestMat[leftBound - 1][hi - 1]), low <= 0 ? 0 : bestMat[199][low - 1]));
                MAX(bestMat[rightBound][hi], sum);
                if (rightBound > 0) MAX(bestMat[rightBound][hi], bestMat[rightBound - 1][hi]);
                if (hi > 0) MAX(bestMat[rightBound][hi], bestMat[rightBound][hi - 1]);
                if (sum < 0) {
                    leftBound = rightBound;
                }
            }
        }
    }
    cout << existing + ans << endl;

    return 0;
}