# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921037 | ttamx | The Kingdom of JOIOI (JOI17_joioi) | C++14 | 360 ms | 117864 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;
const int N=2005;
const int INF=1e9;
int n,m;
int a[N][N],lmx[N][N],rmx[N][N],lmn[N][N],rmn[N][N];
int mn=INF;
int bsearch(int i,int v){
int l=1,r=m;
while(l<r){
int m=(l+r)/2;
if(rmx[i][m]<=v)r=m;
else l=m+1;
}
return l;
}
bool check1(int d){
stack<pair<int,int>> s;
for(int i=1;i<=n;i++){
int p=upper_bound(lmx[i]+1,lmx[i]+m,mn+d)-lmx[i]-1;
while(!s.empty()&&s.top().second>p)s.pop();
s.emplace(i,p);
}
int lo=INF,hi=0,p;
for(int i=n;i>=1;i--){
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... |