oj.uz

답안 #832461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832461 2023-08-21T10:38:15 Z maomao90 Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 55720 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];
ll d[MAXN][55];
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) {
        REP (j, 0, SZ(vy[i])) {
            d[i][j] = 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

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

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1173 ms 20660 KB Output is correct
4 Correct 321 ms 55720 KB Output is correct
5 Correct 112 ms 54220 KB Output is correct
6 Correct 681 ms 53916 KB Output is correct
7 Correct 77 ms 54212 KB Output is correct
8 Incorrect 1630 ms 30096 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 9172 KB Output is correct
2 Execution timed out 4046 ms 35824 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 9172 KB Output is correct
2 Execution timed out 4046 ms 35824 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 2 ms 2660 KB Output is correct
8 Correct 2 ms 2656 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2596 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 1173 ms 20660 KB Output is correct
21 Correct 321 ms 55720 KB Output is correct
22 Correct 112 ms 54220 KB Output is correct
23 Correct 681 ms 53916 KB Output is correct
24 Correct 77 ms 54212 KB Output is correct
25 Incorrect 1630 ms 30096 KB Output isn't correct
26 Halted 0 ms 0 KB -