oj.uz

Submission #569525

# Submission time Handle Problem Language Result Execution time Memory
569525 2022-05-27T13:12:01 Z Forested Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 798 ms 240088 KB 
#ifndef LOCAL
#define FAST_IO
#endif

// ===== template.hpp =====
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

template <typename F, typename Comp = less<>>
Vec<i32> sort_index(i32 n, F f, Comp comp = Comp()) {
    Vec<i32> idx(n);
    iota(ALL(idx), 0);
    sort(ALL(idx), [&](i32 i, i32 j) -> bool {
        return comp(f(i), f(j));
    });
    return idx;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;

#ifdef FAST_IO
struct FastIO {
    FastIO() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(10);
    }
} fast_io;
#endif
// ===== template.hpp =====

#ifdef DEBUGF
#include "cpl/template/debug.hpp"
#else
#define DBG(x) (void) 0
#endif

// ===== graph.hpp =====

#include <utility>
#include <vector>
#include <numeric>
#include <cassert>

template <typename Edge>
class Graph {
    std::vector<std::vector<Edge>> edges;

public:
    Graph() : edges() {}
    Graph(int v) : edges(v) {
        assert(v >= 0);
    }
    
    std::vector<int> add_vertices(int n) {
        int v = (int) edges.size();
        std::vector<int> idx(n);
        std::iota(idx.begin(), idx.end(), v);
        edges.resize(edges.size() + n);
        return idx;
    }

    template <typename... T>
    void add_directed_edge(int from, int to, T &&...val) {
        assert(from >= 0 && from < (int) edges.size());
        assert(to >= 0 && to < (int) edges.size());
        edges[from].emplace_back(Edge(to, std::forward<T>(val)...));
    }

    template <typename... T>
    void add_undirected_edge(int u, int v, const T &...val) {
        assert(u >= 0 && u < (int) edges.size());
        assert(v >= 0 && v < (int) edges.size());
        edges[u].emplace_back(Edge(v, val...));
        edges[v].emplace_back(Edge(u, val...));
    }

    int size() const {
        return (int) edges.size();
    }

    const std::vector<Edge> &operator[](int v) const {
        assert(v >= 0 && v < (int) edges.size());
        return edges[v];
    }

    std::vector<Edge> &operator[](int v) {
        assert(v >= 0 && v < (int) edges.size());
        return edges[v];
    }
};

struct UnweightedEdge {
    int to;

    UnweightedEdge(int t) : to(t) {}
    
    explicit operator int() const {
        return to;
    }

    using Weight = std::size_t;
    Weight weight() const {
        return 1;
    }
};

template <typename T>
struct WeightedEdge {
    int to;
    T wt;

    WeightedEdge(int t, const T &w) : to(t), wt(w) {}

    explicit operator int() const {
        return to;
    }

    using Weight = T;
    Weight weight() const {
        return wt;
    }
};

// ===== graph.hpp =====
// ===== dijkstra.hpp =====


#include <queue>
#include <limits>
#include <functional>

template <typename T>
std::vector<T> dijkstra(const Graph<WeightedEdge<T>> &g, int s) {
    std::vector<T> dist(g.size(), std::numeric_limits<T>::max());
    std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<>> pq;
    dist[s] = T(0);
    pq.emplace(0, s);
    while (!pq.empty()) {
        auto [d, v] = pq.top();
        pq.pop();
        if (d > dist[v]) {
            continue;
        }
        for (const WeightedEdge<T> &e : g[v]) {
            if (d + e.wt < dist[e.to]) {
                dist[e.to] = d + e.wt;
                pq.emplace(dist[e.to], e.to);
            }
        }
    }
    return dist;
}
// ===== dijkstra.hpp =====

