oj.uz

Submission #311131

# Submission time Handle Problem Language Result Execution time Memory
311131 2020-10-09T12:39:59 Z lohacho Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 122 ms 6000 KB 
#include <bits/stdc++.h>

using namespace std;

using LL = long long;
const int MOD = (int)1e9 + 7;
const int NS = (int)3e4 + 4;
int N, M;
int B[NS], P[NS];
int far[NS], chk[NS];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
vector<int> put[NS];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> N >> M;
    for(int i = 0; i < M; ++i){
        cin >> B[i] >> P[i];
        put[B[i]].push_back(P[i]);
    }
    for(int i = 0; i < N; ++i){
        sort(put[i].begin(), put[i].end());
        put[i].erase(unique(put[i].begin(), put[i].end()), put[i].end());
        far[i] = MOD;
    }
    far[B[0]] = 0;
    pq.push({0, B[0]});
    while(!pq.empty()){
        while(!pq.empty() && chk[pq.top().second]){
            pq.pop();
        }
        if(pq.empty()){
            break;
        }
        int now = pq.top().second; pq.pop();
        chk[now] = 1;
        for(auto&jump:put[now]){
            for(int mov = 1; now + mov * jump < N; ++mov){
                int nxt = now + mov * jump;
                if(far[now] + mov < far[nxt]){
                    far[nxt] = far[now] + mov;
                    pq.push({far[nxt], nxt});
                }
                int pos = lower_bound(put[nxt].begin(), put[nxt].end(), jump) - put[nxt].begin();
                if(pos < (int)put[nxt].size() && put[nxt][pos] == jump){
                    break;
                }
            }
        }
        for(auto&jump:put[now]){
            for(int mov = 1; now - mov * jump >= 0; ++mov){
                int nxt = now - mov * jump;
                if(far[now] + mov < far[nxt]){
                    far[nxt] = far[now] + mov;
                    pq.push({far[nxt], nxt});
                }
                int pos = lower_bound(put[nxt].begin(), put[nxt].end(), jump) - put[nxt].begin();
                if(pos < (int)put[nxt].size() && put[nxt][pos] == jump){
                    break;
                }
            }
        }
    }
    if(far[B[1]] == MOD){
        cout << -1;
    }
    else{
        cout << far[B[1]];
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1056 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 1024 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 1 ms 1152 KB Output is correct
19 Correct 1 ms 1152 KB Output is correct
20 Correct 1 ms 1152 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 1024 KB Output is correct
23 Correct 2 ms 1152 KB Output is correct
24 Correct 2 ms 1152 KB Output is correct
25 Correct 2 ms 1152 KB Output is correct
26 Correct 1 ms 1152 KB Output is correct
27 Correct 2 ms 1152 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 3 ms 1280 KB Output is correct
30 Correct 2 ms 1152 KB Output is correct
31 Correct 3 ms 1152 KB Output is correct
32 Correct 2 ms 1152 KB Output is correct
33 Correct 5 ms 1536 KB Output is correct
34 Correct 5 ms 1536 KB Output is correct
35 Correct 11 ms 1536 KB Output is correct
36 Correct 3 ms 1152 KB Output is correct
37 Correct 11 ms 1536 KB Output is correct
38 Correct 13 ms 1664 KB Output is correct
39 Correct 13 ms 1664 KB Output is correct
40 Correct 13 ms 1664 KB Output is correct
41 Correct 13 ms 1664 KB Output is correct
42 Correct 6 ms 1536 KB Output is correct
43 Correct 6 ms 1536 KB Output is correct
44 Correct 6 ms 1536 KB Output is correct
45 Correct 12 ms 1920 KB Output is correct
46 Correct 12 ms 1920 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct
16 Correct 2 ms 1024 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 1 ms 1152 KB Output is correct
19 Correct 1 ms 1152 KB Output is correct
20 Correct 1 ms 1152 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 1152 KB Output is correct
23 Correct 2 ms 1152 KB Output is correct
24 Correct 2 ms 1152 KB Output is correct
25 Correct 2 ms 1152 KB Output is correct
26 Correct 1 ms 1152 KB Output is correct
27 Correct 2 ms 1152 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 3 ms 1280 KB Output is correct
30 Correct 2 ms 1152 KB Output is correct
31 Correct 3 ms 1152 KB Output is correct
32 Correct 2 ms 1152 KB Output is correct
33 Correct 5 ms 1536 KB Output is correct
34 Correct 5 ms 1536 KB Output is correct
35 Correct 10 ms 1536 KB Output is correct
36 Correct 3 ms 1152 KB Output is correct
37 Correct 11 ms 1536 KB Output is correct
38 Correct 13 ms 1664 KB Output is correct
39 Correct 13 ms 1664 KB Output is correct
40 Correct 13 ms 1664 KB Output is correct
41 Correct 12 ms 1664 KB Output is correct
42 Correct 6 ms 1536 KB Output is correct
43 Correct 6 ms 1536 KB Output is correct
44 Correct 6 ms 1536 KB Output is correct
45 Correct 12 ms 1920 KB Output is correct
46 Correct 12 ms 1920 KB Output is correct
47 Correct 29 ms 2300 KB Output is correct
48 Correct 8 ms 1792 KB Output is correct
49 Correct 7 ms 1792 KB Output is correct
50 Correct 6 ms 1664 KB Output is correct
51 Correct 32 ms 2812 KB Output is correct
52 Correct 33 ms 2756 KB Output is correct
53 Correct 17 ms 2684 KB Output is correct
54 Correct 3 ms 1536 KB Output is correct
55 Correct 3 ms 1536 KB Output is correct
56 Correct 10 ms 2432 KB Output is correct
57 Correct 28 ms 1912 KB Output is correct
58 Correct 8 ms 1920 KB Output is correct
59 Correct 9 ms 1920 KB Output is correct
60 Correct 10 ms 1920 KB Output is correct
61 Correct 11 ms 1920 KB Output is correct
62 Correct 16 ms 2432 KB Output is correct
63 Correct 45 ms 3828 KB Output is correct
64 Correct 47 ms 4084 KB Output is correct
65 Correct 61 ms 4084 KB Output is correct
66 Correct 122 ms 6000 KB Output is correct
67 Correct 122 ms 6000 KB Output is correct