oj.uz

Submission #847155

# Submission time Handle Problem Language Result Execution time Memory
847155 2023-09-09T08:50:28 Z vjudge1 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 25932 KB 
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;

const int N = 3e4 + 5;
const int oo = 1e9;
const int SQRT = 175;

#define eb emplace_back

struct node {
    int w, u, s;

    node() {
        w = u = s = 0;
    }

    node(int w, int u, int s) : w(w), u(u), s(s) {}

    friend bool operator > (node a, node b) {
        return a.w > b.w;
    }
};

int n, m;
int dist[N][SQRT + 5];
pii a[N];
vector<int> adj[N];
priority_queue<node, vector<node>, greater<node>> Q;
bool vis[N];
int ans = oo;

void update(int u, int v, int w, int cur, int siu) {
    if(dist[v][siu] > dist[u][cur] + w) {
        dist[v][siu] = dist[u][cur] + w;
        Q.emplace(dist[v][siu], v, siu);
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;

    for(int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].eb(v);
        a[i] = {u, v};
    }

    memset(dist, 0x3f, sizeof dist);

    dist[a[0].first][0] = 0;
    Q.emplace(0, a[0].first, 0);

    while(!Q.empty()) {
        node top = Q.top();
        Q.pop();

        int u = top.u;

        if(u == a[1].first)
            return cout << dist[a[1].first][top.s], 0;

        int cur = top.s;

        if(dist[u][cur] != top.w)
            continue;

        if(cur) {
            if(u + cur <= n)
                update(u, u + cur, 1, cur, cur);

            if(u - cur >= 0)
                update(u, u - cur, 1, cur, cur);
        }

        for(int v : adj[u]) {
            if(v >= SQRT) {
                for(int j = 1; u + j * v < n; j++)
                    update(u, u + j * v, j, cur, 0);

                for(int j = 1; u - j * v >= 0; j++)
                    update(u, u - j * v, j, cur, 0);

            } else {
                if(u + v <= n)
                    update(u, u + v, 1, cur, v);

                if(u - v >= 0)
                    update(u, u - v, 1, cur, v);
            }
        }
    }

    cout << -1;
}
/*
5 3
0 2
1 1
4 1
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22384 KB Output is correct
2 Correct 4 ms 22360 KB Output is correct
3 Correct 3 ms 22360 KB Output is correct
4 Correct 4 ms 22360 KB Output is correct
5 Correct 3 ms 22360 KB Output is correct
6 Correct 3 ms 22360 KB Output is correct
7 Correct 3 ms 22360 KB Output is correct
8 Correct 4 ms 22360 KB Output is correct
9 Correct 3 ms 22360 KB Output is correct
10 Correct 3 ms 22360 KB Output is correct
11 Correct 3 ms 22360 KB Output is correct
12 Correct 4 ms 22360 KB Output is correct
13 Correct 3 ms 22364 KB Output is correct
14 Correct 5 ms 22616 KB Output is correct
15 Correct 4 ms 22408 KB Output is correct
16 Correct 3 ms 22360 KB Output is correct
17 Correct 4 ms 22360 KB Output is correct
18 Correct 4 ms 22360 KB Output is correct
19 Correct 4 ms 22360 KB Output is correct
20 Correct 4 ms 22360 KB Output is correct
21 Correct 4 ms 22360 KB Output is correct
22 Correct 3 ms 22360 KB Output is correct
23 Correct 4 ms 22364 KB Output is correct
24 Correct 4 ms 22364 KB Output is correct
25 Correct 4 ms 22360 KB Output is correct
26 Correct 4 ms 22360 KB Output is correct
27 Correct 4 ms 22364 KB Output is correct
28 Correct 5 ms 22616 KB Output is correct
29 Correct 7 ms 22360 KB Output is correct
30 Correct 4 ms 22364 KB Output is correct
31 Correct 6 ms 22360 KB Output is correct
32 Correct 5 ms 22360 KB Output is correct
33 Correct 11 ms 22616 KB Output is correct
34 Correct 9 ms 22616 KB Output is correct
35 Correct 8 ms 22872 KB Output is correct
36 Correct 4 ms 22360 KB Output is correct
37 Correct 7 ms 22872 KB Output is correct
38 Correct 10 ms 22616 KB Output is correct
39 Correct 7 ms 22616 KB Output is correct
40 Correct 8 ms 22620 KB Output is correct
41 Correct 8 ms 22872 KB Output is correct
42 Correct 7 ms 22616 KB Output is correct
43 Correct 6 ms 22616 KB Output is correct
44 Correct 7 ms 22620 KB Output is correct
45 Correct 144 ms 23124 KB Output is correct
46 Correct 123 ms 23124 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22360 KB Output is correct
2 Correct 4 ms 22360 KB Output is correct
3 Correct 4 ms 22364 KB Output is correct
4 Correct 4 ms 22364 KB Output is correct
5 Correct 4 ms 22360 KB Output is correct
6 Correct 4 ms 22360 KB Output is correct
7 Correct 3 ms 22364 KB Output is correct
8 Correct 4 ms 22360 KB Output is correct
9 Correct 4 ms 22360 KB Output is correct
10 Correct 4 ms 22364 KB Output is correct
11 Correct 3 ms 22360 KB Output is correct
12 Correct 4 ms 22360 KB Output is correct
13 Correct 4 ms 22360 KB Output is correct
14 Correct 5 ms 22616 KB Output is correct
15 Correct 4 ms 22360 KB Output is correct
16 Correct 3 ms 22364 KB Output is correct
17 Correct 4 ms 22360 KB Output is correct
18 Correct 4 ms 22360 KB Output is correct
19 Correct 4 ms 22360 KB Output is correct
20 Correct 4 ms 22360 KB Output is correct
21 Correct 4 ms 22360 KB Output is correct
22 Correct 3 ms 22360 KB Output is correct
23 Correct 4 ms 22360 KB Output is correct
24 Correct 4 ms 22364 KB Output is correct
25 Correct 4 ms 22360 KB Output is correct
26 Correct 4 ms 22360 KB Output is correct
27 Correct 4 ms 22360 KB Output is correct
28 Correct 5 ms 22360 KB Output is correct
29 Correct 7 ms 22360 KB Output is correct
30 Correct 4 ms 22360 KB Output is correct
31 Correct 5 ms 22360 KB Output is correct
32 Correct 5 ms 22364 KB Output is correct
33 Correct 12 ms 22616 KB Output is correct
34 Correct 8 ms 22616 KB Output is correct
35 Correct 8 ms 22872 KB Output is correct
36 Correct 4 ms 22360 KB Output is correct
37 Correct 7 ms 22876 KB Output is correct
38 Correct 8 ms 22680 KB Output is correct
39 Correct 7 ms 22616 KB Output is correct
40 Correct 8 ms 22616 KB Output is correct
41 Correct 8 ms 22872 KB Output is correct
42 Correct 6 ms 22616 KB Output is correct
43 Correct 7 ms 22872 KB Output is correct
44 Correct 7 ms 22616 KB Output is correct
45 Correct 159 ms 23148 KB Output is correct
46 Correct 124 ms 23124 KB Output is correct
47 Correct 10 ms 23320 KB Output is correct
48 Correct 7 ms 22876 KB Output is correct
49 Correct 7 ms 22872 KB Output is correct
50 Correct 6 ms 22872 KB Output is correct
51 Correct 14 ms 23576 KB Output is correct
52 Correct 14 ms 23576 KB Output is correct
53 Correct 9 ms 23128 KB Output is correct
54 Correct 4 ms 22360 KB Output is correct
55 Correct 4 ms 22360 KB Output is correct
56 Correct 9 ms 23384 KB Output is correct
57 Correct 4 ms 22616 KB Output is correct
58 Correct 10 ms 22616 KB Output is correct
59 Correct 7 ms 22616 KB Output is correct
60 Correct 7 ms 22616 KB Output is correct
61 Correct 8 ms 22616 KB Output is correct
62 Correct 29 ms 23480 KB Output is correct
63 Correct 31 ms 24276 KB Output is correct
64 Correct 33 ms 24276 KB Output is correct
65 Correct 574 ms 24440 KB Output is correct
66 Execution timed out 1055 ms 25932 KB Time limit exceeded
67 Halted 0 ms 0 KB -