oj.uz

답안 #61861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61861 2018-07-27T01:04:34 Z Benq Maxcomp (info1cup18_maxcomp) C++11
100 / 100
 244 ms 76012 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,M;
ll ans = -INF, A[1000][1000], bes[1000][1000];

ll solve() {
    ll ret = -INF;
    F0Rd(i,N) F0Rd(j,M) {
        bes[i][j] = -INF;
        if (i < N-1) bes[i][j] = max(bes[i][j],bes[i+1][j]);
        if (j < M-1) bes[i][j] = max(bes[i][j],bes[i][j+1]);
        bes[i][j] = max(bes[i][j],A[i][j]-i-j);
        ret = max(ret,bes[i][j]-A[i][j]+i+j-1);
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    F0R(i,N) F0R(j,M) cin >> A[i][j];
    ans = solve();
    F0R(i,N) for (int j = 0; j < M-1-j; ++j) swap(A[i][j],A[i][M-1-j]);
    ans = max(ans,solve());
    for (int i = 0; i < N-1-i; ++i) F0R(j,M) swap(A[i][j],A[N-1-i][j]);
    ans = max(ans,solve());
    F0R(i,N) for (int j = 0; j < M-1-j; ++j) swap(A[i][j],A[i][M-1-j]);
    ans = max(ans,solve());
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 2 ms 660 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 660 KB Output is correct
2 Correct 3 ms 712 KB Output is correct
3 Correct 3 ms 864 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 4 ms 1144 KB Output is correct
10 Correct 3 ms 1164 KB Output is correct
11 Correct 5 ms 1188 KB Output is correct
12 Correct 4 ms 1248 KB Output is correct
13 Correct 4 ms 1380 KB Output is correct
14 Correct 3 ms 1380 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 3 ms 712 KB Output is correct
11 Correct 3 ms 864 KB Output is correct
12 Correct 4 ms 1144 KB Output is correct
13 Correct 3 ms 1164 KB Output is correct
14 Correct 5 ms 1188 KB Output is correct
15 Correct 4 ms 1248 KB Output is correct
16 Correct 4 ms 1380 KB Output is correct
17 Correct 3 ms 1380 KB Output is correct
18 Correct 244 ms 25108 KB Output is correct
19 Correct 176 ms 33672 KB Output is correct
20 Correct 198 ms 41900 KB Output is correct
21 Correct 229 ms 50468 KB Output is correct
22 Correct 178 ms 58820 KB Output is correct
23 Correct 203 ms 67372 KB Output is correct
24 Correct 194 ms 76012 KB Output is correct