oj.uz

Submission #962499

# Submission time Handle Problem Language Result Execution time Memory
962499 2024-04-13T17:21:00 Z BhavayGoyal Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 237948 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 3e4+4;
int n, m, power[N], position[N];
vi building[N];

void sol() {
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, p; cin >> x >> p; x++;
        position[i] = x;
        power[i] = p;
        building[x].pb(i);
    }

    // priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> q;
    deque<array<int, 3>> q;
    q.push_back({0, 1, position[1]}); //  curr dist, curr dogde, curr building
    vii dis(m+1, vi(n+1, inf));
    dis[1][position[1]] = 0;
    while (!q.empty()) {
        array<int, 3> f = q.front(); q.pop_front();
        int currDoge = f[1], currBuild = f[2], dist = f[0];
        if (dist != dis[currDoge][currBuild]) continue;

        if (currDoge == 2) {
            cout << dist << endl; 
            return;
        }

        // go to a differeent doge
        for (auto chDoge : building[currBuild]) {
            if (dis[chDoge][currBuild] > dis[currDoge][currBuild]) {
                dis[chDoge][currBuild] = dis[currDoge][currBuild];
                q.push_front({dis[chDoge][currBuild], chDoge, currBuild});
            }
        }

        // go to next building
        if (power[currDoge] + currBuild <= n) {
            int chBuild = power[currDoge] + currBuild;
            if (dis[currDoge][chBuild] > dis[currDoge][currBuild] + 1) {
                dis[currDoge][chBuild] = dis[currDoge][currBuild] + 1;
                q.push_back({dis[currDoge][chBuild], currDoge, chBuild});
            }
        }

        // go to previous building
        if (currBuild - power[currDoge] >= 1) {
            int chBuild = currBuild - power[currDoge];
            if (dis[currDoge][chBuild] > dis[currDoge][currBuild] + 1) {
                dis[currDoge][chBuild] = dis[currDoge][currBuild] + 1;
                q.push_back({dis[currDoge][chBuild], currDoge, chBuild});
            }
        }
    }

    cout << -1 << endl;
}

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

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 7 ms 1884 KB Output is correct
13 Correct 7 ms 1884 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 3 ms 6236 KB Output is correct
18 Correct 3 ms 8028 KB Output is correct
19 Correct 2 ms 5468 KB Output is correct
20 Correct 76 ms 17012 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 2 ms 6236 KB Output is correct
23 Correct 3 ms 7260 KB Output is correct
24 Correct 6 ms 15196 KB Output is correct
25 Correct 7 ms 16880 KB Output is correct
26 Correct 7 ms 16732 KB Output is correct
27 Correct 15 ms 16984 KB Output is correct
28 Correct 7 ms 16988 KB Output is correct
29 Correct 5 ms 7004 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 3 ms 5724 KB Output is correct
32 Correct 2 ms 4956 KB Output is correct
33 Correct 12 ms 16920 KB Output is correct
34 Correct 10 ms 16984 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 8 ms 2120 KB Output is correct
13 Correct 7 ms 2104 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 3 ms 6232 KB Output is correct
18 Correct 3 ms 8020 KB Output is correct
19 Correct 2 ms 5464 KB Output is correct
20 Correct 76 ms 17000 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 3 ms 6236 KB Output is correct
23 Correct 3 ms 7260 KB Output is correct
24 Correct 7 ms 15196 KB Output is correct
25 Correct 7 ms 16900 KB Output is correct
26 Correct 7 ms 16796 KB Output is correct
27 Correct 15 ms 16988 KB Output is correct
28 Correct 8 ms 16988 KB Output is correct
29 Correct 4 ms 7004 KB Output is correct
30 Correct 2 ms 2392 KB Output is correct
31 Correct 3 ms 5724 KB Output is correct
32 Correct 2 ms 4956 KB Output is correct
33 Correct 11 ms 16728 KB Output is correct
34 Correct 10 ms 16732 KB Output is correct
35 Correct 61 ms 147356 KB Output is correct
36 Correct 10 ms 21596 KB Output is correct
37 Correct 67 ms 149540 KB Output is correct
38 Correct 91 ms 237520 KB Output is correct
39 Correct 86 ms 237400 KB Output is correct
40 Correct 93 ms 237608 KB Output is correct
41 Correct 90 ms 237652 KB Output is correct
42 Correct 86 ms 237396 KB Output is correct
43 Execution timed out 1031 ms 237948 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 7 ms 1884 KB Output is correct
13 Correct 7 ms 2104 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 3 ms 6236 KB Output is correct
18 Correct 3 ms 8028 KB Output is correct
19 Correct 2 ms 5468 KB Output is correct
20 Correct 76 ms 17020 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 4 ms 6232 KB Output is correct
23 Correct 3 ms 7256 KB Output is correct
24 Correct 6 ms 15196 KB Output is correct
25 Correct 8 ms 16732 KB Output is correct
26 Correct 6 ms 16732 KB Output is correct
27 Correct 16 ms 16988 KB Output is correct
28 Correct 8 ms 16988 KB Output is correct
29 Correct 4 ms 7004 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 3 ms 5724 KB Output is correct
32 Correct 3 ms 4956 KB Output is correct
33 Correct 12 ms 16732 KB Output is correct
34 Correct 10 ms 16728 KB Output is correct
35 Correct 61 ms 147176 KB Output is correct
36 Correct 9 ms 21596 KB Output is correct
37 Correct 65 ms 149464 KB Output is correct
38 Correct 92 ms 237140 KB Output is correct
39 Correct 90 ms 237652 KB Output is correct
40 Correct 89 ms 237556 KB Output is correct
41 Correct 96 ms 237576 KB Output is correct
42 Correct 86 ms 237332 KB Output is correct
43 Execution timed out 1057 ms 237936 KB Time limit exceeded
44 Halted 0 ms 0 KB -