# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670459 | Mahdi | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 1075 ms | 43816 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;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
const int N=2005;
int n, m, a[N][N], rens;
vector<int>v;
int num(bool x, bool y, int h){
int mx=1, mn=1e9;
if(x){
int r=(y ? m : -1);
for(int i=0;i<n;++i){
if(y){
int j=0;
for(;j<r;++j){
if(a[i][j]>h)
break;
}
r=j;
for(j=r;j<m;++j){
mn=min(mn, a[i][j]);
mx=max(mx, a[i][j]);
}
}
else{
int j=m-1;
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... |