oj.uz

답안 #832478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832478 2023-08-21T10:46:10 Z maomao90 Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 320900 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];
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);
        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 (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, l[id], r[id] + 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9656 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9720 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9580 KB Output is correct
3 Correct 564 ms 55196 KB Output is correct
4 Correct 315 ms 58728 KB Output is correct
5 Correct 168 ms 51728 KB Output is correct
6 Correct 733 ms 47324 KB Output is correct
7 Correct 127 ms 51788 KB Output is correct
8 Correct 880 ms 67072 KB Output is correct
9 Correct 151 ms 51712 KB Output is correct
10 Correct 501 ms 76916 KB Output is correct
11 Correct 157 ms 34892 KB Output is correct
12 Correct 119 ms 29200 KB Output is correct
13 Correct 379 ms 69560 KB Output is correct
14 Correct 3101 ms 28416 KB Output is correct
15 Correct 3957 ms 29232 KB Output is correct
16 Correct 264 ms 32080 KB Output is correct
17 Correct 215 ms 31228 KB Output is correct
18 Execution timed out 4054 ms 16568 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 15572 KB Output is correct
2 Execution timed out 4082 ms 320900 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 15572 KB Output is correct
2 Execution timed out 4082 ms 320900 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9656 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9720 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 4 ms 9580 KB Output is correct
20 Correct 564 ms 55196 KB Output is correct
21 Correct 315 ms 58728 KB Output is correct
22 Correct 168 ms 51728 KB Output is correct
23 Correct 733 ms 47324 KB Output is correct
24 Correct 127 ms 51788 KB Output is correct
25 Correct 880 ms 67072 KB Output is correct
26 Correct 151 ms 51712 KB Output is correct
27 Correct 501 ms 76916 KB Output is correct
28 Correct 157 ms 34892 KB Output is correct
29 Correct 119 ms 29200 KB Output is correct
30 Correct 379 ms 69560 KB Output is correct
31 Correct 3101 ms 28416 KB Output is correct
32 Correct 3957 ms 29232 KB Output is correct
33 Correct 264 ms 32080 KB Output is correct
34 Correct 215 ms 31228 KB Output is correct
35 Execution timed out 4054 ms 16568 KB Time limit exceeded
36 Halted 0 ms 0 KB -