제출 #1149365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1149365		arkanefury	Maxcomp (info1cup18_maxcomp)	C++20	100 / 100	482 ms	16808 KiB

maxcomp

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define sz size()
#define all(v) v.begin(),v.end()
#define FOR1(x, n) for(int j = x; j <= n; j ++)
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N =  1000+5;
int a[N][N], b[N];
int n,m,k,sum=0,x,y, ans, r, cnt, l, mod = 1e9+7;
void solve(){
    nikita
    cin >> n >> m;
    vector<pair<int, pair<int, int>>>q;
    ans = -1;
    FOR(i, 0, n+1, 1){
        FOR(j, -1, m+1, 1)a[i][j] = 1e9;
    }
    FOR(i, 1, n, 1){
        FOR(j, 1, m, 1){
            cin >> a[i][j];
            q.pb({a[i][j], {i, j}});
            
        }
    }
    FOR(i, 1, n, 1){
        FOR(j, 1, m, 1){
            k = min({a[i-1][j], a[i+1][j], a[i][j-1], a[i][j+1]});
            ans = max(ans, a[i][j] - k - 2);
        }
    }
    sort(all(q));
    FOR(i, max((int)0, (int)q.sz-(int)250), q.sz-1, 1){
        FOR(j, 0, i-1, 1){
            ans = max(ans, q[i].F - q[j].F - abs(q[i].S.F - q[j].S.F) - 1 - abs(q[i].S.S - q[j].S.S));
        }
        FOR(j, i+1, q.sz-1, 1){
            k = -q[i].F + q[j].F - abs(q[i].S.F - q[j].S.F) - 1 - abs(q[i].S.S - q[j].S.S);
            ans = max(ans, k);
        }
    }
    cout << ans;
}
signed main(){
    nikita
    int tt = 1;
    if(!tt)cin >> tt;
    FOR(i, 1, tt, 1)solve();
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40