oj.uz

Submission #564908

# Submission time Handle Problem Language Result Execution time Memory
564908 2022-05-20T00:47:18 Z training4usaco Jakarta Skyscrapers (APIO15_skyscraper) C++11
100 / 100
 221 ms 8616 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];
set<int> jumpsset[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]));
    
    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) {
                    dist[node.s + jump * j] = node.f + j;

                    pq.push(mp(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) {
                    dist[node.s - jump * j] = node.f + j;
                    pq.push(mp(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];
        jumpsset[b[i]].insert(p[i]);
    }
    for(int i = 0; i < n; ++i) {
        for(auto jump : jumpsset[i]) {
            jumps[i].push_back(jump);
        }
    }

    for(int i = 0; i <= n; ++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 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 2 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct
16 Correct 2 ms 2388 KB Output is correct
17 Correct 3 ms 2516 KB Output is correct
18 Correct 2 ms 2516 KB Output is correct
19 Correct 2 ms 2388 KB Output is correct
20 Correct 3 ms 2516 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2516 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 2 ms 2388 KB Output is correct
27 Correct 2 ms 2388 KB Output is correct
28 Correct 2 ms 2516 KB Output is correct
29 Correct 5 ms 2692 KB Output is correct
30 Correct 2 ms 2516 KB Output is correct
31 Correct 2 ms 2516 KB Output is correct
32 Correct 2 ms 2516 KB Output is correct
33 Correct 5 ms 2900 KB Output is correct
34 Correct 5 ms 2900 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 1 ms 2388 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 2 ms 2508 KB Output is correct
16 Correct 2 ms 2400 KB Output is correct
17 Correct 3 ms 2516 KB Output is correct
18 Correct 1 ms 2516 KB Output is correct
19 Correct 1 ms 2388 KB Output is correct
20 Correct 3 ms 2516 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 2 ms 2516 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2388 KB Output is correct
27 Correct 2 ms 2388 KB Output is correct
28 Correct 2 ms 2516 KB Output is correct
29 Correct 3 ms 2644 KB Output is correct
30 Correct 3 ms 2516 KB Output is correct
31 Correct 3 ms 2516 KB Output is correct
32 Correct 2 ms 2516 KB Output is correct
33 Correct 4 ms 2900 KB Output is correct
34 Correct 5 ms 2900 KB Output is correct
35 Correct 14 ms 4180 KB Output is correct
36 Correct 3 ms 2772 KB Output is correct
37 Correct 8 ms 3668 KB Output is correct
38 Correct 13 ms 4356 KB Output is correct
39 Correct 13 ms 4308 KB Output is correct
40 Correct 13 ms 4308 KB Output is correct
41 Correct 13 ms 4308 KB Output is correct
42 Correct 5 ms 2644 KB Output is correct
43 Correct 5 ms 2640 KB Output is correct
44 Correct 7 ms 2772 KB Output is correct
45 Correct 15 ms 4540 KB Output is correct
46 Correct 14 ms 4564 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 2 ms 2388 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 2 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 1 ms 2388 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct
16 Correct 2 ms 2388 KB Output is correct
17 Correct 2 ms 2516 KB Output is correct
18 Correct 3 ms 2516 KB Output is correct
19 Correct 2 ms 2388 KB Output is correct
20 Correct 4 ms 2636 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2524 KB Output is correct
25 Correct 2 ms 2648 KB Output is correct
26 Correct 2 ms 2508 KB Output is correct
27 Correct 2 ms 2400 KB Output is correct
28 Correct 2 ms 2528 KB Output is correct
29 Correct 3 ms 2656 KB Output is correct
30 Correct 2 ms 2512 KB Output is correct
31 Correct 3 ms 2528 KB Output is correct
32 Correct 3 ms 2528 KB Output is correct
33 Correct 5 ms 2908 KB Output is correct
34 Correct 4 ms 2900 KB Output is correct
35 Correct 14 ms 4052 KB Output is correct
36 Correct 3 ms 2772 KB Output is correct
37 Correct 11 ms 3700 KB Output is correct
38 Correct 12 ms 4308 KB Output is correct
39 Correct 17 ms 4308 KB Output is correct
40 Correct 16 ms 4308 KB Output is correct
41 Correct 14 ms 4308 KB Output is correct
42 Correct 5 ms 2648 KB Output is correct
43 Correct 5 ms 2652 KB Output is correct
44 Correct 6 ms 2776 KB Output is correct
45 Correct 13 ms 4564 KB Output is correct
46 Correct 14 ms 4592 KB Output is correct
47 Correct 18 ms 4720 KB Output is correct
48 Correct 9 ms 4184 KB Output is correct
49 Correct 9 ms 4076 KB Output is correct
50 Correct 6 ms 3668 KB Output is correct
51 Correct 33 ms 5332 KB Output is correct
52 Correct 27 ms 5336 KB Output is correct
53 Correct 18 ms 5456 KB Output is correct
54 Correct 3 ms 2780 KB Output is correct
55 Correct 3 ms 2784 KB Output is correct
56 Correct 221 ms 5132 KB Output is correct
57 Correct 40 ms 3920 KB Output is correct
58 Correct 7 ms 3028 KB Output is correct
59 Correct 8 ms 3028 KB Output is correct
60 Correct 8 ms 2944 KB Output is correct
61 Correct 8 ms 3156 KB Output is correct
62 Correct 10 ms 5076 KB Output is correct
63 Correct 34 ms 6572 KB Output is correct
64 Correct 38 ms 6488 KB Output is correct
65 Correct 42 ms 6520 KB Output is correct
66 Correct 86 ms 8616 KB Output is correct
67 Correct 92 ms 8576 KB Output is correct