Submission #735556

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
735556	2023-05-04T10:31:50 Z	vjudge1	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	121 ms	262144 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;

int main() {
        int n, m;
        cin >> n >> m;
        vector<int> a(m), b(m);
        for (int i = 0; i < m; i++) cin >> a[i] >> b[i];
        int sn = sqrt(n * __lg(n)) + 1;
        vector<vector<int64_t>> d(n, vector<int64_t>(sn + 1, 9e18));
        vector<vector<vector<tuple<int, int, int>>>> adj(n, vector<vector<tuple<int, int, int>>>(sn + 1));

        for (int i = 0; i < m; i++) {
                if (b[i] < sn) {
                        adj[a[i]][sn].emplace_back(a[i], b[i], 0);
                } else {
                        for (int j = a[i] % b[i]; j < n; j += b[i]) {
                                adj[a[i]][sn].emplace_back(j, sn, abs(a[i] - j) / b[i]);
                        }
                }
        }

        d[a[0]][sn] = 0;
        priority_queue<tuple<int64_t, int, int>> pq;
        pq.emplace(0, a[0], sn);
        while (pq.size()) {
                auto [du, u, s] = pq.top();
                pq.pop();
                if (d[u][s] != -du) continue;
                du = -du;
                if (u == a[1]) return cout << du, 0;

                if (s != sn && u - s >= 0) {
                        int uu = u - s, ss = s, c = 1;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                        ss = sn;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                }

                if (s != sn && u + s < n) {
                        int uu = u + s, ss = s, c = 1;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                        ss = sn;
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                }

                for (auto [uu, ss, c] : adj[u][s]) {
                        if (d[uu][ss] > du + c) {
                                d[uu][ss] = du + c;
                                pq.emplace(-d[uu][ss], uu, ss);
                        }
                }
        }
        cout << -1;
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	224 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	2 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	596 KB	Output is correct
17	Correct	3 ms	2388 KB	Output is correct
18	Correct	5 ms	7764 KB	Output is correct
19	Correct	6 ms	9412 KB	Output is correct
20	Correct	7 ms	9428 KB	Output is correct
21	Correct	2 ms	980 KB	Output is correct
22	Correct	5 ms	7892 KB	Output is correct
23	Correct	5 ms	6868 KB	Output is correct
24	Correct	7 ms	8788 KB	Output is correct
25	Correct	7 ms	9428 KB	Output is correct
26	Correct	7 ms	9428 KB	Output is correct
27	Correct	10 ms	9428 KB	Output is correct
28	Correct	8 ms	9508 KB	Output is correct
29	Correct	12 ms	9428 KB	Output is correct
30	Correct	7 ms	9300 KB	Output is correct
31	Correct	13 ms	9432 KB	Output is correct
32	Correct	9 ms	9364 KB	Output is correct
33	Correct	21 ms	9428 KB	Output is correct
34	Correct	14 ms	9428 KB	Output is correct

Subtask #4
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	596 KB	Output is correct
17	Correct	3 ms	2388 KB	Output is correct
18	Correct	6 ms	7780 KB	Output is correct
19	Correct	7 ms	9300 KB	Output is correct
20	Correct	7 ms	9428 KB	Output is correct
21	Correct	1 ms	980 KB	Output is correct
22	Correct	5 ms	7892 KB	Output is correct
23	Correct	5 ms	6868 KB	Output is correct
24	Correct	7 ms	8788 KB	Output is correct
25	Correct	7 ms	9428 KB	Output is correct
26	Correct	7 ms	9376 KB	Output is correct
27	Correct	7 ms	9448 KB	Output is correct
28	Correct	8 ms	9428 KB	Output is correct
29	Correct	12 ms	9428 KB	Output is correct
30	Correct	7 ms	9300 KB	Output is correct
31	Correct	10 ms	9340 KB	Output is correct
32	Correct	8 ms	9300 KB	Output is correct
33	Correct	21 ms	9428 KB	Output is correct
34	Correct	14 ms	9536 KB	Output is correct
35	Correct	17 ms	7160 KB	Output is correct
36	Correct	5 ms	4180 KB	Output is correct
37	Correct	16 ms	10708 KB	Output is correct
38	Correct	25 ms	11348 KB	Output is correct
39	Correct	21 ms	11084 KB	Output is correct
40	Correct	21 ms	11280 KB	Output is correct
41	Correct	24 ms	11412 KB	Output is correct
42	Correct	17 ms	10116 KB	Output is correct
43	Correct	17 ms	10132 KB	Output is correct
44	Correct	18 ms	10116 KB	Output is correct
45	Correct	56 ms	14100 KB	Output is correct
46	Correct	32 ms	14212 KB	Output is correct

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	3 ms	2388 KB	Output is correct
18	Correct	5 ms	7764 KB	Output is correct
19	Correct	7 ms	9428 KB	Output is correct
20	Correct	7 ms	9428 KB	Output is correct
21	Correct	2 ms	980 KB	Output is correct
22	Correct	6 ms	7892 KB	Output is correct
23	Correct	5 ms	6868 KB	Output is correct
24	Correct	7 ms	8760 KB	Output is correct
25	Correct	7 ms	9428 KB	Output is correct
26	Correct	9 ms	9428 KB	Output is correct
27	Correct	7 ms	9428 KB	Output is correct
28	Correct	8 ms	9428 KB	Output is correct
29	Correct	14 ms	9428 KB	Output is correct
30	Correct	7 ms	9300 KB	Output is correct
31	Correct	9 ms	9300 KB	Output is correct
32	Correct	9 ms	9300 KB	Output is correct
33	Correct	19 ms	9536 KB	Output is correct
34	Correct	14 ms	9536 KB	Output is correct
35	Correct	17 ms	7124 KB	Output is correct
36	Correct	5 ms	4180 KB	Output is correct
37	Correct	17 ms	10684 KB	Output is correct
38	Correct	22 ms	11348 KB	Output is correct
39	Correct	21 ms	11156 KB	Output is correct
40	Correct	21 ms	11284 KB	Output is correct
41	Correct	23 ms	11412 KB	Output is correct
42	Correct	19 ms	10072 KB	Output is correct
43	Correct	18 ms	10056 KB	Output is correct
44	Correct	18 ms	10100 KB	Output is correct
45	Correct	55 ms	14028 KB	Output is correct
46	Correct	32 ms	14216 KB	Output is correct
47	Correct	105 ms	161440 KB	Output is correct
48	Runtime error	121 ms	262144 KB	Execution killed with signal 9
49	Halted	0 ms	0 KB	-

Submission #735556

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0