oj.uz

Submission #879075

# Submission time Handle Problem Language Result Execution time Memory
879075 2023-11-26T09:09:55 Z Pelmeni Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 607 ms 13008 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
// #define int long long
typedef pair<int, int> T;
const int oo = 1e9 + 7, K = 30;
const int mod = 998244353;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<T>> g(n + 2);
    vector<vector<int>> doge(n + 1);
    int start, kon;
    for (int i = 0; i < m; i++) {
        int v, j;
        cin >> v >> j;
        if (i == 0) start = v;
        if (i == 1) kon = v;
        doge[v].emplace_back(j);
    }

    vector<int> dist(n + 2, oo);
    set<T> s;
    s.insert({0, start});
    dist[start] = 0;
    while ((int) s.size()) {
        auto [d, v] = *s.begin();
        s.erase(s.begin());
        if (dist[v] < d) continue;
        auto popraw = [&](int what, int from, int c) {
            if (dist[what] > dist[from] + c) {
                dist[what] = dist[from] + c;
                s.insert({dist[what], what});
            }
        };
        for (auto j : doge[v]) {
            for (int u = v - j, k = 1; u >= 0; u -= j, k++) {
                popraw(u, v, k);
            }
            for (int u = v + j, k = 1; u < n; u += j, k++) {
                popraw(u, v, k);
            }
        }
    }
    int ans = dist[kon];
    if (ans == oo) ans = -1;
    cout << ans << "\n";
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Compilation message

skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:26:15: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |     dist[start] = 0;
      |               ^
skyscraper.cpp:46:23: warning: 'kon' may be used uninitialized in this function [-Wmaybe-uninitialized]
   46 |     int ans = dist[kon];
      |                       ^

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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #3
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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 756 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 420 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 856 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 1116 KB Output is correct
34 Correct 2 ms 1116 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 648 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 3 ms 860 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 1116 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 5 ms 688 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 4 ms 860 KB Output is correct
38 Correct 6 ms 860 KB Output is correct
39 Correct 6 ms 860 KB Output is correct
40 Correct 6 ms 856 KB Output is correct
41 Correct 6 ms 860 KB Output is correct
42 Correct 36 ms 668 KB Output is correct
43 Correct 36 ms 604 KB Output is correct
44 Correct 36 ms 600 KB Output is correct
45 Correct 5 ms 1116 KB Output is correct
46 Correct 5 ms 1116 KB Output is correct

Subtask #5
43.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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 5 ms 712 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 1068 KB Output is correct
34 Correct 3 ms 1112 KB Output is correct
35 Correct 4 ms 856 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 4 ms 860 KB Output is correct
38 Correct 6 ms 860 KB Output is correct
39 Correct 6 ms 860 KB Output is correct
40 Correct 6 ms 860 KB Output is correct
41 Correct 6 ms 860 KB Output is correct
42 Correct 36 ms 604 KB Output is correct
43 Correct 36 ms 604 KB Output is correct
44 Correct 39 ms 600 KB Output is correct
45 Correct 5 ms 1112 KB Output is correct
46 Correct 5 ms 1120 KB Output is correct
47 Correct 15 ms 3420 KB Output is correct
48 Correct 4 ms 1880 KB Output is correct
49 Correct 4 ms 2140 KB Output is correct
50 Correct 3 ms 2140 KB Output is correct
51 Correct 25 ms 5724 KB Output is correct
52 Correct 25 ms 5424 KB Output is correct
53 Correct 11 ms 4188 KB Output is correct
54 Correct 3 ms 2652 KB Output is correct
55 Correct 3 ms 2652 KB Output is correct
56 Correct 536 ms 4316 KB Output is correct
57 Correct 47 ms 9296 KB Output is correct
58 Correct 607 ms 2648 KB Output is correct
59 Correct 484 ms 2648 KB Output is correct
60 Correct 542 ms 2804 KB Output is correct
61 Correct 453 ms 2808 KB Output is correct
62 Correct 7 ms 2908 KB Output is correct
63 Correct 36 ms 8272 KB Output is correct
64 Correct 36 ms 8300 KB Output is correct
65 Correct 42 ms 9564 KB Output is correct
66 Correct 56 ms 13008 KB Output is correct
67 Correct 56 ms 12884 KB Output is correct