제출 #1176214

#제출 시각아이디문제언어결과실행 시간메모리
1176214lnwrice삶의 질 (IOI10_quality)C++20
0 / 100
8 ms320 KiB
#include "quality.h" #include <iostream> #include <vector> #include <set> #include <algorithm> using namespace std; int rectangle(int n, int m, 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++) { arr.clear(); for(k = i; k < i + h; k++) { for(l = 0; l < w; l++) { arr.insert(q[k][l]); } } c = *next(arr.begin(), t); if(c < min_) min_ = c; for(j = 0; j < m - w; j++) { for(k = i; k < i + w; k++) { auto it = lower_bound(arr.begin(), arr.end(), q[k][j]); arr.erase(it); arr.insert(q[k][j+w]); } 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...