Submission #481667

#	Time	Username	Problem	Language	Result	Execution time	Memory
481667		ssense	Quality Of Living (IOI10_quality)	C++14	40 / 100	5083 ms	2248 KiB

quality

#include <bits/stdc++.h>
#include "quality.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
//int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}//ssense

int rectangle(int R, int C, int H, int W, int Q[3001][3001])
{
	int ans = 1000000000;
	for(int i = 0; i < R-H+1; i++)
	{
		for(int j = 0; j < C-W+1; j++)
		{
			vector<int> now;
			for(int k = i; k < i+H; k++)
			{
				for(int t = j; t < j+W; t++)
				{
					now.push_back(Q[k][t]);
				}
			}
			sort(now.begin(), now.end());
			ans = min(now[now.size()/2], ans);
		}
	}
	return ans;
}

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