oj.uz

Submission #832492

# Submission time Handle Problem Language Result Execution time Memory
832492 2023-08-21T10:52:58 Z maomao90 Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 363948 KB 
// I can do all things through Christ who strenghthens me
// Philippians 4:13

#include "bits/stdc++.h"
#include "walk.h"
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <class T>
inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int) x.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> lll;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXN = 100005;

int n, m;
vi vy[MAXN];
map<int, int> mp[MAXN];
vll d[MAXN];
vi prv[MAXN], nxt[MAXN];
priority_queue<lll, vector<lll>, greater<lll>> pq;

ll min_distance(vi x, vi h, vi l, vi r, vi y, int s, int g) {
    n = SZ(x), m = SZ(l);
    REP (i, 0, m) {
        REP (p, l[i], r[i] + 1) {
            if (h[p] < y[i]) {
                continue;
            }
            vy[p].pb(i);
        }
    }
    REP (i, 0, n) {
        d[i] = vll(SZ(vy[i]), LINF);
        prv[i] = vi(SZ(vy[i]), -1);
        nxt[i] = vi(SZ(vy[i]), INF);
        sort(ALL(vy[i]), [&] (int l, int r) {
                return y[l] < y[r];
                });
        REP (j, 0, SZ(vy[i])) {
            mp[i][y[vy[i][j]]] = j;
        }
    }
    REP (i, 0, m) {
        int tprv = -1;
        REP (p, l[i], r[i] + 1) {
            if (h[p] < y[i]) {
                continue;
            }
            prv[p][mp[p][y[i]]] = tprv;
            if (tprv != -1) {
                nxt[tprv][mp[tprv][y[i]]] = p;
            }
            tprv = p;
        }
    }
    REP (j, 0, SZ(vy[s])) {
        d[s][j] = y[vy[s][j]];
        pq.push({d[s][j], s, j});
    }
    while (!pq.empty()) {
        auto [ud, up, ui] = pq.top(); pq.pop();
        if (ud != d[up][ui]) {
            continue;
        }
        int id = vy[up][ui];
        cerr << up << ' ' << y[id] << ": " << ud << '\n';
        REP (j, max(0, (int) ui - 1), min(SZ(vy[up]), (int) ui + 2)) {
            if (mnto(d[up][j], ud + abs(y[id] - y[vy[up][j]]))) {
                pq.push({d[up][j], up, j});
            }
        }
        REP (p, max(l[id], prv[up][ui]), min(r[id], nxt[up][ui]) + 1) {
            if (h[p] < y[id]) {
                continue;
            }
            int j = mp[p][y[id]];
            /*
            REP (j, 0, SZ(vy[p])) {
                if (y[vy[p][j]] != y[id]) {
                    continue;
                }
                */
                if (mnto(d[p][j], ud + abs(x[p] - x[up]))) {
                    pq.push({d[p][j], p, j});
                }
            //}
        }
    }
    ll ans = LINF;
    REP (j, 0, SZ(vy[g])) {
        mnto(ans, d[g][j] + y[vy[g][j]]);
    }
    if (ans == LINF) {
        return -1;
    }
	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14312 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 7 ms 14288 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 10 ms 14420 KB Output is correct
7 Correct 10 ms 14420 KB Output is correct
8 Correct 7 ms 14396 KB Output is correct
9 Correct 7 ms 14292 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 10 ms 14292 KB Output is correct
12 Correct 10 ms 14292 KB Output is correct
13 Correct 10 ms 14296 KB Output is correct
14 Correct 7 ms 14292 KB Output is correct
15 Correct 7 ms 14292 KB Output is correct
16 Correct 7 ms 14292 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 8 ms 14292 KB Output is correct
3 Correct 712 ms 65724 KB Output is correct
4 Correct 392 ms 71892 KB Output is correct
5 Correct 252 ms 64052 KB Output is correct
6 Correct 1300 ms 59572 KB Output is correct
7 Correct 241 ms 64204 KB Output is correct
8 Correct 1024 ms 79076 KB Output is correct
9 Correct 292 ms 63552 KB Output is correct
10 Correct 725 ms 92328 KB Output is correct
11 Correct 237 ms 43668 KB Output is correct
12 Correct 160 ms 40228 KB Output is correct
13 Correct 456 ms 83260 KB Output is correct
14 Execution timed out 4053 ms 39228 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 21464 KB Output is correct
2 Execution timed out 4091 ms 363948 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 21464 KB Output is correct
2 Execution timed out 4091 ms 363948 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14312 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 7 ms 14288 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 10 ms 14420 KB Output is correct
7 Correct 10 ms 14420 KB Output is correct
8 Correct 7 ms 14396 KB Output is correct
9 Correct 7 ms 14292 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 10 ms 14292 KB Output is correct
12 Correct 10 ms 14292 KB Output is correct
13 Correct 10 ms 14296 KB Output is correct
14 Correct 7 ms 14292 KB Output is correct
15 Correct 7 ms 14292 KB Output is correct
16 Correct 7 ms 14292 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 8 ms 14292 KB Output is correct
20 Correct 712 ms 65724 KB Output is correct
21 Correct 392 ms 71892 KB Output is correct
22 Correct 252 ms 64052 KB Output is correct
23 Correct 1300 ms 59572 KB Output is correct
24 Correct 241 ms 64204 KB Output is correct
25 Correct 1024 ms 79076 KB Output is correct
26 Correct 292 ms 63552 KB Output is correct
27 Correct 725 ms 92328 KB Output is correct
28 Correct 237 ms 43668 KB Output is correct
29 Correct 160 ms 40228 KB Output is correct
30 Correct 456 ms 83260 KB Output is correct
31 Execution timed out 4053 ms 39228 KB Time limit exceeded
32 Halted 0 ms 0 KB -