oj.uz

답안 #495665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495665 2021-12-19T20:23:18 Z vishesh312 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 193 ms 67724 KB 
#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)(x).size()

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    int n, m, s, t;
    cin >> n >> m;
    vector<set<int>> ju(n);
    set<int> p;
    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        ju[a].insert(b);
        p.insert(b);
        if (i==0) s = a;
        if (i==1) t = a;
    }
    for (int i = 0; i < n; ++i) {
        for (int x : ju[i]) {
            int cur = i;
            while (cur+x < n) {
                cur += x;
                adj[i].push_back({cur, (cur-i)/x});
                if (ju[cur].count(x))
                    break;
            }
            cur = i;
            while (cur-x >= 0) {
                cur -= x;
                adj[i].push_back({cur, (i-cur)/x});
                if (ju[cur].count(x))
                    break;
            }
        }
    }
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;
    pq.push({0, s});
    vector<int> dist(n, (1<<30));
    dist[s] = 0;
    while (!pq.empty()) {
        auto [d, u] = pq.top();
        pq.pop();
        if (dist[u] < d)
            continue;
        for (auto [v, dd] : adj[u]) {
            if (dist[v] <= dist[u]+dd)
                continue;
            dist[v] = dist[u] + dd;
            pq.push({dist[v], v});
        }
    }
    cout << (dist[t]==(1<<30)?-1:dist[t]) << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Compilation message

skyscraper.cpp: In function 'void solve(int)':
skyscraper.cpp:51:11: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   51 |     dist[s] = 0;
      |           ^
skyscraper.cpp:64:20: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |     cout << (dist[t]==(1<<30)?-1:dist[t]) << '\n';
      |                    ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 316 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 428 KB Output is correct
15 Correct 1 ms 464 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 448 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 3 ms 584 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 2 ms 792 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 3 ms 1360 KB Output is correct
30 Correct 2 ms 720 KB Output is correct
31 Correct 2 ms 848 KB Output is correct
32 Correct 1 ms 720 KB Output is correct
33 Correct 5 ms 1996 KB Output is correct
34 Correct 5 ms 1996 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 584 KB Output is correct
18 Correct 1 ms 576 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 1 ms 584 KB Output is correct
24 Correct 3 ms 720 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 2 ms 720 KB Output is correct
29 Correct 3 ms 1360 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 2 ms 848 KB Output is correct
32 Correct 2 ms 720 KB Output is correct
33 Correct 6 ms 2000 KB Output is correct
34 Correct 5 ms 2000 KB Output is correct
35 Correct 15 ms 2876 KB Output is correct
36 Correct 3 ms 848 KB Output is correct
37 Correct 16 ms 3524 KB Output is correct
38 Correct 22 ms 3924 KB Output is correct
39 Correct 21 ms 3892 KB Output is correct
40 Correct 29 ms 3872 KB Output is correct
41 Correct 23 ms 3920 KB Output is correct
42 Correct 4 ms 656 KB Output is correct
43 Correct 5 ms 720 KB Output is correct
44 Correct 4 ms 740 KB Output is correct
45 Correct 21 ms 6516 KB Output is correct
46 Correct 21 ms 6608 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 2 ms 448 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 580 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 2 ms 720 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 2 ms 708 KB Output is correct
29 Correct 3 ms 1348 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 2 ms 848 KB Output is correct
32 Correct 2 ms 720 KB Output is correct
33 Correct 6 ms 2000 KB Output is correct
34 Correct 6 ms 1992 KB Output is correct
35 Correct 22 ms 2888 KB Output is correct
36 Correct 6 ms 880 KB Output is correct
37 Correct 17 ms 3520 KB Output is correct
38 Correct 23 ms 3912 KB Output is correct
39 Correct 28 ms 3956 KB Output is correct
40 Correct 21 ms 3912 KB Output is correct
41 Correct 21 ms 3868 KB Output is correct
42 Correct 7 ms 700 KB Output is correct
43 Correct 8 ms 720 KB Output is correct
44 Correct 5 ms 808 KB Output is correct
45 Correct 21 ms 6508 KB Output is correct
46 Correct 21 ms 6596 KB Output is correct
47 Correct 42 ms 11836 KB Output is correct
48 Correct 17 ms 6348 KB Output is correct
49 Correct 15 ms 5608 KB Output is correct
50 Correct 11 ms 5252 KB Output is correct
51 Correct 40 ms 9036 KB Output is correct
52 Correct 42 ms 9504 KB Output is correct
53 Correct 19 ms 5972 KB Output is correct
54 Correct 3 ms 3024 KB Output is correct
55 Correct 4 ms 3404 KB Output is correct
56 Correct 13 ms 5136 KB Output is correct
57 Correct 32 ms 11596 KB Output is correct
58 Correct 12 ms 3708 KB Output is correct
59 Correct 10 ms 4084 KB Output is correct
60 Correct 11 ms 4724 KB Output is correct
61 Correct 16 ms 4340 KB Output is correct
62 Correct 22 ms 9516 KB Output is correct
63 Correct 69 ms 26548 KB Output is correct
64 Correct 71 ms 29656 KB Output is correct
65 Correct 97 ms 39356 KB Output is correct
66 Correct 180 ms 67700 KB Output is correct
67 Correct 193 ms 67724 KB Output is correct