oj.uz

답안 #832508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832508 2023-08-21T10:59:04 Z maomao90 Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 364576 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, int, int> 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];
        for (int j : {max(0, (int) ui - 1), min(SZ(vy[up]) - 1, (int) ui + 1)}) {
            if (mnto(d[up][j], ud + abs(y[id] - y[vy[up][j]]))) {
                pq.push({d[up][j], up, j});
            }
        }
        for (int p : {max(l[id], prv[up][ui]), min(r[id], nxt[up][ui])}) {
            int j = mp[p][y[id]];
            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 7 ms 14292 KB Output is correct
2 Correct 7 ms 14388 KB Output is correct
3 Correct 7 ms 14336 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 14 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 7 ms 14336 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 9 ms 14392 KB Output is correct
12 Correct 8 ms 14392 KB Output is correct
13 Correct 7 ms 14292 KB Output is correct
14 Correct 7 ms 14292 KB Output is correct
15 Correct 7 ms 14392 KB Output is correct
16 Correct 7 ms 14356 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14396 KB Output is correct
3 Correct 616 ms 66200 KB Output is correct
4 Correct 377 ms 72460 KB Output is correct
5 Correct 256 ms 64784 KB Output is correct
6 Correct 1295 ms 60124 KB Output is correct
7 Correct 221 ms 64748 KB Output is correct
8 Correct 918 ms 79596 KB Output is correct
9 Correct 265 ms 64180 KB Output is correct
10 Correct 655 ms 93028 KB Output is correct
11 Correct 203 ms 44128 KB Output is correct
12 Correct 123 ms 40828 KB Output is correct
13 Correct 444 ms 83868 KB Output is correct
14 Execution timed out 4086 ms 39792 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 21460 KB Output is correct
2 Execution timed out 4051 ms 364576 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 21460 KB Output is correct
2 Execution timed out 4051 ms 364576 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 7 ms 14388 KB Output is correct
3 Correct 7 ms 14336 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 14 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 7 ms 14336 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 9 ms 14392 KB Output is correct
12 Correct 8 ms 14392 KB Output is correct
13 Correct 7 ms 14292 KB Output is correct
14 Correct 7 ms 14292 KB Output is correct
15 Correct 7 ms 14392 KB Output is correct
16 Correct 7 ms 14356 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 7 ms 14396 KB Output is correct
20 Correct 616 ms 66200 KB Output is correct
21 Correct 377 ms 72460 KB Output is correct
22 Correct 256 ms 64784 KB Output is correct
23 Correct 1295 ms 60124 KB Output is correct
24 Correct 221 ms 64748 KB Output is correct
25 Correct 918 ms 79596 KB Output is correct
26 Correct 265 ms 64180 KB Output is correct
27 Correct 655 ms 93028 KB Output is correct
28 Correct 203 ms 44128 KB Output is correct
29 Correct 123 ms 40828 KB Output is correct
30 Correct 444 ms 83868 KB Output is correct
31 Execution timed out 4086 ms 39792 KB Time limit exceeded
32 Halted 0 ms 0 KB -