oj.uz

Submission #1013263

# Submission time Handle Problem Language Result Execution time Memory
1013263 2024-07-03T10:55:36 Z boris_mihov Sky Walking (IOI19_walk) C++17
24 / 100
 1012 ms 446412 KB 
#include "walk.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <stack>
#include <map>

typedef long long llong;
const int MAXN = 100000 + 10;
const int INTERSECTIONS = 10 + 5;
const llong INF = 1e18;
const int INTINF = 1e9;
const int MAXLOG = 17;

namespace
{
    int cnt;
    int n, m;
    int s, t;
    int h[MAXN];
    int x[MAXN];
    int left[MAXN];
    int right[MAXN];
    int y[MAXN];
    std::map <int,int> map[MAXN];
    bool vis[MAXN * INTERSECTIONS];
    llong dist[MAXN * INTERSECTIONS];
    std::vector <std::pair <int,int>> g[MAXN * INTERSECTIONS]; 
    int cntNodes;
}

struct Sparse
{
    int sparse[MAXLOG][MAXN];
    int getLOG[MAXN];

    void build(int a[])
    {
        for (int i = 1 ; i <= n ; ++i)
        {
            sparse[0][i] = a[i];
        }

        for (int lg = 1 ; (1 << lg) <= n ; ++lg)
        {
            for (int i = 1 ; i + (1 << lg) - 1 <= n ; ++i)
            {
                sparse[lg][i] = std::max(sparse[lg - 1][i], sparse[lg - 1][i + (1 << lg - 1)]);
            }
        }

        for (int i = 1 ; i <= n ; ++i)
        {
            getLOG[i] = getLOG[i - 1];
            if ((1 << getLOG[i] + 1) < i) getLOG[i]++;
        }
    }

    int findMAX(int l, int r)
    {
        int lg = getLOG[r - l + 1];
        return std::max(sparse[lg][l], sparse[lg][r - (1 << lg) + 1]);
    }
};

Sparse sparse;
llong solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        map[i][0] = ++cnt;
    }

    sparse.build(h);
    for (int i = 1 ; i <= m ; ++i)
    {
        int prev = left[i];
        if (map[left[i]][y[i]] == 0)
        {
            map[left[i]][y[i]] = ++cnt;
        }

        while (prev < right[i])
        {
            int l = prev, r = right[i] + 1, mid;
            while (l < r - 1)
            {
                mid = l + r >> 1;
                if (sparse.findMAX(prev + 1, mid) < y[i]) l = mid;
                else r = mid;
            }

            if (map[r][y[i]] == 0)
            {
                map[r][y[i]] = ++cnt;
            }

            // std::cout << "here: " << prev << ' ' << r << ' ' << y[i] << '\n';
            g[map[prev][y[i]]].push_back({map[r][y[i]], x[r] - x[prev]});
            g[map[r][y[i]]].push_back({map[prev][y[i]], x[r] - x[prev]});
            prev = r;
        }
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        auto prev = map[i].begin();
        for (auto curr = std::next(map[i].begin()) ; curr != map[i].end() ; ++curr)
        {
            // std::cout << "edge ver: " << x[i] << ' ' << prev->first << ' ' << x[i] << ' ' << curr->first << '\n';
            g[prev->second].push_back({curr->second, curr->first - prev->first});
            g[curr->second].push_back({prev->second, curr->first - prev->first});
            prev = curr;
        }
    }

    std::priority_queue <std::pair <llong,int>> pq;
    std::fill(dist + 1, dist + 1 + cnt, INF);
    pq.push({0, map[s][0]});
    dist[map[s][0]] = 0;

    while (pq.size())
    {
        auto [d, node] = pq.top();
        pq.pop();

        if (vis[node])
        {
            continue;
        }

        vis[node] = true;
        for (const auto &[u, ed] : g[node])
        {
            if (dist[u] > dist[node] + ed)
            {
                dist[u] = dist[node] + ed;
                pq.push({-dist[u], u});
            }
        }
    }

	return (dist[map[t][0]] == INF ? -1 : dist[map[t][0]]);
}

long long min_distance(std::vector<int> x, std::vector<int> h, std::vector<int> l, std::vector<int> r, std::vector<int> y, int s, int t) 
{
    n = x.size();
    m = l.size();
    ::s = s + 1; ::t = t + 1;

    for (int i = 0 ; i < n ; ++i)
    {
        ::h[i + 1] = h[i];
        ::x[i + 1] = x[i];
    }

    for (int i = 0 ; i < m ; ++i)
    {
        ::left[i + 1] = l[i] + 1;
        ::right[i + 1] = r[i] + 1;
        ::y[i + 1] = y[i];
    }

    return solve();
}

Compilation message

walk.cpp: In member function 'void Sparse::build(int*)':
walk.cpp:51:89: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   51 |                 sparse[lg][i] = std::max(sparse[lg - 1][i], sparse[lg - 1][i + (1 << lg - 1)]);
      |                                                                                      ~~~^~~
walk.cpp:58:33: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   58 |             if ((1 << getLOG[i] + 1) < i) getLOG[i]++;
      |                       ~~~~~~~~~~^~~
