Submission #2855423
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef struct{ long long x,y; } Ten; void tensort(int n,Ten ten[]){ for(int i = 0;i < n-1;i++){ for(int j = n-1;j > i;j--){ if(ten[j-1].x > ten[j].x){ Ten tmp = ten[j-1]; ten[j-1] = ten[j]; ten[j] = tmp; } } } return; } int main(){ int n,K; cin >> n >> K; Ten ten[50]; for(int i = 0;i < n;i++){ cin >> ten[i].x >> ten[i].y; } tensort(n,ten); long long ans = LLONG_MAX; for(int i = 0;i < n-1;i++){ for(int j = i+1;j < n;j++){ int cnt = 2; vector<int> v; v.push_back(min(ten[i].y,ten[j].y)); v.push_back(max(ten[i].y,ten[j].y)); for(int k = i+1;k < j;k++){ if(ten[k].y >= min(ten[i].y,ten[j].y) && ten[k].y <= max(ten[i].y,ten[j].y)){ cnt++; } int tt; for(tt = 0;tt< v.size();tt++){ if(v[tt] > ten[k].y){ break; } } v.insert(v.begin() + tt,ten[k].y); } if(cnt >= K){ ans = min(ans,abs(ten[i].y - ten[j].y)*abs(ten[i].x-ten[j].x)); }else{ int tt; for(tt = 0;tt < v.size();tt++){ if(v[tt] == min(ten[i].y,ten[j].y)){ break; } } if(tt-(K-cnt) >= 0){ ans = min(ans,abs(max(ten[i].y,ten[j].y)-v[tt-(K-cnt)])*abs(ten[i].x-ten[j].x)); } for(tt = 0;tt < v.size();tt++){ if(v[tt] == max(ten[i].y,ten[j].y)){ break; } } if(tt+(K-cnt) < v.size()){ ans = min(ans,abs(min(ten[i].y,ten[j].y)-v[tt+(K-cnt)])*abs(ten[i].x-ten[j].x)); } } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Axis-Parallel Rectangle |
User | yta_smh17 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1792 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
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 | 1 ms | 256 KB |
subtask_1_11.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask_1_16.txt | AC | 2 ms | 256 KB |
subtask_1_17.txt | WA | 2 ms | 256 KB |
subtask_1_18.txt | WA | 2 ms | 256 KB |
subtask_1_19.txt | WA | 2 ms | 256 KB |
subtask_1_2.txt | AC | 1 ms | 256 KB |
subtask_1_20.txt | AC | 2 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 | WA | 2 ms | 256 KB |
subtask_1_3.txt | WA | 1 ms | 256 KB |
subtask_1_4.txt | WA | 2 ms | 256 KB |
subtask_1_5.txt | WA | 2 ms | 256 KB |
subtask_1_6.txt | AC | 2 ms | 256 KB |
subtask_1_7.txt | AC | 2 ms | 256 KB |
subtask_1_8.txt | AC | 2 ms | 256 KB |
subtask_1_9.txt | WA | 2 ms | 256 KB |