int main() {
    i32 n, m;
    cin >> n >> m;
    Vec<i32> b(m), p(m);
    REP(i, m) {
        cin >> b[i] >> p[i];
    }
    
    i32 sqrtn = (i32) floor(sqrt(n) / 2 + 1);
    
    Graph<WeightedEdge<i32>> g((sqrtn + 1) * n);
    REP(d, 1, sqrtn + 1) {
        REP(i, n - d) {
            i32 v = d * n + i;
            g.add_undirected_edge(v, v + d, 1);
        }
        REP(i, n) {
            i32 v = d * n + i;
            g.add_directed_edge(v, i, 0);
        }
    }
    REP(i, m) {
        if (p[i] <= sqrtn) {
            g.add_undirected_edge(b[i], p[i] * n + b[i], 0);
            continue;
        }
        i32 num = n / p[i];
        if (b[i] % p[i] < n % p[i]) {
            ++num;
        }
        i32 cent = b[i] / p[i];
        REP(j, num) {
            i32 pos = b[i] + (j - cent) * p[i];
            g.add_directed_edge(b[i], pos, abs(j - cent));
        }
    }
    
    DBG(dijkstra(g, b[0]));
    i32 ans = dijkstra(g, b[0])[b[1]];
    if (ans == numeric_limits<i32>::max()) {
        cout << -1 << '\n';
    } else {
        cout << ans << '\n';
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1236 KB Output is correct
18 Correct 6 ms 3064 KB Output is correct
19 Correct 8 ms 3812 KB Output is correct
20 Correct 8 ms 3816 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 7 ms 3284 KB Output is correct
23 Correct 6 ms 2772 KB Output is correct
24 Correct 9 ms 3540 KB Output is correct
25 Correct 9 ms 3840 KB Output is correct
26 Correct 9 ms 3804 KB Output is correct
27 Correct 9 ms 3796 KB Output is correct
28 Correct 12 ms 3924 KB Output is correct
29 Correct 13 ms 4316 KB Output is correct
30 Correct 9 ms 3924 KB Output is correct
31 Correct 10 ms 4180 KB Output is correct
32 Correct 8 ms 4048 KB Output is correct
33 Correct 12 ms 4692 KB Output is correct
34 Correct 13 ms 4804 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1216 KB Output is correct
18 Correct 7 ms 3156 KB Output is correct
19 Correct 8 ms 3784 KB Output is correct
20 Correct 8 ms 3860 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 7 ms 3352 KB Output is correct
23 Correct 6 ms 2772 KB Output is correct
24 Correct 8 ms 3616 KB Output is correct
25 Correct 8 ms 3840 KB Output is correct
26 Correct 9 ms 3796 KB Output is correct
27 Correct 11 ms 3792 KB Output is correct
28 Correct 10 ms 3924 KB Output is correct
29 Correct 12 ms 4308 KB Output is correct
30 Correct 9 ms 3924 KB Output is correct
31 Correct 8 ms 4180 KB Output is correct
32 Correct 8 ms 4052 KB Output is correct
33 Correct 14 ms 4812 KB Output is correct
34 Correct 17 ms 4816 KB Output is correct
35 Correct 13 ms 3676 KB Output is correct
36 Correct 6 ms 1876 KB Output is correct
37 Correct 18 ms 5844 KB Output is correct
38 Correct 19 ms 5716 KB Output is correct
39 Correct 24 ms 5716 KB Output is correct
40 Correct 22 ms 5812 KB Output is correct
41 Correct 23 ms 5844 KB Output is correct
42 Correct 15 ms 4584 KB Output is correct
43 Correct 12 ms 4508 KB Output is correct
44 Correct 12 ms 4624 KB Output is correct
45 Correct 22 ms 9036 KB Output is correct
46 Correct 25 ms 8860 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1236 KB Output is correct
18 Correct 6 ms 3084 KB Output is correct
19 Correct 8 ms 3796 KB Output is correct
20 Correct 10 ms 3772 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 8 ms 3284 KB Output is correct
23 Correct 7 ms 2772 KB Output is correct
24 Correct 8 ms 3600 KB Output is correct
25 Correct 9 ms 3856 KB Output is correct
26 Correct 9 ms 3808 KB Output is correct
27 Correct 11 ms 3796 KB Output is correct
28 Correct 12 ms 3924 KB Output is correct
29 Correct 14 ms 4308 KB Output is correct
30 Correct 11 ms 3924 KB Output is correct
31 Correct 9 ms 4180 KB Output is correct
32 Correct 9 ms 4052 KB Output is correct
33 Correct 18 ms 4704 KB Output is correct
34 Correct 13 ms 4784 KB Output is correct
35 Correct 14 ms 3720 KB Output is correct
36 Correct 5 ms 1876 KB Output is correct
37 Correct 19 ms 5772 KB Output is correct
38 Correct 24 ms 5676 KB Output is correct
39 Correct 23 ms 5716 KB Output is correct
40 Correct 22 ms 5716 KB Output is correct
41 Correct 20 ms 5788 KB Output is correct
42 Correct 12 ms 4644 KB Output is correct
43 Correct 12 ms 4520 KB Output is correct
44 Correct 13 ms 4568 KB Output is correct
45 Correct 24 ms 9044 KB Output is correct
46 Correct 23 ms 8832 KB Output is correct
47 Correct 217 ms 58076 KB Output is correct
48 Correct 326 ms 135756 KB Output is correct
49 Correct 357 ms 153724 KB Output is correct
50 Correct 464 ms 176716 KB Output is correct
51 Correct 518 ms 198344 KB Output is correct
52 Correct 507 ms 198440 KB Output is correct
53 Correct 485 ms 196300 KB Output is correct
54 Correct 443 ms 195188 KB Output is correct
55 Correct 425 ms 195144 KB Output is correct
56 Correct 501 ms 196584 KB Output is correct
57 Correct 519 ms 195388 KB Output is correct
58 Correct 498 ms 196244 KB Output is correct
59 Correct 477 ms 196228 KB Output is correct
60 Correct 474 ms 196952 KB Output is correct
61 Correct 492 ms 196460 KB Output is correct
62 Correct 497 ms 199024 KB Output is correct
63 Correct 513 ms 219884 KB Output is correct
64 Correct 526 ms 228680 KB Output is correct
65 Correct 561 ms 234972 KB Output is correct
66 Correct 798 ms 239112 KB Output is correct
67 Correct 786 ms 240088 KB Output is correct