| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1116411 | staszic_ojuz | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 1 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int h,w;
int m[10][10];
long long ans = 1000000000;
void all(vector<int> q)
{
int max1 = 1000000000,max2 = 1000000000,min1 = 0,min2 =0;
if(q.size() != w)
{
for(int i = q[q.size()-1];i<w;i++)
{
q.push_back(i);
all(q);
q.pop_back();
}
}
else
{
for(int i = 0;i<w;i++)
{
for(int j = 0;j<h;j++)
{
if(j > q[i])
{
max1 = max(max1,m[j][i]);
min1 = min(min1,m[j][i]);
}
else
{
max2 = max(max2,m[j][i]);
min2 = min(min2,m[j][i]);
}
}
}
ans = min(ans,(long long)max(max2-min2,max1-min1));
}
}
int main()
{
cin>>h>>w;
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
cin>>m[i][j];
}
}
all({});
cout<<ans;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
