oj.uz

Submission #892834

# Submission time Handle Problem Language Result Execution time Memory
892834 2023-12-26T04:03:10 Z vjudge1 Maxcomp (info1cup18_maxcomp) C++17
60 / 100
 500 ms 16756 KB 
#include "bits/stdc++.h"
using namespace std;       

#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 1e3+5;
ll a[N][N];

void kigash() {
    ll n, m;
    cin>>n>>m;
    for(ll i=1; i<=n; i++) {
        for(ll j=1; j<=m; j++) cin>>a[i][j];
    }
    ll ans = -5;
    for(ll len=0; len<=n+m; len++) {
        for(ll i=1; i<=n; i++) {
            for(ll j=1; j<=m; j++) {
                ll mx = 0;
                for(ll k=i; k>=max(1ll, i-len); k--) {
                    for(ll l=max(1ll, j-len+i-k); l<=min(m, j+len-i+k); l++) mx = max(mx, a[k][l]);
                }
                for(ll k=i; k<=min(n, i+len); k++) {
                    for(ll l=max(1ll, j-len+k-i); l<=min(m, j+len-k+i); l++) mx = max(mx, a[k][l]);
                }
                ans = max(ans, mx-a[i][j]-len-1);
            }
        }
    }
    cout<<ans<<"\n";
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

Compilation message

maxcomp.cpp:4: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    4 | #pragma comment(linker, "/stack:200000000")
      | 
maxcomp.cpp: In function 'void freopen(std::string)':
maxcomp.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
maxcomp.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 348 KB Output is correct
2 Correct 221 ms 592 KB Output is correct
3 Correct 214 ms 452 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 142 ms 2392 KB Output is correct
10 Correct 145 ms 2616 KB Output is correct
11 Correct 144 ms 2624 KB Output is correct
12 Correct 142 ms 2624 KB Output is correct
13 Correct 142 ms 2624 KB Output is correct
14 Correct 148 ms 2652 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 215 ms 348 KB Output is correct
10 Correct 221 ms 592 KB Output is correct
11 Correct 214 ms 452 KB Output is correct
12 Correct 142 ms 2392 KB Output is correct
13 Correct 145 ms 2616 KB Output is correct
14 Correct 144 ms 2624 KB Output is correct
15 Correct 142 ms 2624 KB Output is correct
16 Correct 142 ms 2624 KB Output is correct
17 Correct 148 ms 2652 KB Output is correct
18 Execution timed out 1038 ms 16756 KB Time limit exceeded
19 Halted 0 ms 0 KB -