oj.uz

Submission #577330

# Submission time Handle Problem Language Result Execution time Memory
577330 2022-06-14T14:30:26 Z MohamedFaresNebili Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 464 ms 112904 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;
        using pi = array<int, 3>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define all(x) (x).begin(), (x).end()
        #define lb lower_bound
        #define ub upper_bound

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        int N, M;
        int B[30001], P[30001];
        vector<int> S[30001];
        bitset<30001> vis[30001];

        int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> N >> M;
            for(int l = 0; l < M; l++) {
                cin >> B[l] >> P[l];
                S[B[l]].pb(P[l]);
            }
            vector<int> d(N, 1e9 + 7);
            queue<pi> q; q.push({B[0], 0, 0});
            while(!q.empty()) {
                int A = q.front()[0], W = q.front()[1];
                int J = q.front()[2]; q.pop();
                if(A == B[1]) {
                    cout << W << "\n";
                    return 0;
                }
                if(A + J < N && !vis[A][A + J]) {
                    q.push({A + J, W + 1, J});
                    vis[A][A + J] = 1;
                }
                if(A - J >= 0 && !vis[A][A - J]) {
                    q.push({A - J, W + 1, J});
                    vis[A][A - J] = 1;
                }
                for(auto U : S[A]) {
                    if(A + U < N && !vis[A][A + U]) {
                        q.push({A + U, W + 1, U});
                        vis[A][A + U] = 1;
                    }
                    if(A - U >= 0 && !vis[A][A - U]) {
                        q.push({A - U, W + 1, U});
                        vis[A][A - U] = 1;
                    }
                }
            }

            cout << -1 << "\n";
            return 0;
        }

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1040 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 1036 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 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 1044 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1044 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 1044 KB Output is correct
5 Correct 1 ms 1036 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1172 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 2 ms 1432 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 6 ms 8480 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 4 ms 6412 KB Output is correct
24 Correct 5 ms 7508 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 5 ms 7252 KB Output is correct
27 Correct 5 ms 7708 KB Output is correct
28 Correct 6 ms 8404 KB Output is correct
29 Correct 7 ms 8404 KB Output is correct
30 Correct 5 ms 8276 KB Output is correct
31 Correct 6 ms 8404 KB Output is correct
32 Correct 6 ms 8404 KB Output is correct
33 Correct 10 ms 8476 KB Output is correct
34 Correct 9 ms 8356 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1040 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 1040 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 1364 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1044 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 1 ms 1044 KB Output is correct
22 Correct 1 ms 1036 KB Output is correct
23 Correct 4 ms 6384 KB Output is correct
24 Correct 5 ms 7508 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 5 ms 7252 KB Output is correct
27 Correct 5 ms 7708 KB Output is correct
28 Correct 6 ms 8404 KB Output is correct
29 Correct 6 ms 8340 KB Output is correct
30 Correct 5 ms 8276 KB Output is correct
31 Correct 6 ms 8404 KB Output is correct
32 Correct 6 ms 8404 KB Output is correct
33 Correct 8 ms 8404 KB Output is correct
34 Correct 7 ms 8364 KB Output is correct
35 Correct 10 ms 7124 KB Output is correct
36 Correct 2 ms 2388 KB Output is correct
37 Correct 7 ms 5960 KB Output is correct
38 Correct 10 ms 8104 KB Output is correct
39 Correct 6 ms 1748 KB Output is correct
40 Correct 6 ms 1912 KB Output is correct
41 Correct 7 ms 3156 KB Output is correct
42 Correct 7 ms 7892 KB Output is correct
43 Correct 8 ms 8280 KB Output is correct
44 Correct 9 ms 9044 KB Output is correct
45 Correct 38 ms 9720 KB Output is correct
46 Correct 30 ms 9676 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1040 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 1 ms 1120 KB Output is correct
11 Correct 1 ms 1044 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 2 ms 1428 KB Output is correct
14 Correct 2 ms 1432 KB Output is correct
15 Correct 1 ms 1428 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1044 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 1 ms 1052 KB Output is correct
22 Correct 1 ms 1040 KB Output is correct
23 Correct 4 ms 6292 KB Output is correct
24 Correct 5 ms 7496 KB Output is correct
25 Correct 2 ms 2420 KB Output is correct
26 Correct 4 ms 7320 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 6 ms 8532 KB Output is correct
29 Correct 7 ms 8404 KB Output is correct
30 Correct 5 ms 8276 KB Output is correct
31 Correct 7 ms 8404 KB Output is correct
32 Correct 5 ms 8336 KB Output is correct
33 Correct 9 ms 8468 KB Output is correct
34 Correct 7 ms 8344 KB Output is correct
35 Correct 10 ms 7200 KB Output is correct
36 Correct 2 ms 2388 KB Output is correct
37 Correct 7 ms 5964 KB Output is correct
38 Correct 10 ms 8020 KB Output is correct
39 Correct 6 ms 1748 KB Output is correct
40 Correct 6 ms 1948 KB Output is correct
41 Correct 7 ms 3156 KB Output is correct
42 Correct 8 ms 7892 KB Output is correct
43 Correct 8 ms 8276 KB Output is correct
44 Correct 8 ms 8984 KB Output is correct
45 Correct 39 ms 9796 KB Output is correct
46 Correct 32 ms 9664 KB Output is correct
47 Correct 10 ms 10708 KB Output is correct
48 Correct 6 ms 2004 KB Output is correct
49 Correct 6 ms 1984 KB Output is correct
50 Correct 4 ms 1748 KB Output is correct
51 Correct 59 ms 83392 KB Output is correct
52 Correct 60 ms 89528 KB Output is correct
53 Correct 16 ms 17944 KB Output is correct
54 Correct 33 ms 61296 KB Output is correct
55 Correct 43 ms 77840 KB Output is correct
56 Correct 73 ms 112584 KB Output is correct
57 Correct 2 ms 2772 KB Output is correct
58 Correct 69 ms 111664 KB Output is correct
59 Correct 65 ms 104024 KB Output is correct
60 Correct 64 ms 103976 KB Output is correct
61 Correct 66 ms 99132 KB Output is correct
62 Correct 120 ms 112676 KB Output is correct
63 Correct 248 ms 112328 KB Output is correct
64 Correct 286 ms 112332 KB Output is correct
65 Correct 327 ms 112628 KB Output is correct
66 Correct 464 ms 112904 KB Output is correct
67 Correct 272 ms 112428 KB Output is correct