답안 #36078 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36078	2017-12-05T08:31:01 Z	DoanPhuDuc	The Kingdom of JOIOI (JOI17_joioi)	C++	100 / 100	1606 ms	80924 KB

joioi

#include <bits/stdc++.h>

#define FOR(x, a, b) for (int x = a; x <= b; ++x)
#define FOD(x, a, b) for (int x = a; x >= b; --x)
#define REP(x, a, b) for (int x = a; x < b; ++x)
#define DEBUG(X) { cout << #X << " = " << X << endl; }
#define PR(A, n) { cout << #A << " = "; FOR(_, 1, n) cout << A[_] << " "; cout << endl; }
#define PR0(A, n)  { cout << #A << " = "; REP(_, 0, n) cout << A[_] << " "; cout << endl; }

using namespace std;

typedef long long LL;

const int N = 2e3 + 10;
const int INF = 0x3f3f3f3f;

int n, m, minV = INF, maxV = -INF, nn, mm;
int a[N][N], b[4][N][N], NN[4], MM[4];

void Rotate(int x, int y) {
    int nn = NN[x], mm = MM[x];
    FOR(i, 1, nn)
        FOR(j, 1, mm) b[y][j][i] = b[x][nn - i + 1][j];
    NN[y] = mm; MM[y] = nn;
}

void Init() {
    NN[0] = n; MM[0] = m;
    FOR(i, 1, NN[0])
        FOR(j, 1, MM[0]) b[0][i][j] = a[i][j];
    Rotate(0, 1);
    Rotate(1, 2);
    Rotate(2, 3);
}

bool Greedy(int t, int diff) {
    nn = NN[t], mm = MM[t];
    int l = minV, r = l + diff;
    vector <int> f;
    int p = mm;
    FOR(i, 1, nn) {
        FOR(j, 1, p) {
            if (l <= b[t][i][j] && b[t][i][j] <= r) continue;
            p = j - 1;
            break;
        }
        f.push_back(p);
    }
    int x = INF, y = -INF;
    FOR(i, 1, nn) {
        int p = f[i - 1];
        FOR(j, p + 1, mm) {
            x = min(x, b[t][i][j]);
            y = max(y, b[t][i][j]);
        }
    }
    if (x == INF) return true;
        else return abs(x - y) <= diff;
}

bool Check(int diff) {
    if (Greedy(0, diff) == true) return true;
    if (Greedy(1, diff) == true) return true;
    if (Greedy(2, diff) == true) return true;
    if (Greedy(3, diff) == true) return true;
    return false;
}

