Submission #338638

#TimeUsernameProblemLanguageResultExecution timeMemory
338638blue삶의 질 (IOI10_quality)C++17
0 / 100
3 ms492 KiB
#include "quality.h" #include <vector> #include <algorithm> using namespace std; int rectangle(int R, int C, int H, int W, int Q[3001][3001]) { int res = 0; vector<int> temp; for(int i = H-1; i < R; i++) { for(int j = W-1; j < C; j++) { temp.clear(); for(int x = i-H+1; x <= i; x++) { for(int y = j-W+1; y <= j; y++) { temp.push_back(Q[x][y]); } } sort(temp.begin(), temp.end()); res = max(res, temp[temp.size()/2]); } } return res; }
#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...