# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574079 | groshi | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 460 ms | 54844 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<iostream>
using namespace std;
int h,w;
int t[2010][2010];
int minn=1e9,maxx=0;
bool lewy_min(int sre)
{
int lewo=w;
for(int i=1;i<=h;i++)
{
for(int j=lewo;j>=1;j--)
if(maxx-t[i][j]>sre)
lewo=j-1;
for(int j=lewo+1;j<=w;j++)
if(t[i][j]-minn>sre)
return 0;
}
return 1;
}
bool lewy_maxx(int sre)
{
int lewo=w;
for(int i=1;i<=h;i++)
{
for(int j=lewo;j>=1;j--)
if(t[i][j]-minn>sre)
lewo=j-1;
for(int j=lewo+1;j<=w;j++)
if(maxx-t[i][j]>sre)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |