Submission #619849

#TimeUsernameProblemLanguageResultExecution timeMemory
619849Icebear16Quality Of Living (IOI10_quality)C++14
40 / 100
5059 ms2832 KiB
#include "quality.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e18//change to const int INF=1e18 if causing problem
const ll MOD=998244353;
const ll alt=1e10;
const ll inf=1e9+7;//Precalc is not a bad idea
//#define int ll
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define mod(a) (a+inf)%inf
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()  

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	int ans=0;
	for(int i=H-1;i<R;i++){
		for(int j=W-1;j<C;j++){
			vector<int> v;
			v.clear();
			for(int k=(i+1-H);k<=i;k++){
				for(int l=(j+1-W);l<=j;l++){
					v.pb(Q[k][l]);
				}
			}
			sort(all(v));
			int y=sz(v);
			y/=2;
			if(ans==0) ans=v[y];
			else ans=min(ans,v[y]);
		}
	}
	return ans;
}
//Icebear16
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...