Submission #1175852

#TimeUsernameProblemLanguageResultExecution timeMemory
1175852nightingaleQuality Of Living (IOI10_quality)C++20
40 / 100
5088 ms2420 KiB
#include <bits/stdc++.h>
using namespace std;

long long rectangle(int r, int c, int h, int w, int city[3001][3001]) 
{
    long long best = LLONG_MAX; 
    for(int i = 0; i < r-h+1; i++) {
        for(int j = 0; j < c-w+1; j++) {
            vector<int> meh;
            for(int k = 0; k < h; k++) {
                for(int m = 0; m < w; m++) {
                    meh.push_back(city[i+k][j+m]);
                }
            }
            sort(meh.begin(), meh.end());
            long long median = meh[((meh.size()+1)/2)-1];
            if(median < best) best = median;
        }
    }
    return best;
}
#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...