oj.uz

Submission #1014261

# Submission time Handle Problem Language Result Execution time Memory
1014261 2024-07-04T15:36:35 Z aufan Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 4868 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

const int inff = 1e18;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n, m;
        cin >> n >> m;

        vector<int> b(m), p(m);
        for (int i = 0; i < m; i++) cin >> b[i] >> p[i];

        vector<vector<int>> v(n);
        for (int i = 0; i < m; i++) v[b[i]].push_back(p[i]);

        for (int i = 0; i < n; i++) {
                sort(v[i].begin(), v[i].end());
                v[i].erase(unique(v[i].begin(), v[i].end()), v[i].end());
        }

        vector<int> dist(n, inff);
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
        dist[b[0]] = 0;
        pq.push({dist[b[0]], b[0]});
        while (!pq.empty()) {
                auto [w, x] = pq.top();
                pq.pop();

                if (w > dist[x]) continue;

                for (auto k : v[x]) {
                        for (int i = x + k; i < n; i += k) {
                                if (w + (i - x) / k < dist[i]) {
                                        dist[i] = w + (i - x) / k;
                                        pq.push({dist[i], i});
                                }
                        }

                        for (int i = x - k; i >= 0; i -= k) {
                                if (w + (x - i) / k < dist[i]) {
                                        dist[i] = w + (x - i) / k;
                                        pq.push({dist[i], i});
                                }
                        }
                }
        }

        cout << (dist[b[1]] == inff ? -1 : dist[b[1]]) << '\n';
        
        return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 600 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 604 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 1 ms 344 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 448 KB Output is correct
7 Correct 1 ms 344 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 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 344 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 1 ms 456 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 464 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 10 ms 696 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 1244 KB Output is correct
34 Correct 3 ms 1248 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 1 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 456 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 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 468 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 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 10 ms 604 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 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 508 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 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 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 1244 KB Output is correct
34 Correct 4 ms 1244 KB Output is correct
35 Correct 4 ms 1628 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 4 ms 1360 KB Output is correct
38 Correct 6 ms 1884 KB Output is correct
39 Correct 5 ms 1880 KB Output is correct
40 Correct 6 ms 1884 KB Output is correct
41 Correct 6 ms 1884 KB Output is correct
42 Correct 4 ms 1496 KB Output is correct
43 Correct 3 ms 1572 KB Output is correct
44 Correct 12 ms 1564 KB Output is correct
45 Correct 7 ms 2200 KB Output is correct
46 Correct 8 ms 2264 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 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 344 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 500 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 10 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 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 472 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 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 2 ms 600 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 1244 KB Output is correct
34 Correct 3 ms 1248 KB Output is correct
35 Correct 4 ms 1628 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 4 ms 1624 KB Output is correct
38 Correct 6 ms 1816 KB Output is correct
39 Correct 6 ms 1884 KB Output is correct
40 Correct 6 ms 1884 KB Output is correct
41 Correct 7 ms 1884 KB Output is correct
42 Correct 3 ms 1544 KB Output is correct
43 Correct 4 ms 1532 KB Output is correct
44 Correct 13 ms 1492 KB Output is correct
45 Correct 7 ms 2264 KB Output is correct
46 Correct 7 ms 2264 KB Output is correct
47 Correct 13 ms 2996 KB Output is correct
48 Correct 4 ms 2140 KB Output is correct
49 Correct 4 ms 2056 KB Output is correct
50 Correct 3 ms 1884 KB Output is correct
51 Correct 22 ms 4868 KB Output is correct
52 Correct 19 ms 3800 KB Output is correct
53 Correct 10 ms 3800 KB Output is correct
54 Correct 2 ms 1760 KB Output is correct
55 Correct 2 ms 1788 KB Output is correct
56 Execution timed out 1067 ms 3636 KB Time limit exceeded
57 Halted 0 ms 0 KB -