Submission #3229815
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, o, 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; j <= n; j++){
for(l = 0; l <= n-k; l++){
for(m = l+k; m <= n; m++){
cnt = 0;
for(o = i; o < j; o++) if(v[l] <= p[o].y && p[o].y < v[m]) cnt++;
if(cnt >= k) ans = min(ans, (long long)(p[j-1].x - p[i].x)*(v[m-1] - v[l]));
}
}
}
}
printf("%lld\n", ans);
}
Submission Info
Submission Time |
|
Task |
D - Axis-Parallel Rectangle |
User |
k111111 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
746 Byte |
Status |
WA |
Exec Time |
39 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 |
0 / 400 |
Status |
|
|
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 |
WA |
1 ms |
256 KB |
subtask_1_10.txt |
AC |
2 ms |
256 KB |
subtask_1_11.txt |
WA |
1 ms |
256 KB |
subtask_1_12.txt |
AC |
2 ms |
256 KB |
subtask_1_13.txt |
AC |
2 ms |
256 KB |
subtask_1_14.txt |
WA |
1 ms |
256 KB |
subtask_1_15.txt |
WA |
1 ms |
256 KB |
subtask_1_16.txt |
AC |
7 ms |
256 KB |
subtask_1_17.txt |
AC |
7 ms |
256 KB |
subtask_1_18.txt |
WA |
7 ms |
256 KB |
subtask_1_19.txt |
AC |
7 ms |
256 KB |
subtask_1_2.txt |
AC |
1 ms |
256 KB |
subtask_1_20.txt |
AC |
7 ms |
256 KB |
subtask_1_21.txt |
WA |
1 ms |
256 KB |
subtask_1_22.txt |
AC |
3 ms |
256 KB |
subtask_1_23.txt |
AC |
39 ms |
256 KB |
subtask_1_24.txt |
WA |
1 ms |
256 KB |
subtask_1_3.txt |
WA |
1 ms |
256 KB |
subtask_1_4.txt |
AC |
10 ms |
256 KB |
subtask_1_5.txt |
AC |
15 ms |
256 KB |
subtask_1_6.txt |
AC |
9 ms |
256 KB |
subtask_1_7.txt |
AC |
8 ms |
256 KB |
subtask_1_8.txt |
AC |
2 ms |
256 KB |
subtask_1_9.txt |
AC |
1 ms |
256 KB |