oj.uz

Submission #1014282

# Submission time Handle Problem Language Result Execution time Memory
1014282 2024-07-04T15:57:21 Z ByeWorld Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 375 ms 5840 KB 
#include <bits/stdc++.h>
// #define int long long
#define fi first
#define se second
 
using namespace std;
 
const int inf = 1e9;
 
int b[30000], p[30000], dist[30000];
vector<int> v[30000];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
 
int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n, m;
        cin >> n >> m;
 
        for (int i = 0; i < m; i++) {
                cin >> b[i] >> p[i];
 
                v[b[i]].push_back(p[i]);
        }
 
        for (int i = 0; i < n; i++) {
                dist[i] = inf;
                sort(v[i].begin(), v[i].end());
                v[i].erase(unique(v[i].begin(), v[i].end()), v[i].end());
        }
 
        int ans = -1;
        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;
 
                if (x == b[1]) {
                        ans = w;
                        break;
                }
 
                for (auto k : v[x]) {
                  	int cnt = 1;
                        for (int i = x + k; i < n; i += k) {
                                if (w + cnt < dist[i]) {
                                        dist[i] = w + cnt;
                                        pq.push({dist[i], i});
                                }
                          cnt++;
                        }
 	cnt = 1;
                        for (int i = x - k; i >= 0; i -= k) {
                                if (w + cnt < dist[i]) {
                                        dist[i] = w + cnt;
                                        pq.push({dist[i], i});
                                }
                          cnt++;
                        }
                }
        }
 
        cout << ans << '\n';
        
        return 0;
}

Compilation message

skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:38:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   38 |                 auto [w, x] = pq.top();
      |                      ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1128 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 0 ms 1116 KB Output is correct
11 Correct 1 ms 1368 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 992 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 0 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 2 ms 1368 KB Output is correct
30 Correct 2 ms 1116 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 2 ms 1504 KB Output is correct
34 Correct 2 ms 1504 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 0 ms 1116 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1192 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 5 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1164 KB Output is correct
29 Correct 2 ms 1372 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 3 ms 1504 KB Output is correct
34 Correct 3 ms 1504 KB Output is correct
35 Correct 7 ms 1628 KB Output is correct
36 Correct 1 ms 1164 KB Output is correct
37 Correct 6 ms 1628 KB Output is correct
38 Correct 5 ms 1628 KB Output is correct
39 Correct 8 ms 1624 KB Output is correct
40 Correct 4 ms 1624 KB Output is correct
41 Correct 4 ms 1624 KB Output is correct
42 Correct 3 ms 1628 KB Output is correct
43 Correct 6 ms 1620 KB Output is correct
44 Correct 5 ms 1628 KB Output is correct
45 Correct 9 ms 1884 KB Output is correct
46 Correct 6 ms 1884 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1272 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1112 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 2 ms 1428 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 3 ms 1504 KB Output is correct
34 Correct 2 ms 1504 KB Output is correct
35 Correct 7 ms 1628 KB Output is correct
36 Correct 2 ms 1112 KB Output is correct
37 Correct 3 ms 1628 KB Output is correct
38 Correct 4 ms 1628 KB Output is correct
39 Correct 4 ms 1628 KB Output is correct
40 Correct 4 ms 1628 KB Output is correct
41 Correct 8 ms 1628 KB Output is correct
42 Correct 4 ms 1628 KB Output is correct
43 Correct 4 ms 1628 KB Output is correct
44 Correct 5 ms 1628 KB Output is correct
45 Correct 8 ms 1880 KB Output is correct
46 Correct 6 ms 2136 KB Output is correct
47 Correct 9 ms 2260 KB Output is correct
48 Correct 6 ms 1880 KB Output is correct
49 Correct 4 ms 1628 KB Output is correct
50 Correct 3 ms 1628 KB Output is correct
51 Correct 12 ms 3284 KB Output is correct
52 Correct 11 ms 2520 KB Output is correct
53 Correct 7 ms 2140 KB Output is correct
54 Correct 2 ms 1372 KB Output is correct
55 Correct 2 ms 1372 KB Output is correct
56 Correct 375 ms 2784 KB Output is correct
57 Correct 2 ms 2004 KB Output is correct
58 Correct 5 ms 1800 KB Output is correct
59 Correct 5 ms 1900 KB Output is correct
60 Correct 5 ms 1884 KB Output is correct
61 Correct 6 ms 1884 KB Output is correct
62 Correct 6 ms 2448 KB Output is correct
63 Correct 23 ms 3796 KB Output is correct
64 Correct 27 ms 3896 KB Output is correct
65 Correct 29 ms 3800 KB Output is correct
66 Correct 64 ms 5836 KB Output is correct
67 Correct 44 ms 5840 KB Output is correct