oj.uz

Submission #1090613

# Submission time Handle Problem Language Result Execution time Memory
1090613 2024-09-18T14:07:11 Z codexistent Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 293 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define MAXN 30005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)

ll n, m, d[MAXN], b0 = 0, b1 = 0;
vector<ll> p[MAXN];
vector<pair<ll, ll>> adj[MAXN];

int main(){
    cin >> n >> m;
    FOR(i, 0, m - 1){
        ll bi, pi; cin >> bi >> pi;
        
        if(i == 0) b0 = bi;
        if(i == 1) b1 = bi;

        p[bi].push_back(pi);
    }

    FOR(i, 0, n - 1){
        for(ll pi : p[i]){
            ll j = i;
            while(0 <= j - pi){
                j -= pi;
                adj[i].push_back({j, (i - j) / pi});
            }

            j = i;
            while(j + pi <= n - 1){
                j += pi;
                adj[i].push_back({j, (j - i) / pi});
            }
        }
        d[i] = -1;
    }

    /*cout << "b0, b1 are " << b0 << " and " << b1 << endl;
    FOR(i, 0, n - 1){
        cout << "edges from " << i << ": " << endl;
        for(auto j : adj[i]){
            cout << " goes to " << j.first << " in " << j.second  << " jumps" << endl;
        }
    }*/

    priority_queue<pair<ll, ll>> pq;
    d[b0] = 0, pq.push({0, b0});
    while(!pq.empty()){
        auto pqi = pq.top(); pqi.first *= -1;
        pq.pop();

        if(d[pqi.second] < pqi.first) continue;
        if(pqi.second == b1) break;

        for(auto i : adj[pqi.second]){
            if(d[i.first] == -1 || pqi.first + i.second < d[i.first]){
                d[i.first] = pqi.first + i.second;
                pq.push({-d[i.first], i.first});
            }
        }

        // cout << "HERE " << pqi.second << " w/ d = " << pqi.first << endl;
    }

    cout << d[b1] << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 2 ms 1624 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 4 ms 4048 KB Output is correct
13 Correct 4 ms 4052 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 2 ms 1884 KB Output is correct
17 Correct 2 ms 2136 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 53 ms 33872 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 2 ms 1880 KB Output is correct
26 Correct 46 ms 34872 KB Output is correct
27 Correct 43 ms 34772 KB Output is correct
28 Correct 2 ms 2136 KB Output is correct
29 Correct 3 ms 2396 KB Output is correct
30 Correct 2 ms 2140 KB Output is correct
31 Correct 2 ms 2140 KB Output is correct
32 Correct 1 ms 2140 KB Output is correct
33 Correct 4 ms 2908 KB Output is correct
34 Correct 3 ms 3132 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1840 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 4 ms 4048 KB Output is correct
13 Correct 4 ms 4052 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 2 ms 1884 KB Output is correct
17 Correct 2 ms 2140 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 48 ms 33868 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 45 ms 34788 KB Output is correct
27 Correct 47 ms 34824 KB Output is correct
28 Correct 2 ms 2140 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 1 ms 2140 KB Output is correct
31 Correct 2 ms 2140 KB Output is correct
32 Correct 2 ms 2140 KB Output is correct
33 Correct 3 ms 2908 KB Output is correct
34 Correct 3 ms 3164 KB Output is correct
35 Correct 17 ms 3676 KB Output is correct
36 Correct 3 ms 2140 KB Output is correct
37 Correct 15 ms 5184 KB Output is correct
38 Correct 14 ms 4616 KB Output is correct
39 Correct 13 ms 4704 KB Output is correct
40 Correct 13 ms 4700 KB Output is correct
41 Correct 12 ms 4572 KB Output is correct
42 Runtime error 293 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1848 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 1 ms 1848 KB Output is correct
12 Correct 4 ms 4048 KB Output is correct
13 Correct 4 ms 4304 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 1888 KB Output is correct
17 Correct 2 ms 2140 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 54 ms 33876 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 1880 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 3 ms 1884 KB Output is correct
26 Correct 46 ms 34844 KB Output is correct
27 Correct 46 ms 34740 KB Output is correct
28 Correct 2 ms 2136 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2140 KB Output is correct
31 Correct 3 ms 2108 KB Output is correct
32 Correct 2 ms 2140 KB Output is correct
33 Correct 4 ms 2896 KB Output is correct
34 Correct 3 ms 3164 KB Output is correct
35 Correct 11 ms 3676 KB Output is correct
36 Correct 3 ms 2140 KB Output is correct
37 Correct 11 ms 5076 KB Output is correct
38 Correct 13 ms 4700 KB Output is correct
39 Correct 13 ms 4700 KB Output is correct
40 Correct 12 ms 4700 KB Output is correct
41 Correct 12 ms 4700 KB Output is correct
42 Runtime error 291 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -