oj.uz

Submission #735559

# Submission time Handle Problem Language Result Execution time Memory
735559 2023-05-04T10:32:51 Z vjudge1 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 383 ms 126800 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
        int n, m;
        cin >> n >> m;
        vector<int> a(m), b(m);
        for (int i = 0; i < m; i++) cin >> a[i] >> b[i];
        int sn = sqrt(n / (__lg(n) + 1)) + 1;
        vector<vector<int64_t>> d(n, vector<int64_t>(sn + 1, 9e18));
        vector<vector<vector<tuple<int, int, int>>>> adj(n, vector<vector<tuple<int, int, int>>>(sn + 1));

        for (int i = 0; i < m; i++) {
                if (b[i] < sn) {
                        adj[a[i]][sn].emplace_back(a[i], b[i], 0);
                } else {
                        for (int j = a[i] % b[i]; j < n; j += b[i]) {
                                adj[a[i]][sn].emplace_back(j, sn, abs(a[i] - j) / b[i]);
                        }
                }
        }

        d[a[0]][sn] = 0;
        priority_queue<tuple<int64_t, int, int>> pq;
        pq.emplace(0, a[0], sn);
        while (pq.size()) {
                auto [du, u, s] = pq.top();
                pq.pop();
                if (d[u][s] != -du) continue;
                du = -du;
                if (u == a[1]) return cout << du, 0;

                if (s != sn && u - s >= 0) {
                        int uu = u - s, ss = s, c = 1;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                        ss = sn;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                }

                if (s != sn && u + s < n) {
                        int uu = u + s, ss = s, c = 1;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                        ss = sn;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                }

                for (auto [uu, ss, c] : adj[u][s]) {
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                }
        }
        cout << -1;
}

Subtask #1
10.0 / 10.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 1 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

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 1 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 0 ms 212 KB Output is correct
8 Correct 1 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 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 468 KB Output is correct
15 Correct 2 ms 340 KB Output is correct

Subtask #3
14.0 / 14.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 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 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 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 2 ms 1364 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 3 ms 1492 KB Output is correct
25 Correct 2 ms 1364 KB Output is correct
26 Correct 2 ms 1492 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 3 ms 1620 KB Output is correct
29 Correct 4 ms 2388 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 3 ms 1876 KB Output is correct
32 Correct 3 ms 1748 KB Output is correct
33 Correct 6 ms 3028 KB Output is correct
34 Correct 5 ms 3080 KB Output is correct

Subtask #4
21.0 / 21.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 1 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 212 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 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 2 ms 1364 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 3 ms 1492 KB Output is correct
25 Correct 2 ms 1364 KB Output is correct
26 Correct 2 ms 1492 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 3 ms 1620 KB Output is correct
29 Correct 4 ms 2388 KB Output is correct
30 Correct 2 ms 1620 KB Output is correct
31 Correct 3 ms 1876 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 6 ms 3028 KB Output is correct
34 Correct 4 ms 3028 KB Output is correct
35 Correct 15 ms 3084 KB Output is correct
36 Correct 3 ms 980 KB Output is correct
37 Correct 19 ms 4920 KB Output is correct
38 Correct 19 ms 4628 KB Output is correct
39 Correct 17 ms 4564 KB Output is correct
40 Correct 19 ms 4500 KB Output is correct
41 Correct 18 ms 4564 KB Output is correct
42 Correct 12 ms 2196 KB Output is correct
43 Correct 12 ms 2068 KB Output is correct
44 Correct 12 ms 2088 KB Output is correct
45 Correct 24 ms 9044 KB Output is correct
46 Correct 23 ms 8720 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 1 ms 212 KB Output is correct
5 Correct 0 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 1 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 1 ms 476 KB Output is correct
12 Correct 2 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 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 1 ms 476 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 3 ms 1492 KB Output is correct
25 Correct 2 ms 1364 KB Output is correct
26 Correct 2 ms 1492 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 3 ms 1620 KB Output is correct
29 Correct 4 ms 2388 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 3 ms 1876 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 6 ms 3028 KB Output is correct
34 Correct 4 ms 3028 KB Output is correct
35 Correct 14 ms 3056 KB Output is correct
36 Correct 3 ms 980 KB Output is correct
37 Correct 14 ms 4880 KB Output is correct
38 Correct 18 ms 4632 KB Output is correct
39 Correct 18 ms 4572 KB Output is correct
40 Correct 18 ms 4508 KB Output is correct
41 Correct 18 ms 4624 KB Output is correct
42 Correct 12 ms 2196 KB Output is correct
43 Correct 16 ms 2136 KB Output is correct
44 Correct 13 ms 2092 KB Output is correct
45 Correct 23 ms 9184 KB Output is correct
46 Correct 22 ms 8724 KB Output is correct
47 Correct 40 ms 23444 KB Output is correct
48 Correct 40 ms 34088 KB Output is correct
49 Correct 40 ms 38264 KB Output is correct
50 Correct 39 ms 43092 KB Output is correct
51 Correct 66 ms 50028 KB Output is correct
52 Correct 69 ms 50340 KB Output is correct
53 Correct 56 ms 46816 KB Output is correct
54 Correct 32 ms 45828 KB Output is correct
55 Correct 33 ms 45780 KB Output is correct
56 Correct 61 ms 47028 KB Output is correct
57 Correct 36 ms 49480 KB Output is correct
58 Correct 49 ms 46936 KB Output is correct
59 Correct 48 ms 46740 KB Output is correct
60 Correct 50 ms 47680 KB Output is correct
61 Correct 49 ms 47012 KB Output is correct
62 Correct 82 ms 51384 KB Output is correct
63 Correct 117 ms 82460 KB Output is correct
64 Correct 129 ms 95108 KB Output is correct
65 Correct 160 ms 104000 KB Output is correct
66 Correct 383 ms 126408 KB Output is correct
67 Correct 222 ms 126800 KB Output is correct