Submission #3619951


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define INF 5e+19
#define ll long long
int main(){
  ll ans = INF;
  int n,k;
  cin >> n >> k;
  ll x[n], y[n];
  for(int i=0;i<n;i++){
    cin >> x[i] >> y[i];
  }
  for(int i=0;i<n;i++){
    for(int j=i;j<n;j++){
      ll xmax = max(x[i],x[j]), xmin = min(x[i],x[j]);
      ll ymax = max(y[i],y[j]), ymin = min(y[i],y[j]);
      int cnt = 0;
      for(int K=0;K<n;i++){
        if(xmax>=x[K] && xmin<=x[K] && ymax >= y[K] && ymin <= y[K]){
          cnt++;
        }
      }
      if(cnt >= k){
        ans = min(ans, (xmax-xmin)*(ymax-ymin));
      }
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task D - Axis-Parallel Rectangle
User kilattoeruru
Language C++14 (GCC 5.4.1)
Score 0
Code Size 661 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:3:13: warning: overflow in implicit constant conversion [-Woverflow]
 #define INF 5e+19
             ^
./Main.cpp:6:12: note: in expansion of macro ‘INF’
   ll ans = INF;
            ^

Judge Result

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