oj.uz

Submission #564907

# Submission time Handle Problem Language Result Execution time Memory
564907 2022-05-20T00:40:06 Z training4usaco Jakarta Skyscrapers (APIO15_skyscraper) C++11
100 / 100
 229 ms 6020 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
 
using namespace std;
 
#define MAXN 30005
#define INF 1000000009

#define pii pair<int, int>
#define mp make_pair
#define f first
#define s second

int n, m;
int b[MAXN];
int p[MAXN];
int dist[MAXN];
vector<int> jumps[MAXN];
 
void solve(int s) {
    dist[b[0]] = 0;
    priority_queue<pii, vector<pii>, greater<pii>> pq;

    pq.push(mp(0,b[0]));    // dist, pos
    
    while (!pq.empty()) {
        pii node = pq.top();
        pq.pop();

        if (node.f > dist[node.s]) {
            continue;
        }

        for(auto jump : jumps[node.s]) {
            for (int j = 1; node.s + jump * j < n; ++j) {   // forward
                if (dist[node.s + jump * j] > node.f + j) {
                    pq.push(mp(dist[node.s + jump * j] = node.f + j, node.s + jump * j));

                    if (binary_search(jumps[node.s + jump * j].begin(), jumps[node.s + jump * j].end(), jump)) {    // no need to have multiple doges going same "route"
                        break;
                    }
                }
            }
            for (int j = 1;node.s - jump * j >= 0;++j) {    // backward
                if (dist[node.s - jump * j] > node.f + j) {
                    pq.push(mp(dist[node.s - jump * j] = node.f + j, node.s - jump * j));
                    if (binary_search(jumps[node.s - jump * j].begin(), jumps[node.s - jump * j].end(), jump)) {
                        break;
                    }
                }
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    for(int i = 0; i < m; ++i) {
        cin >> b[i] >> p[i];
        jumps[b[i]].push_back(p[i]);
    }
    for(int i = 0; i < n; ++i) {
        sort(jumps[i].begin(), jumps[i].end());
        jumps[i].erase(unique(jumps[i].begin(), jumps[i].end()), jumps[i].end());
    }

    for(int i = 0; i < MAXN; ++i) {
        dist[i] = INF;
    }

    solve(b[0]);

    if (dist[b[1]] == INF) {
        cout << "-1" << endl;
        return 0;
    }
    cout << dist[b[1]] << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1032 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1160 KB Output is correct
11 Correct 2 ms 1172 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1032 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1036 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1168 KB Output is correct
15 Correct 1 ms 1172 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 1 ms 1168 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 1168 KB Output is correct
21 Correct 1 ms 1164 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 2 ms 1168 KB Output is correct
24 Correct 2 ms 1176 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 1 ms 1168 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 2 ms 1160 KB Output is correct
29 Correct 3 ms 1364 KB Output is correct
30 Correct 1 ms 1236 KB Output is correct
31 Correct 2 ms 1236 KB Output is correct
32 Correct 2 ms 1236 KB Output is correct
33 Correct 4 ms 1552 KB Output is correct
34 Correct 4 ms 1620 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1032 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1036 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1164 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 2 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 3 ms 1236 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 2 ms 1236 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 1 ms 1172 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 3 ms 1296 KB Output is correct
30 Correct 2 ms 1236 KB Output is correct
31 Correct 2 ms 1292 KB Output is correct
32 Correct 2 ms 1156 KB Output is correct
33 Correct 4 ms 1552 KB Output is correct
34 Correct 4 ms 1620 KB Output is correct
35 Correct 6 ms 1812 KB Output is correct
36 Correct 2 ms 1236 KB Output is correct
37 Correct 7 ms 1732 KB Output is correct
38 Correct 9 ms 1896 KB Output is correct
39 Correct 8 ms 1876 KB Output is correct
40 Correct 8 ms 1876 KB Output is correct
41 Correct 9 ms 1936 KB Output is correct
42 Correct 5 ms 1748 KB Output is correct
43 Correct 5 ms 1748 KB Output is correct
44 Correct 6 ms 1748 KB Output is correct
45 Correct 11 ms 2132 KB Output is correct
46 Correct 9 ms 2112 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1168 KB Output is correct
6 Correct 1 ms 1028 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1164 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1164 KB Output is correct
16 Correct 1 ms 1160 KB Output is correct
17 Correct 1 ms 1236 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 3 ms 1236 KB Output is correct
21 Correct 1 ms 1168 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 2 ms 1176 KB Output is correct
24 Correct 2 ms 1236 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 2 ms 1168 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 1 ms 1236 KB Output is correct
29 Correct 3 ms 1284 KB Output is correct
30 Correct 1 ms 1236 KB Output is correct
31 Correct 2 ms 1236 KB Output is correct
32 Correct 1 ms 1160 KB Output is correct
33 Correct 3 ms 1552 KB Output is correct
34 Correct 4 ms 1492 KB Output is correct
35 Correct 6 ms 1748 KB Output is correct
36 Correct 3 ms 1236 KB Output is correct
37 Correct 7 ms 1664 KB Output is correct
38 Correct 9 ms 1900 KB Output is correct
39 Correct 8 ms 1876 KB Output is correct
40 Correct 8 ms 1876 KB Output is correct
41 Correct 10 ms 1876 KB Output is correct
42 Correct 5 ms 1824 KB Output is correct
43 Correct 5 ms 1748 KB Output is correct
44 Correct 7 ms 1748 KB Output is correct
45 Correct 8 ms 2132 KB Output is correct
46 Correct 9 ms 2132 KB Output is correct
47 Correct 14 ms 2512 KB Output is correct
48 Correct 7 ms 2004 KB Output is correct
49 Correct 6 ms 2004 KB Output is correct
50 Correct 4 ms 1684 KB Output is correct
51 Correct 23 ms 2896 KB Output is correct
52 Correct 23 ms 2896 KB Output is correct
53 Correct 13 ms 2956 KB Output is correct
54 Correct 2 ms 1284 KB Output is correct
55 Correct 2 ms 1288 KB Output is correct
56 Correct 229 ms 2528 KB Output is correct
57 Correct 35 ms 2380 KB Output is correct
58 Correct 7 ms 1956 KB Output is correct
59 Correct 7 ms 1900 KB Output is correct
60 Correct 8 ms 1876 KB Output is correct
61 Correct 7 ms 2004 KB Output is correct
62 Correct 9 ms 2644 KB Output is correct
63 Correct 28 ms 3984 KB Output is correct
64 Correct 27 ms 3912 KB Output is correct
65 Correct 36 ms 3924 KB Output is correct
66 Correct 78 ms 6020 KB Output is correct
67 Correct 75 ms 5940 KB Output is correct