# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
202064 | blacktulip | Maxcomp (info1cup18_maxcomp) | C++14 | 439 ms | 40364 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;
typedef long long lo;
typedef pair< lo,lo > PII;
typedef pair< lo,PII > PIII;
#define fi first
#define int long long
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1005;
const lo mod = 1000000007;
int n,m,b[li],a[li][li],k,flag,t;
int cev=-inf;
string s;
vector<PIII> v;
main(void){
scanf("%lld %lld",&n,&m);
FOR{
for(int j=1;j<=m;j++){
scanf("%lld",&a[i][j]);
v.pb(mp(a[i][j],mp(i,j)));
}
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
int bit=(int)v.size()-1;
bit=min(bit,50ll);
for(k=0;k<=bit;k++){
int co=v[k].fi;
int sat=v[k].se.fi;
int sut=v[k].se.se;
FOR{
for(int j=1;j<=m;j++){
cev=max(cev,abs(co-a[i][j])-abs(sat-i)-abs(sut-j)-1);
}
}
}
printf("%lld\n",cev);
return 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |