[Luogu] 矩形覆盖

https://www.luogu.org/problemnew/show/P1034

数据太水

爆搜过掉

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

const int N = ;

int n, K, Use[N], A[N], Answer = 1e7;
int Maxx, Minx, Maxy, Miny;
struct Node {int X, Y;} Point[N];

#define gc getchar()

inline int read() {
    int x = ; char c = gc;
    while(c < '' || c > '') c = gc;
    while(c >= '' && c <= '') x = x *  + c - '', c = gc;
    return x;
}

void Out() {
    int now_ans = ;
    Maxx = Maxy = ;
    Minx = Miny = 1e7;
    for(int i = ; i <= K; i ++) {
        for(int j = A[i - ] + ; j <= A[i]; j ++) {
            Maxx = std:: max(Maxx, Point[j].X);
            Maxy = std:: max(Maxy, Point[j].Y);
            Minx = std:: min(Minx, Point[j].X);
            Miny = std:: min(Miny, Point[j].Y);
        }
        now_ans += (Maxx - Minx) * (Maxy - Miny);
        Maxx = Maxy = ;
        Minx = Miny = 1e7;
    }
    if(now_ans < Answer) Answer = now_ans;
}

bool Cmp1(Node a, Node b) {
    if(a.X == b.X) return a.Y < b.Y;
    return a.X < b.X;
}
bool Cmp2(Node a, Node b) {
    if(a.Y == b.Y) return a.X < b.X;
    return a.Y < b.Y;
}

void Dfs(int tot) {
    if(tot == K) {Out(); return ;}
    for(int i = A[tot - ] + ; i <= n; i ++) {
        if(!Use[i]) {
            Use[i] = ;
            A[tot] = i;
            Dfs(tot + );
            Use[i] = ;
        }
    }
}

int main() {
    n = read(), K = read();
    for(int i = ; i <= n; i ++) Point[i].X = read(), Point[i].Y = read();
    std:: sort(Point + , Point + n + , Cmp1);
    A[K] = n;
    Dfs();
    std:: sort(Point + , Point + n + , Cmp2);
    Dfs();
    std:: cout << Answer;
    return ;
}