답안 #51556 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
51556	2018-06-18T14:39:36 Z	vivukhue	The Kingdom of JOIOI (JOI17_joioi)	C++14	100 / 100	2681 ms	63544 KB

joioi

#include <bits/stdc++.h>
using namespace std;
 
const int N = 2005;
const int inf = 1e9 + 7;
 
int n, m;
int a[N][N], tmp[N][N];
int mnR[N][N], mxR[N][N];
int pos[N];
 
void _rotate() {
    for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) tmp[j][n + 1 - i] = a[i][j];
    swap(n, m);
    for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) a[i][j] = tmp[i][j];
}
 
int ans = inf;
int mn = inf;
 
bool check(int val) {
    for (int i = 1; i <= n; ++i) {
        pos[i] = m + 1;
        for (int j = 1; j <= m; ++j) if (a[i][j] > mn + val) { pos[i] = j; break; }
    }
   
    for (int i = 1; i <= n; ++i) {
        mnR[i][m + 1] = inf; mxR[i][m + 1] = 0;
        for (int j = m; j >= 1; --j) {
            mnR[i][j] = min(mnR[i][j + 1], a[i][j]);
            mxR[i][j] = max(mxR[i][j + 1], a[i][j]);
        }
    }
 
    int cur = m;
    int cur_min = inf, cur_max = 0;
    for (int i = 1; i <= n; ++i) {
        cur = min(cur, pos[i] - 1);
        cur_min = min(cur_min, mnR[i][cur + 1]);
        cur_max = max(cur_max, mxR[i][cur + 1]);
    }
 
    return cur_max - cur_min <= val;
}
 
void solve() {
    int l = 0, r = inf;
    while(l < r) {
        int mid = ((l + r) >> 1);
        if (check(mid)) r = mid; else l = mid + 1;
    }
    if (check(l)) ans = min(ans, l);
}
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) cin >> a[i][j], mn = min(mn, a[i][j]);
    }
   
    solve();
 
    _rotate();
    solve();
 
    _rotate();
    solve();
 
    _rotate();
    solve();
 
    printf("%d\n", ans);   
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	684 KB	Output is correct
5	Correct	2 ms	684 KB	Output is correct
6	Correct	2 ms	684 KB	Output is correct
7	Correct	2 ms	732 KB	Output is correct
8	Correct	2 ms	732 KB	Output is correct
9	Correct	2 ms	732 KB	Output is correct
10	Correct	2 ms	732 KB	Output is correct
11	Correct	2 ms	732 KB	Output is correct
12	Correct	2 ms	748 KB	Output is correct
13	Correct	2 ms	784 KB	Output is correct
14	Correct	2 ms	784 KB	Output is correct

Subtask #2
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	684 KB	Output is correct
5	Correct	2 ms	684 KB	Output is correct
6	Correct	2 ms	684 KB	Output is correct
7	Correct	2 ms	732 KB	Output is correct
8	Correct	2 ms	732 KB	Output is correct
9	Correct	2 ms	732 KB	Output is correct
10	Correct	2 ms	732 KB	Output is correct
11	Correct	2 ms	732 KB	Output is correct
12	Correct	2 ms	748 KB	Output is correct
13	Correct	2 ms	784 KB	Output is correct
14	Correct	2 ms	784 KB	Output is correct
15	Correct	5 ms	3812 KB	Output is correct
16	Correct	22 ms	4452 KB	Output is correct
17	Correct	25 ms	4456 KB	Output is correct
18	Correct	24 ms	4564 KB	Output is correct
19	Correct	24 ms	4564 KB	Output is correct
20	Correct	22 ms	4564 KB	Output is correct
21	Correct	24 ms	4564 KB	Output is correct
22	Correct	24 ms	4564 KB	Output is correct
23	Correct	25 ms	4564 KB	Output is correct
24	Correct	23 ms	4580 KB	Output is correct
25	Correct	25 ms	4580 KB	Output is correct
26	Correct	29 ms	4580 KB	Output is correct
27	Correct	26 ms	4580 KB	Output is correct
28	Correct	27 ms	4580 KB	Output is correct

Subtask #3
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	684 KB	Output is correct
5	Correct	2 ms	684 KB	Output is correct
6	Correct	2 ms	684 KB	Output is correct
7	Correct	2 ms	732 KB	Output is correct
8	Correct	2 ms	732 KB	Output is correct
9	Correct	2 ms	732 KB	Output is correct
10	Correct	2 ms	732 KB	Output is correct
11	Correct	2 ms	732 KB	Output is correct
12	Correct	2 ms	748 KB	Output is correct
13	Correct	2 ms	784 KB	Output is correct
14	Correct	2 ms	784 KB	Output is correct
15	Correct	5 ms	3812 KB	Output is correct
16	Correct	22 ms	4452 KB	Output is correct
17	Correct	25 ms	4456 KB	Output is correct
18	Correct	24 ms	4564 KB	Output is correct
19	Correct	24 ms	4564 KB	Output is correct
20	Correct	22 ms	4564 KB	Output is correct
21	Correct	24 ms	4564 KB	Output is correct
22	Correct	24 ms	4564 KB	Output is correct
23	Correct	25 ms	4564 KB	Output is correct
24	Correct	23 ms	4580 KB	Output is correct
25	Correct	25 ms	4580 KB	Output is correct
26	Correct	29 ms	4580 KB	Output is correct
27	Correct	26 ms	4580 KB	Output is correct
28	Correct	27 ms	4580 KB	Output is correct
29	Correct	2293 ms	63464 KB	Output is correct
30	Correct	2261 ms	63544 KB	Output is correct
31	Correct	2384 ms	63544 KB	Output is correct
32	Correct	2411 ms	63544 KB	Output is correct
33	Correct	2156 ms	63544 KB	Output is correct
34	Correct	2462 ms	63544 KB	Output is correct
35	Correct	2465 ms	63544 KB	Output is correct
36	Correct	2335 ms	63544 KB	Output is correct
37	Correct	2681 ms	63544 KB	Output is correct

답안 #51556

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 45.0 / 45.0

Subtask #3 40.0 / 40.0

Subtask #1
15.0 / 15.0

Subtask #2
45.0 / 45.0

Subtask #3
40.0 / 40.0