Submission #2548912


Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<cmath>
#include<iomanip>
using namespace std;

int INF = 1e9 + 7;

typedef long long ll;
typedef pair<int, int> P;

int main() {
	int n, k;
	cin >> n >> k;
	vector<ll> x(n+1), y(n+1);
	for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
	
	sort(x.begin()+1, x.end());
	sort(y.begin()+1, y.end());

	int sum = 0;
	ll MIN = 9e18;
	for (int xi = 1; xi <= n; xi++) {
		for (int xj = xi + 1; xj <= n; xj++) {
			for (int yi = 1; yi <= n; yi++) {
				for (int yj = yi + 1; yj <= n; yj++) {
					for (int i = 1; i <= n; i++) {
						if (x[xi] <= x[i] && x[i] <= x[xj] && y[yi] <= y[i] && y[i] <= y[yj]) {
							sum++;
						}
					}
					if (sum >= k) {
						MIN = min(MIN, (x[xj] - x[xi])*(y[yj] - x[yi]));
					}
					sum = 0;
				}
			}
		}
	}
	cout << MIN << endl;
}

Submission Info

Submission Time
Task D - Axis-Parallel Rectangle
User rodea0952
Language C++14 (GCC 5.4.1)
Score 0
Code Size 936 Byte
Status WA
Exec Time 123 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 3
WA × 24
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 3 ms 256 KB
subtask_1_10.txt WA 13 ms 256 KB
subtask_1_11.txt WA 1 ms 256 KB
subtask_1_12.txt WA 3 ms 256 KB
subtask_1_13.txt WA 4 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 WA 122 ms 256 KB
subtask_1_17.txt WA 123 ms 256 KB
subtask_1_18.txt WA 122 ms 256 KB
subtask_1_19.txt WA 122 ms 256 KB
subtask_1_2.txt WA 2 ms 256 KB
subtask_1_20.txt WA 121 ms 256 KB
subtask_1_21.txt WA 1 ms 256 KB
subtask_1_22.txt WA 5 ms 256 KB
subtask_1_23.txt WA 122 ms 256 KB
subtask_1_24.txt WA 121 ms 256 KB
subtask_1_3.txt WA 2 ms 256 KB
subtask_1_4.txt WA 53 ms 256 KB
subtask_1_5.txt WA 111 ms 256 KB
subtask_1_6.txt WA 33 ms 256 KB
subtask_1_7.txt WA 25 ms 256 KB
subtask_1_8.txt WA 19 ms 256 KB
subtask_1_9.txt WA 81 ms 256 KB