| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347749 | sash01 | 삶의 질 (IOI10_quality) | C++20 | 5090 ms | 2216 KiB |
#include <bits/stdc++.h>
#include "quality.h"
using namespace std;
int a[3001][3001];
int rectangle(int r, int c, int h, int w, int q[3001][3001])
{
int mn=1e9;
for(int i=0; i<r; i++)
{
for(int j=0; j<c; j++)
{
vector <int> v;
if(i-h/2>=0&&i+h/2<r&&j-w/2>=0&&j+w/2<c)
{
for(int i1=i-h/2; i1<=i+h/2; i1++)
{
for(int j1=j-w/2; j1<=j+w/2; j1++)v.push_back(q[i1][j1]);
}
sort(v.begin(),v.end());
//cout<<i<<" "<<j<<" "<<v[v.size()/2]<<endl;
mn=min(mn,v[v.size()/2]);
}
}
}
return mn;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
