oj.uz

Submission #46737

# Submission time Handle Problem Language Result Execution time Memory
46737 2018-04-22T16:14:46 Z kuzmichev_dima The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 4000 ms 153104 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <unordered_set>
 
using namespace std;
 
#define INF 1e+9
#define mp make_pair
#define pb push_back
#define fi first
#define fs first
#define se second
#define i64 long long
#define li long long
#define lint long long
#define pii pair<int, int>
#define vi vector<int>
 
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define fore(i, b, e) for (int i = (int)b; i <= (int)e; i++)
 
const int maxn = 2005;
const int inf = 1e9+7;
 
pii prec[maxn][maxn];
int n, m;
int a[maxn][maxn];
int b[maxn][maxn];
int global_min, global_max;
vi pos_min;
//unordered_set<int> possible_min;
 
struct Event {
    int minn, row, diff;
};
 
bool operator < (Event fi, Event se) {
    return fi.minn < se.minn;
}
 
inline bool check(int delta) {
    //fprintf(stderr, "check %d\n", delta);
    vector<Event> events;
    vi app_limits(m, -inf);
    vi dis_limits(m, inf);
    forn(i, n) {
        int cur_app = -inf;
        int cur_dis = inf;
        forn(j, m) {
            //min <= x <= min + delta
            cur_app = max(cur_app, a[i][j] - delta);
            cur_app = max(cur_app, app_limits[j]);
            app_limits[j] = cur_app;
 
            cur_dis = min(cur_dis, a[i][j] + 1);
            cur_dis = min(cur_dis, dis_limits[j]);
            dis_limits[j] = cur_dis;
            if (cur_app < cur_dis) {
                events.pb({cur_app, i, +1});
                events.pb({cur_dis, i, -1});
            }
        }
    }
    for (int x : pos_min)
        events.pb({x, -1, 0});
    sort(events.begin(), events.end());
    /*for (auto e : events) {
        fprintf(stderr, "event minn = %d row = %d diff = %d\n", e.minn, e.row, e.diff);
    }*/
    size_t pointer = 0;
    vi rows(n);
    while(pointer < events.size()) {
        int minn = events[pointer].minn;
        bool flag_spec = false;
        while(pointer < events.size() && events[pointer].minn == minn) {
            if (events[pointer].diff) {
                rows[events[pointer].row] += events[pointer].diff;
            } else
                flag_spec = true;
            pointer++;
        }
        if (!flag_spec)
            continue;
        //if (possible_min.find(minn) == possible_min.end())
        //    continue;
        /*printf("minn = %d\n", minn);
        forn(i, n)
            printf("rows[%d] = %d\n", i, rows[i]);*/
        int len = rows[0];
        int right_min = inf;
        int right_max = -inf;
        forn(row, n) {
            len = min(len, rows[row]);
            right_min = min(right_min, prec[row][len].fi);
            right_max = max(right_max, prec[row][len].se);
            if (right_max - right_min > delta)
                break;
        }
        //fprintf(stderr, "right min = %d max = %d\n", right_min, right_max);
        if (right_max - right_min <= delta)
            return true;
    }
    return false;
}
 
