Submission #1176217

#TimeUsernameProblemLanguageResultExecution timeMemory
1176217lnwriceQuality Of Living (IOI10_quality)C++20
40 / 100
5093 ms3140 KiB
#include "quality.h" #include <iostream> #include <vector> #include <set> #include <algorithm> using namespace std; int rectangle(int R, int C, int H, int W, int Q[3001][3001]) { const int n = R, m = C, h = H, w = W; const int MAX = 9000012, MAX_INT = 2000000024; int i, j, k, l; int t = (h*w)/2, min_ = MAX_INT, c; set<int> arr; for(i = 0; i <= n - h; i++) { for(j = 0; j <= m - w; j++) { arr.clear(); for(k = i; k < i + h; k++) { for(l = j; l < j + w; l++) { arr.insert(Q[k][l]); } } c = *next(arr.begin(), t); if(c < min_) min_ = c; } } return min_; }
#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...