Submission #287650

#TimeUsernameProblemLanguageResultExecution timeMemory
287650fgojkoQuality Of Living (IOI10_quality)C++14
40 / 100
5047 ms2672 KiB
#include <iostream>
#include <vector>
#include <algorithm>

//#define FEEDBACK

using namespace std;

int binaryFunction(vector<int>& vec, int value);
int rectangle(int n, int m, int x, int y, int mat[][3001]){
    vector<int> vec;
    int max = n*m;
    for(int i = 0; i <= n-x; ++i){
        for(int j = 0; j <= m-y; ++j){
            vec.resize(0);
            for(int a = i; a < i+x; ++a){
                for(int b =j; b < j+y; ++b){
                    vec.push_back(mat[a][b]);
                }
            }
            sort(vec.begin(), vec.end());
#ifdef FEEDBACK
            cout << "( " << i << ", " << j << " )\n";
            cout << "median = " << vec[vec.size()/2] << endl;
#endif // FEEDBACK
            if(max > vec[vec.size()/2]){
                max = vec[vec.size()/2];
            }
        }
    }
    return max;
}
#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...