oj.uz

Submission #1036986

# Submission time Handle Problem Language Result Execution time Memory
1036986 2024-07-27T20:58:52 Z aaaaaarroz Sky Walking (IOI19_walk) C++17
24 / 100
 4000 ms 631436 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "walk.h"
 
struct BRIDGE {
    int l, r, y;
};
struct BUILDING {
    int x, h;
};
 
namespace TEST4 {
    struct SEGTREE {
        int n;
        VI tree;
        VI lazy;
        SEGTREE(int sz) {
            n = 1;
            while (n < sz) n *= 2;
            lazy = tree = VI(2*n, -1);
        }
        void push(int N) {
            if (lazy[N] == -1) return;
            tree[N] = lazy[N];
            if (N <= n-2) {
                lazy[2*N+1] = lazy[N];
                lazy[2*N+2] = lazy[N];
            }
            lazy[N] = -1;
        }
        int get(int N, int L, int R, int l, int r) {
            push(N);
            if (l <= L && R <= r) return tree[N];
            if (R < l || L > r) return -1;
            int M = (L + R) / 2;
            return max(get(2*N+1, L, M, l, r), get(2*N+2, M+1, R, l, r));
        }
        void upd(int N, int L, int R, int l, int r, int s) {
            push(N);
            if (R < l || L > r) return;
            if (l <= L && R <= r) {
                lazy[N] = s;
                push(N);
                return;
            }
            int M = (L + R) / 2;
            upd(2*N+1, L, M, l, r, s);
            upd(2*N+2, M+1, R, l, r, s);
            tree[N] = max(tree[2*N+1], tree[2*N+2]);
        }
        int get(int l, int r) {
            return get(0, 0, n-1, l, r);
        }
        int get(int i) {
            return get(0, 0, n-1, i, i);
        }
        void upd(int l, int r, int s) {
            upd(0, 0, n-1, l, r, s);
        }
    };
};
 
ll min_distance(VI X, VI H, VI L, VI R, VI Y, int S, int T) {
    vector<BUILDING> buildings(X.size());
    rep(i, X.size()) buildings[i] = {X[i], H[i]};
    vector<BRIDGE> bridges(L.size());
    rep(i, L.size()) bridges[i] = {L[i], R[i], Y[i]};
    map<PII, int> ind;
    VPI point;
    VVPI gp;
    auto addvertex = [&](int x, int y) {
        if (ind.count({x, y})) return;
        ind[{x, y}] = gp.size();
        point.pb({x, y});
        gp.pb(VPI());
    };
    if (S == 0 && T == X.size()-1 && false) {
        /*TEST 4 */
        addvertex(0, 0);
        addvertex(X.size()-1, 0);
        /* vertical */
        sort(all(bridges), [](const BRIDGE& a, const BRIDGE& b){return a.y < b.y;});
        TEST4::SEGTREE seg(X.size());
        seg.upd(0, 0, 0);
        seg.upd(X.size()-1, X.size()-1, 0);
        for (auto&[l, r, y] : bridges) {
            addvertex(l, y);
            addvertex(r, y);
            for (int x : {l, r}) {
                int vy = seg.get(x);
                if (vy == -1) continue;
                addvertex(x, vy);
                int u = ind[{x, y}];
                int v = ind[{x, vy}];
                int w = y - vy;
                gp[u].pb({v, w});
                gp[v].pb({u, w});
            }
            seg.upd(l, r, y);
        }
        /* horizontal */
        VPI pts = point;
        sort(all(pts), [](const PII& a, const PII& b){return mkp(a.ss, a.ff) < mkp(b.ss, b.ff);});
        rep(i, pts.size()-1) {
            if (pts[i].ss == 0) continue;
            if (pts[i].ss != pts[i+1].ss) continue;
            int u = ind[pts[i]];
            int v = ind[pts[i+1]];
            int w = X[pts[i+1].ff] - X[pts[i].ff];
            gp[u].pb({v, w});
            gp[v].pb({u, w});
        }
    } else {
        /* TEST 1, 2 */
        addvertex(X[S], 0);
        addvertex(X[T], 0);
        for (auto&[a, b, c] : bridges) a = X[a], b = X[b]; 
        sort(all(buildings), [](const BUILDING& a, const BUILDING& b){return a.h > b.h;});
        sort(all(bridges), [](const BRIDGE& a, const BRIDGE& b){return a.y > b.y;});
        /* horizontal */
        set<int> st;
        for (int j = 0, i = 0; i < bridges.size(); i++) {
            auto&[l, r, y] = bridges[i];
            while (j < buildings.size() && buildings[j].h >= y) st.insert(buildings[j++].x);
            VI xs;
            for (auto it = st.lower_bound(l); it != st.end() && *it <= r; it++) xs.pb(*it);
            for (int x : xs) addvertex(x, y);
            rep(i, xs.size()-1) {
                int u = ind[{xs[i], y}];
                int v = ind[{xs[i+1], y}];
                int w = xs[i+1]-xs[i];
                gp[u].pb({v, w});
                gp[v].pb({u, w});
            }
        }
        /* vertical */
        VPI pts = point;
        sort(all(pts));
        rep(i, pts.size()-1) {
            if (pts[i].ff != pts[i+1].ff) continue;
            int u = ind[pts[i]];
            int v = ind[pts[i+1]];
            int w = pts[i+1].ss - pts[i].ss;
            gp[u].pb({v, w});
            gp[v].pb({u, w});
        }
    }
    int n = gp.size();
    priority_queue<PLL> pq;
    VL dist(n, 1e18);
    VI vis(n);
    pq.push({0, 0});
    dist[0] = 0;
    while (pq.size()) {
        int u = pq.top().ss;
        pq.pop();
        if (vis[u]) continue;
        vis[u] = true;
        for (auto[v, w] : gp[u]) {
            if (dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                pq.push({-dist[v], v});
            }
        }
    }
    if (dist[1] == 1e18) return -1;
	return dist[1];
}