walk.cpp: In function 'llong solve()':
walk.cpp:91:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   91 |                 mid = l + r >> 1;
      |                       ~~^~~
walk.cpp: At global scope:
walk.cpp:32:9: warning: '{anonymous}::cntNodes' defined but not used [-Wunused-variable]
   32 |     int cntNodes;
      |         ^~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 44376 KB Output is correct
2 Correct 10 ms 44508 KB Output is correct
3 Correct 12 ms 44636 KB Output is correct
4 Correct 10 ms 44636 KB Output is correct
5 Correct 10 ms 44532 KB Output is correct
6 Correct 11 ms 44636 KB Output is correct
7 Correct 11 ms 44516 KB Output is correct
8 Correct 11 ms 44636 KB Output is correct
9 Correct 10 ms 44632 KB Output is correct
10 Correct 10 ms 44636 KB Output is correct
11 Correct 12 ms 44604 KB Output is correct
12 Correct 12 ms 44636 KB Output is correct
13 Correct 10 ms 44888 KB Output is correct
14 Correct 11 ms 44636 KB Output is correct
15 Correct 11 ms 44636 KB Output is correct
16 Correct 11 ms 44516 KB Output is correct
17 Correct 11 ms 44636 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 44380 KB Output is correct
2 Correct 10 ms 44380 KB Output is correct
3 Correct 612 ms 139204 KB Output is correct
4 Correct 435 ms 154704 KB Output is correct
5 Correct 291 ms 140864 KB Output is correct
6 Correct 284 ms 130384 KB Output is correct
7 Correct 299 ms 140880 KB Output is correct
8 Correct 850 ms 165712 KB Output is correct
9 Correct 354 ms 138208 KB Output is correct
10 Correct 751 ms 194388 KB Output is correct
11 Correct 241 ms 97876 KB Output is correct
12 Correct 123 ms 85584 KB Output is correct
13 Correct 541 ms 176724 KB Output is correct
14 Correct 155 ms 84052 KB Output is correct
15 Correct 150 ms 85184 KB Output is correct
16 Correct 142 ms 85920 KB Output is correct
17 Correct 143 ms 83792 KB Output is correct
18 Correct 230 ms 86728 KB Output is correct
19 Correct 21 ms 46428 KB Output is correct
20 Correct 53 ms 64340 KB Output is correct
21 Correct 132 ms 82740 KB Output is correct
22 Correct 131 ms 85332 KB Output is correct
23 Correct 250 ms 94068 KB Output is correct
24 Correct 142 ms 85328 KB Output is correct
25 Correct 133 ms 83792 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 54952 KB Output is correct
2 Runtime error 1012 ms 446412 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 54952 KB Output is correct
2 Runtime error 1012 ms 446412 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 44376 KB Output is correct
2 Correct 10 ms 44508 KB Output is correct
3 Correct 12 ms 44636 KB Output is correct
4 Correct 10 ms 44636 KB Output is correct
5 Correct 10 ms 44532 KB Output is correct
6 Correct 11 ms 44636 KB Output is correct
7 Correct 11 ms 44516 KB Output is correct
8 Correct 11 ms 44636 KB Output is correct
9 Correct 10 ms 44632 KB Output is correct
10 Correct 10 ms 44636 KB Output is correct
11 Correct 12 ms 44604 KB Output is correct
12 Correct 12 ms 44636 KB Output is correct
13 Correct 10 ms 44888 KB Output is correct
14 Correct 11 ms 44636 KB Output is correct
15 Correct 11 ms 44636 KB Output is correct
16 Correct 11 ms 44516 KB Output is correct
17 Correct 11 ms 44636 KB Output is correct
18 Correct 11 ms 44380 KB Output is correct
19 Correct 10 ms 44380 KB Output is correct
20 Correct 612 ms 139204 KB Output is correct
21 Correct 435 ms 154704 KB Output is correct
22 Correct 291 ms 140864 KB Output is correct
23 Correct 284 ms 130384 KB Output is correct
24 Correct 299 ms 140880 KB Output is correct
25 Correct 850 ms 165712 KB Output is correct
26 Correct 354 ms 138208 KB Output is correct
27 Correct 751 ms 194388 KB Output is correct
28 Correct 241 ms 97876 KB Output is correct
29 Correct 123 ms 85584 KB Output is correct
30 Correct 541 ms 176724 KB Output is correct
31 Correct 155 ms 84052 KB Output is correct
32 Correct 150 ms 85184 KB Output is correct
33 Correct 142 ms 85920 KB Output is correct
34 Correct 143 ms 83792 KB Output is correct
35 Correct 230 ms 86728 KB Output is correct
36 Correct 21 ms 46428 KB Output is correct
37 Correct 53 ms 64340 KB Output is correct
38 Correct 132 ms 82740 KB Output is correct
39 Correct 131 ms 85332 KB Output is correct
40 Correct 250 ms 94068 KB Output is correct
41 Correct 142 ms 85328 KB Output is correct
42 Correct 133 ms 83792 KB Output is correct
43 Correct 59 ms 54952 KB Output is correct
44 Runtime error 1012 ms 446412 KB Execution killed with signal 11
45 Halted 0 ms 0 KB -