oj.uz

Submission #832462

# Submission time Handle Problem Language Result Execution time Memory
832462 2023-08-21T10:39:22 Z maomao90 Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 88444 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];
vll d[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);
    }
    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, 0, SZ(vy[up])) {
            if (mnto(d[up][j], ud + abs(y[id] - y[vy[up][j]]))) {
                pq.push({d[up][j], up, j});
            }
        }
        REP (p, l[id], r[id] + 1) {
            if (h[p] < y[id]) {
                continue;
            }
            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 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2009 ms 30128 KB Output is correct
4 Correct 309 ms 21272 KB Output is correct
5 Correct 81 ms 18964 KB Output is correct
6 Correct 651 ms 18200 KB Output is correct
7 Correct 79 ms 19024 KB Output is correct
8 Correct 3866 ms 44744 KB Output is correct
9 Correct 103 ms 22640 KB Output is correct
10 Correct 560 ms 30024 KB Output is correct
11 Correct 157 ms 16728 KB Output is correct
12 Correct 77 ms 19100 KB Output is correct
13 Correct 418 ms 28452 KB Output is correct
14 Correct 2848 ms 18504 KB Output is correct
15 Execution timed out 4078 ms 18432 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 8088 KB Output is correct
2 Execution timed out 4067 ms 88444 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 8088 KB Output is correct
2 Execution timed out 4067 ms 88444 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2009 ms 30128 KB Output is correct
21 Correct 309 ms 21272 KB Output is correct
22 Correct 81 ms 18964 KB Output is correct
23 Correct 651 ms 18200 KB Output is correct
24 Correct 79 ms 19024 KB Output is correct
25 Correct 3866 ms 44744 KB Output is correct
26 Correct 103 ms 22640 KB Output is correct
27 Correct 560 ms 30024 KB Output is correct
28 Correct 157 ms 16728 KB Output is correct
29 Correct 77 ms 19100 KB Output is correct
30 Correct 418 ms 28452 KB Output is correct
31 Correct 2848 ms 18504 KB Output is correct
32 Execution timed out 4078 ms 18432 KB Time limit exceeded
33 Halted 0 ms 0 KB -