Submission #3230019


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
 
struct Point{int x, y;} p[55];
bool lessx(Point &a, Point &b){return a.x < b.x;}

int main(){
  int n, k, v[55], i, j, l, m, cnt;
  long long ans = 4e18;
  scanf("%d%d", &n, &k);
  for(i = 0; i < n; i++){
    scanf("%d%d", &p[i].x, &p[i].y);
    v[i] = p[i].y;
  }
  sort(p, p+n, lessx);
  sort(v, v+n);
  for(i = 0; i <= n-k; i++){
    for(j = i+k-1; j < n; j++){
      for(l = 0; l <= n-k; l++){
        cnt = 0;
        for(m = l; m < n && cnt < k; m++) if(v[i] <= p[m].y && p[m].y <= v[j]) cnt++;
        if(cnt < k) break;
        ans = min(ans, ((long long) v[j] - v[i])*(p[m-1].x - p[l].x));
      }
    }
  }
  printf("%lld\n", ans);
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &n, &k);
                        ^
./Main.cpp:12:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &p[i].x, &p[i].y);
                                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 27
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 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 AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_1.txt AC 1 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_12.txt AC 1 ms 256 KB
subtask_1_13.txt AC 1 ms 256 KB
subtask_1_14.txt AC 1 ms 256 KB
subtask_1_15.txt AC 1 ms 256 KB
subtask_1_16.txt AC 1 ms 256 KB
subtask_1_17.txt AC 1 ms 256 KB
subtask_1_18.txt AC 1 ms 256 KB
subtask_1_19.txt AC 1 ms 256 KB
subtask_1_2.txt AC 1 ms 256 KB
subtask_1_20.txt AC 1 ms 256 KB
subtask_1_21.txt AC 1 ms 256 KB
subtask_1_22.txt AC 1 ms 256 KB
subtask_1_23.txt AC 2 ms 256 KB
subtask_1_24.txt AC 1 ms 256 KB
subtask_1_3.txt AC 1 ms 256 KB
subtask_1_4.txt AC 2 ms 256 KB
subtask_1_5.txt AC 2 ms 256 KB
subtask_1_6.txt AC 2 ms 256 KB
subtask_1_7.txt AC 1 ms 256 KB
subtask_1_8.txt AC 1 ms 256 KB
subtask_1_9.txt AC 1 ms 256 KB