Compilation message

walk.cpp: In function 'll min_distance(VI, VI, VI, VI, VI, int, int)':
walk.cpp:105:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     if (S == 0 && T == X.size()-1 && false) {
      |                   ~~^~~~~~~~~~~~~
walk.cpp:150:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BRIDGE>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |         for (int j = 0, i = 0; i < bridges.size(); i++) {
      |                                ~~^~~~~~~~~~~~~~~~
walk.cpp:152:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BUILDING>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |             while (j < buildings.size() && buildings[j].h >= y) st.insert(buildings[j++].x);
      |                    ~~^~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 388 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1068 ms 117764 KB Output is correct
4 Correct 1061 ms 124740 KB Output is correct
5 Correct 668 ms 108780 KB Output is correct
6 Correct 578 ms 94292 KB Output is correct
7 Correct 698 ms 107592 KB Output is correct
8 Correct 1393 ms 148040 KB Output is correct
9 Correct 763 ms 109104 KB Output is correct
10 Correct 1417 ms 170452 KB Output is correct
11 Correct 522 ms 66900 KB Output is correct
12 Correct 277 ms 42348 KB Output is correct
13 Correct 1195 ms 151220 KB Output is correct
14 Correct 199 ms 41832 KB Output is correct
15 Correct 214 ms 41832 KB Output is correct
16 Correct 231 ms 43112 KB Output is correct
17 Correct 242 ms 42600 KB Output is correct
18 Correct 185 ms 45668 KB Output is correct
19 Correct 7 ms 2196 KB Output is correct
20 Correct 78 ms 20800 KB Output is correct
21 Correct 238 ms 41760 KB Output is correct
22 Correct 229 ms 40556 KB Output is correct
23 Correct 228 ms 53608 KB Output is correct
24 Correct 230 ms 42284 KB Output is correct
25 Correct 289 ms 42152 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 13184 KB Output is correct
2 Execution timed out 4035 ms 631436 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 13184 KB Output is correct
2 Execution timed out 4035 ms 631436 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 388 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1068 ms 117764 KB Output is correct
21 Correct 1061 ms 124740 KB Output is correct
22 Correct 668 ms 108780 KB Output is correct
23 Correct 578 ms 94292 KB Output is correct
24 Correct 698 ms 107592 KB Output is correct
25 Correct 1393 ms 148040 KB Output is correct
26 Correct 763 ms 109104 KB Output is correct
27 Correct 1417 ms 170452 KB Output is correct
28 Correct 522 ms 66900 KB Output is correct
29 Correct 277 ms 42348 KB Output is correct
30 Correct 1195 ms 151220 KB Output is correct
31 Correct 199 ms 41832 KB Output is correct
32 Correct 214 ms 41832 KB Output is correct
33 Correct 231 ms 43112 KB Output is correct
34 Correct 242 ms 42600 KB Output is correct
35 Correct 185 ms 45668 KB Output is correct
36 Correct 7 ms 2196 KB Output is correct
37 Correct 78 ms 20800 KB Output is correct
38 Correct 238 ms 41760 KB Output is correct
39 Correct 229 ms 40556 KB Output is correct
40 Correct 228 ms 53608 KB Output is correct
41 Correct 230 ms 42284 KB Output is correct
42 Correct 289 ms 42152 KB Output is correct
43 Correct 80 ms 13184 KB Output is correct
44 Execution timed out 4035 ms 631436 KB Time limit exceeded
45 Halted 0 ms 0 KB -