oj.uz

Submission #735555

# Submission time Handle Problem Language Result Execution time Memory
735555 2023-05-04T10:30:45 Z vjudge1 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 215876 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) + 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 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 0 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 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 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 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 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 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 2 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 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 3 ms 3284 KB Output is correct
20 Correct 3 ms 3412 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 5 ms 2516 KB Output is correct
24 Correct 4 ms 3156 KB Output is correct
25 Correct 4 ms 3412 KB Output is correct
26 Correct 3 ms 3412 KB Output is correct
27 Correct 3 ms 3404 KB Output is correct
28 Correct 4 ms 3412 KB Output is correct
29 Correct 11 ms 3388 KB Output is correct
30 Correct 4 ms 3288 KB Output is correct
31 Correct 6 ms 3412 KB Output is correct
32 Correct 4 ms 3548 KB Output is correct
33 Correct 12 ms 4180 KB Output is correct
34 Correct 7 ms 4052 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 1 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 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 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 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 3 ms 3284 KB Output is correct
20 Correct 4 ms 3412 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 3 ms 2516 KB Output is correct
24 Correct 4 ms 3156 KB Output is correct
25 Correct 4 ms 3412 KB Output is correct
26 Correct 3 ms 3384 KB Output is correct
27 Correct 3 ms 3412 KB Output is correct
28 Correct 4 ms 3412 KB Output is correct
29 Correct 11 ms 3284 KB Output is correct
30 Correct 4 ms 3284 KB Output is correct
31 Correct 6 ms 3412 KB Output is correct
32 Correct 4 ms 3540 KB Output is correct
33 Correct 14 ms 4180 KB Output is correct
34 Correct 8 ms 4180 KB Output is correct
35 Correct 16 ms 3824 KB Output is correct
36 Correct 4 ms 1748 KB Output is correct
37 Correct 21 ms 5844 KB Output is correct
38 Correct 21 ms 5868 KB Output is correct
39 Correct 17 ms 5776 KB Output is correct
40 Correct 19 ms 5904 KB Output is correct
41 Correct 22 ms 5876 KB Output is correct
42 Correct 14 ms 4112 KB Output is correct
43 Correct 13 ms 4120 KB Output is correct
44 Correct 14 ms 4008 KB Output is correct
45 Correct 32 ms 9812 KB Output is correct
46 Correct 22 ms 9752 KB Output is correct

Subtask #5
0 / 43.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 0 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 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 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 3 ms 2824 KB Output is correct
19 Correct 2 ms 3284 KB Output is correct
20 Correct 3 ms 3296 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 5 ms 2516 KB Output is correct
24 Correct 4 ms 3156 KB Output is correct
25 Correct 4 ms 3412 KB Output is correct
26 Correct 3 ms 3412 KB Output is correct
27 Correct 3 ms 3412 KB Output is correct
28 Correct 4 ms 3540 KB Output is correct
29 Correct 11 ms 3284 KB Output is correct
30 Correct 4 ms 3284 KB Output is correct
31 Correct 6 ms 3432 KB Output is correct
32 Correct 4 ms 3540 KB Output is correct
33 Correct 11 ms 4180 KB Output is correct
34 Correct 11 ms 4172 KB Output is correct
35 Correct 16 ms 3824 KB Output is correct
36 Correct 4 ms 1748 KB Output is correct
37 Correct 18 ms 5844 KB Output is correct
38 Correct 21 ms 5896 KB Output is correct
39 Correct 19 ms 5780 KB Output is correct
40 Correct 20 ms 5896 KB Output is correct
41 Correct 19 ms 5844 KB Output is correct
42 Correct 13 ms 4120 KB Output is correct
43 Correct 14 ms 4120 KB Output is correct
44 Correct 18 ms 4024 KB Output is correct
45 Correct 29 ms 9872 KB Output is correct
46 Correct 22 ms 9812 KB Output is correct
47 Correct 55 ms 52172 KB Output is correct
48 Correct 80 ms 116420 KB Output is correct
49 Correct 90 ms 131912 KB Output is correct
50 Correct 114 ms 151336 KB Output is correct
51 Correct 126 ms 170540 KB Output is correct
52 Correct 128 ms 170568 KB Output is correct
53 Correct 110 ms 167868 KB Output is correct
54 Correct 90 ms 166444 KB Output is correct
55 Correct 95 ms 166568 KB Output is correct
56 Correct 117 ms 167876 KB Output is correct
57 Correct 93 ms 166620 KB Output is correct
58 Correct 107 ms 167356 KB Output is correct
59 Correct 112 ms 167496 KB Output is correct
60 Correct 114 ms 167948 KB Output is correct
61 Correct 112 ms 167784 KB Output is correct
62 Correct 161 ms 171228 KB Output is correct
63 Correct 188 ms 203436 KB Output is correct
64 Correct 204 ms 215876 KB Output is correct
65 Correct 523 ms 214156 KB Output is correct
66 Execution timed out 1076 ms 204764 KB Time limit exceeded
67 Halted 0 ms 0 KB -