int main() {
   // freopen("KUTO.INP", "r", stdin);
   // freopen("KUTO.OUT", "w", stdout);
    scanf("%d%d", &n, &m);
    FOR(i, 1, n)
        FOR(j, 1, m) scanf("%d", &a[i][j]);
    FOR(i, 1, n)
        FOR(j, 1, m) {
            minV = min(minV, a[i][j]);
            maxV = max(maxV, a[i][j]);
        }
    Init();
    int l = 0, r = maxV - minV, f = -1;
    while (l <= r) {
        int m = (l + r) >> 1;
        if (Check(m)) {
            r = m - 1;
            f = m;
        } else l = m + 1;
    }
    printf("%d", f);
    return 0;
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:72:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
                          ^
joioi.cpp:74:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         FOR(j, 1, m) scanf("%d", &a[i][j]);
                                           ^

Subtask #1
15.0 / 15.0

#	결과	메모리	Grader output
1	Correct	80924 KB	Output is correct
2	Correct	80924 KB	Output is correct
3	Correct	80924 KB	Output is correct
4	Correct	80924 KB	Output is correct
5	Correct	80924 KB	Output is correct
6	Correct	80924 KB	Output is correct
7	Correct	80924 KB	Output is correct
8	Correct	80924 KB	Output is correct
9	Correct	80924 KB	Output is correct
10	Correct	80924 KB	Output is correct
11	Correct	80924 KB	Output is correct
12	Correct	80924 KB	Output is correct
13	Correct	80924 KB	Output is correct
14	Correct	80924 KB	Output is correct

Subtask #2
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	80924 KB	Output is correct
2	Correct	0 ms	80924 KB	Output is correct
3	Correct	0 ms	80924 KB	Output is correct
4	Correct	0 ms	80924 KB	Output is correct
5	Correct	0 ms	80924 KB	Output is correct
6	Correct	0 ms	80924 KB	Output is correct
7	Correct	0 ms	80924 KB	Output is correct
8	Correct	0 ms	80924 KB	Output is correct
9	Correct	0 ms	80924 KB	Output is correct
10	Correct	0 ms	80924 KB	Output is correct
11	Correct	0 ms	80924 KB	Output is correct
12	Correct	0 ms	80924 KB	Output is correct
13	Correct	0 ms	80924 KB	Output is correct
14	Correct	0 ms	80924 KB	Output is correct
15	Correct	0 ms	80924 KB	Output is correct
16	Correct	3 ms	80924 KB	Output is correct
17	Correct	16 ms	80924 KB	Output is correct
18	Correct	13 ms	80924 KB	Output is correct
19	Correct	13 ms	80924 KB	Output is correct
20	Correct	13 ms	80924 KB	Output is correct
21	Correct	16 ms	80924 KB	Output is correct
22	Correct	16 ms	80924 KB	Output is correct
23	Correct	16 ms	80924 KB	Output is correct
24	Correct	16 ms	80924 KB	Output is correct
25	Correct	16 ms	80924 KB	Output is correct
26	Correct	19 ms	80924 KB	Output is correct
27	Correct	19 ms	80924 KB	Output is correct
28	Correct	13 ms	80924 KB	Output is correct

Subtask #3
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	80924 KB	Output is correct
2	Correct	0 ms	80924 KB	Output is correct
3	Correct	0 ms	80924 KB	Output is correct
4	Correct	0 ms	80924 KB	Output is correct
5	Correct	0 ms	80924 KB	Output is correct
6	Correct	0 ms	80924 KB	Output is correct
7	Correct	0 ms	80924 KB	Output is correct
8	Correct	0 ms	80924 KB	Output is correct
9	Correct	0 ms	80924 KB	Output is correct
10	Correct	0 ms	80924 KB	Output is correct
11	Correct	0 ms	80924 KB	Output is correct
12	Correct	0 ms	80924 KB	Output is correct
13	Correct	0 ms	80924 KB	Output is correct
14	Correct	0 ms	80924 KB	Output is correct
15	Correct	0 ms	80924 KB	Output is correct
16	Correct	3 ms	80924 KB	Output is correct
17	Correct	16 ms	80924 KB	Output is correct
18	Correct	13 ms	80924 KB	Output is correct
19	Correct	13 ms	80924 KB	Output is correct
20	Correct	13 ms	80924 KB	Output is correct
21	Correct	16 ms	80924 KB	Output is correct
22	Correct	16 ms	80924 KB	Output is correct
23	Correct	16 ms	80924 KB	Output is correct
24	Correct	16 ms	80924 KB	Output is correct
25	Correct	16 ms	80924 KB	Output is correct
26	Correct	19 ms	80924 KB	Output is correct
27	Correct	19 ms	80924 KB	Output is correct
28	Correct	13 ms	80924 KB	Output is correct
29	Correct	976 ms	80924 KB	Output is correct
30	Correct	999 ms	80924 KB	Output is correct
31	Correct	1119 ms	80924 KB	Output is correct
32	Correct	1149 ms	80924 KB	Output is correct
33	Correct	906 ms	80924 KB	Output is correct
34	Correct	1022 ms	80924 KB	Output is correct
35	Correct	1606 ms	80924 KB	Output is correct
36	Correct	1563 ms	80924 KB	Output is correct
37	Correct	1473 ms	80924 KB	Output is correct

답안 #36078

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