Submission #2703222


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair



int miny(int K, vi& ys) {
    int m = ys.size();
    if (m < K) return -1;
    int best = 0x7fffffff;
    for (int i=0; i<=m-K; ++i) {
        for (int j=i+K-1; j<m; ++j) {
            int d = ys[j] - ys[i];
            best = min(best, d);
        }
    }
    return best;
}

ll solve(int N,int K,vi& x,vi& y) {
    vector<ii> xy(N);

    rep(i,N) xy[i] = ii(x[i], y[i]);
    sort(ALL(xy));

    ll best = 0x7fffffffffffffffLL;
    repC2(i,j,N) {
        int x0 = xy[i].first, x1 = xy[j].first, dx = x1 - x0;
        vi ys;
        for (int u=i; u<=j; ++u) ys.pb(xy[u].second);
        sort(ALL(ys));

        int dy = miny(K, ys);
#ifdef DEBUG
        fprintf(stderr, "(%d,%d): %d-%d=%d; ", i,j, x0,x1,dx);
        cerr << ys << ",K=" << K << " -> " << dy << endl;
#endif
        if (dy < 0) continue;

        ll area = (ll)dx * dy;
        best = min(best, area);
    }
    return best;
}

int main() {
    int N,K;cin >>N>>K;
    vi x(N),y(N);
    rep(i,N) cin >> x[i] >> y[i];
    cout << solve(N,K,x,y) << endl;
    // cout << (solve(N,a) ? "Yes":"No") << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Axis-Parallel Rectangle
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 2353 Byte
Status
Exec Time 2 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 400 / 400 sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
subtask_1_1.txt 1 ms 256 KB
subtask_1_10.txt 1 ms 256 KB
subtask_1_11.txt 1 ms 256 KB
subtask_1_12.txt 1 ms 256 KB
subtask_1_13.txt 1 ms 256 KB
subtask_1_14.txt 1 ms 256 KB
subtask_1_15.txt 1 ms 256 KB
subtask_1_16.txt 2 ms 256 KB
subtask_1_17.txt 2 ms 256 KB
subtask_1_18.txt 2 ms 256 KB
subtask_1_19.txt 2 ms 256 KB
subtask_1_2.txt 1 ms 256 KB
subtask_1_20.txt 2 ms 256 KB
subtask_1_21.txt 1 ms 256 KB
subtask_1_22.txt 1 ms 256 KB
subtask_1_23.txt 2 ms 256 KB
subtask_1_24.txt 2 ms 256 KB
subtask_1_3.txt 1 ms 256 KB
subtask_1_4.txt 2 ms 256 KB
subtask_1_5.txt 2 ms 256 KB
subtask_1_6.txt 2 ms 256 KB
subtask_1_7.txt 2 ms 256 KB
subtask_1_8.txt 1 ms 256 KB
subtask_1_9.txt 2 ms 256 KB