Submission #1175773

#	Time	Username	Problem	Language	Result	Execution time	Memory
1175773		PakinDioxide	Quality Of Living (IOI10_quality)	C++17	60 / 100	5095 ms	20008 KiB

quality

#include "quality.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

int rectangle(int n, int m, int h, int w, int a[3001][3001]) {
	Tree<int> s;
	int mn = INT_MAX;
	for (int i = 0; i+h-1 < n; i++) for (int j = 0; j+w-1 < m; j++) {
		if (j == 0) {
			s.clear();
			for (int x = i; x < i+h; x++) for (int y = j; y < j+w; y++) s.insert(a[x][y]);
		} else {
			for (int x = i; x < i+h; x++) s.erase(s.find(a[x][j-1])), s.insert(a[x][j+w-1]);
		}
		mn = min(mn, *s.find_by_order((h*w)/2));
	}
	return mn;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20