int solve(int upper) {
    forn(i, n) {
        prec[i][m] = {inf, -inf};
        for (int len = m - 1; len >= 0; --len) {
            prec[i][len] = {min(prec[i][len + 1].fi, a[i][len]),
                            max(prec[i][len + 1].se, a[i][len])};
            //printf("prec[%d][%d] = %d %d\n", i, len, prec[i][len].fi, prec[i][len].se);
        }
    }
 
    int start = 0;
    int finish = upper;
    while(start < finish) {
        int middle = (start + finish) / 2;
        if (check(middle)) {
            finish = middle;
        } else {
            start = middle + 1;
        }
    }
    return start;
}
 
 
int main() {
#ifdef LOCAL
    freopen("inp", "r", stdin);
    //freopen("outp", "w", stdout);
#else
    // freopen(TASKNAME ".in", "r", stdin);
    // freopen(TASKNAME ".out", "w", stdout);
#endif
    scanf("%d%d", &n, &m);
    global_min = inf;
    global_max = -inf;
    forn(i, n)
        forn(j, m) {
            scanf("%d", &a[i][j]);
            global_min = min(global_min, a[i][j]);
            global_max = max(global_max, a[i][j]);
        }
    forn(i, n)
        forn(j, m)
            pos_min.pb(a[i][j]);
    sort(pos_min.begin(), pos_min.end());
    pos_min.resize(unique(pos_min.begin(), pos_min.end()) - pos_min.begin());
    /*forn(i, n)
        forn(j, m)
            possible_min.insert(a[i][j]);*/
    int first = solve(global_max - global_min);
    forn(i, n)
        forn(j, m)
            b[n - i - 1][j] = a[i][j];
    memcpy(a, b, sizeof(b));
    /*forn(i, n) {
        forn(j, m)
            printf("%d ", b[i][j]);
        printf("\n");
    }*/
    int second = solve(first);
    //printf("first = %d second = %d\n", first, second);
    printf("%d", min(first, second));
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:148:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
joioi.cpp:153:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &a[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16120 KB Output is correct
2 Correct 17 ms 16232 KB Output is correct
3 Correct 18 ms 16308 KB Output is correct
4 Correct 18 ms 16308 KB Output is correct
5 Correct 18 ms 16308 KB Output is correct
6 Correct 19 ms 16364 KB Output is correct
7 Correct 18 ms 16364 KB Output is correct
8 Correct 20 ms 16440 KB Output is correct
9 Correct 21 ms 16440 KB Output is correct
10 Correct 18 ms 16440 KB Output is correct
11 Correct 18 ms 16440 KB Output is correct
12 Correct 18 ms 16440 KB Output is correct
13 Correct 18 ms 16440 KB Output is correct
14 Correct 18 ms 16440 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16120 KB Output is correct
2 Correct 17 ms 16232 KB Output is correct
3 Correct 18 ms 16308 KB Output is correct
4 Correct 18 ms 16308 KB Output is correct
5 Correct 18 ms 16308 KB Output is correct
6 Correct 19 ms 16364 KB Output is correct
7 Correct 18 ms 16364 KB Output is correct
8 Correct 20 ms 16440 KB Output is correct
9 Correct 21 ms 16440 KB Output is correct
10 Correct 18 ms 16440 KB Output is correct
11 Correct 18 ms 16440 KB Output is correct
12 Correct 18 ms 16440 KB Output is correct
13 Correct 18 ms 16440 KB Output is correct
14 Correct 18 ms 16440 KB Output is correct
15 Correct 19 ms 16504 KB Output is correct
16 Correct 26 ms 18676 KB Output is correct
17 Correct 279 ms 21568 KB Output is correct
18 Correct 141 ms 21568 KB Output is correct
19 Correct 156 ms 21568 KB Output is correct
20 Correct 171 ms 21568 KB Output is correct
21 Correct 509 ms 21568 KB Output is correct
22 Correct 215 ms 21568 KB Output is correct
23 Correct 359 ms 21568 KB Output is correct
24 Correct 183 ms 21568 KB Output is correct
25 Correct 529 ms 21568 KB Output is correct
26 Correct 443 ms 21568 KB Output is correct
27 Correct 460 ms 21568 KB Output is correct
28 Correct 719 ms 21568 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16120 KB Output is correct
2 Correct 17 ms 16232 KB Output is correct
3 Correct 18 ms 16308 KB Output is correct
4 Correct 18 ms 16308 KB Output is correct
5 Correct 18 ms 16308 KB Output is correct
6 Correct 19 ms 16364 KB Output is correct
7 Correct 18 ms 16364 KB Output is correct
8 Correct 20 ms 16440 KB Output is correct
9 Correct 21 ms 16440 KB Output is correct
10 Correct 18 ms 16440 KB Output is correct
11 Correct 18 ms 16440 KB Output is correct
12 Correct 18 ms 16440 KB Output is correct
13 Correct 18 ms 16440 KB Output is correct
14 Correct 18 ms 16440 KB Output is correct
15 Correct 19 ms 16504 KB Output is correct
16 Correct 26 ms 18676 KB Output is correct
17 Correct 279 ms 21568 KB Output is correct
18 Correct 141 ms 21568 KB Output is correct
19 Correct 156 ms 21568 KB Output is correct
20 Correct 171 ms 21568 KB Output is correct
21 Correct 509 ms 21568 KB Output is correct
22 Correct 215 ms 21568 KB Output is correct
23 Correct 359 ms 21568 KB Output is correct
24 Correct 183 ms 21568 KB Output is correct
25 Correct 529 ms 21568 KB Output is correct
26 Correct 443 ms 21568 KB Output is correct
27 Correct 460 ms 21568 KB Output is correct
28 Correct 719 ms 21568 KB Output is correct
29 Correct 3316 ms 134392 KB Output is correct
30 Correct 3356 ms 136444 KB Output is correct
31 Execution timed out 4032 ms 153104 KB Time limit exceeded
32 Halted 0 ms 0 KB -