oj.uz

Submission #953612

# Submission time Handle Problem Language Result Execution time Memory
953612 2024-03-26T10:31:15 Z Unforgettablepl Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 54932 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

priority_queue<pair<int,pair<int,int>>> q;
vector<int> buildings[30001];
int power[30001];
map<pair<int,int>,bool> visited;
const int INF = 1e15;
int n;
const int threshold = 173;

inline void adddoge(int x,int building,int dist){
    if(power[x]>threshold){
        int minimum = building - power[x] * (building / power[x]);
        for (int i = minimum; i < n; i += power[x])
            if (!visited[{i, 0}]) {
                q.emplace(dist - (abs(building - i) / power[x]), make_pair(i,0));
            }
    } else {
        if(!visited[{building,power[x]}])q.emplace(dist,make_pair(building,power[x]));
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int m;
    cin >> n >> m;
    int base,tar;
    cin>>base>>power[0]>>tar>>power[1];
    buildings[base].emplace_back(0);
    buildings[tar].emplace_back(1);
    for(int i=2;i<m;i++){
        int b;cin>>b>>power[i];
        buildings[b].emplace_back(i);
    }
    q.emplace(0, make_pair(base,0));
    while(!q.empty()){
        auto curr = q.top();q.pop();
        if(visited[curr.second])continue;
        visited[curr.second]=true;
        if(curr.second.first==tar){
            cout << -curr.first << '\n';
            return 0;
        }
        if(curr.second.second==0)for(int&i:buildings[curr.second.first])adddoge(i,curr.second.first,curr.first);
        else {
            if(!visited[{curr.second.first,0}])q.emplace(curr.first, make_pair(curr.second.first,0));
            if(curr.second.first+curr.second.second<n and !visited[{curr.second.first+curr.second.second,curr.second.second}])q.emplace(curr.first-1,make_pair(curr.second.first+curr.second.second,curr.second.second));
            if(curr.second.first-curr.second.second>=0 and !visited[{curr.second.first-curr.second.second,curr.second.second}])q.emplace(curr.first-1,make_pair(curr.second.first-curr.second.second,curr.second.second));
        }
    }
    cout << "-1\n";
}

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 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1172 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 1172 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct
15 Correct 2 ms 1372 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 1112 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 1116 KB Output is correct
12 Correct 1 ms 1180 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 2 ms 1372 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 1176 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 3 ms 1368 KB Output is correct
24 Correct 3 ms 1372 KB Output is correct
25 Correct 1 ms 1244 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1372 KB Output is correct
28 Correct 10 ms 2196 KB Output is correct
29 Correct 39 ms 5116 KB Output is correct
30 Correct 11 ms 2140 KB Output is correct
31 Correct 23 ms 3416 KB Output is correct
32 Correct 15 ms 2648 KB Output is correct
33 Correct 84 ms 8860 KB Output is correct
34 Correct 38 ms 5200 KB Output is correct

Subtask #4
21.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 1176 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 1180 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 1124 KB Output is correct
22 Correct 1 ms 1120 KB Output is correct
23 Correct 3 ms 1372 KB Output is correct
24 Correct 4 ms 1380 KB Output is correct
25 Correct 1 ms 1124 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 10 ms 2140 KB Output is correct
29 Correct 39 ms 5080 KB Output is correct
30 Correct 10 ms 2144 KB Output is correct
31 Correct 21 ms 3164 KB Output is correct
32 Correct 15 ms 2660 KB Output is correct
33 Correct 85 ms 8660 KB Output is correct
34 Correct 39 ms 5288 KB Output is correct
35 Correct 11 ms 2716 KB Output is correct
36 Correct 2 ms 1116 KB Output is correct
37 Correct 8 ms 2688 KB Output is correct
38 Correct 17 ms 3100 KB Output is correct
39 Correct 5 ms 1884 KB Output is correct
40 Correct 8 ms 2204 KB Output is correct
41 Correct 17 ms 3092 KB Output is correct
42 Correct 5 ms 2012 KB Output is correct
43 Correct 5 ms 2008 KB Output is correct
44 Correct 6 ms 2052 KB Output is correct
45 Correct 299 ms 26588 KB Output is correct
46 Correct 141 ms 14032 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1300 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 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 1112 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 3 ms 1368 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1440 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 3 ms 1372 KB Output is correct
24 Correct 3 ms 1372 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1372 KB Output is correct
28 Correct 10 ms 2392 KB Output is correct
29 Correct 38 ms 5012 KB Output is correct
30 Correct 10 ms 2140 KB Output is correct
31 Correct 21 ms 3356 KB Output is correct
32 Correct 16 ms 2736 KB Output is correct
33 Correct 80 ms 8772 KB Output is correct
34 Correct 38 ms 5204 KB Output is correct
35 Correct 11 ms 2712 KB Output is correct
36 Correct 2 ms 1372 KB Output is correct
37 Correct 8 ms 2712 KB Output is correct
38 Correct 17 ms 3036 KB Output is correct
39 Correct 5 ms 2136 KB Output is correct
40 Correct 6 ms 2396 KB Output is correct
41 Correct 15 ms 3184 KB Output is correct
42 Correct 5 ms 2012 KB Output is correct
43 Correct 5 ms 2012 KB Output is correct
44 Correct 6 ms 2052 KB Output is correct
45 Correct 297 ms 26600 KB Output is correct
46 Correct 136 ms 14236 KB Output is correct
47 Correct 16 ms 4224 KB Output is correct
48 Correct 5 ms 1880 KB Output is correct
49 Correct 4 ms 1880 KB Output is correct
50 Correct 4 ms 1628 KB Output is correct
51 Correct 28 ms 4624 KB Output is correct
52 Correct 35 ms 5644 KB Output is correct
53 Correct 8 ms 2652 KB Output is correct
54 Correct 9 ms 2908 KB Output is correct
55 Correct 17 ms 3768 KB Output is correct
56 Correct 26 ms 6228 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 50 ms 8400 KB Output is correct
59 Correct 41 ms 7092 KB Output is correct
60 Correct 47 ms 7336 KB Output is correct
61 Correct 35 ms 6488 KB Output is correct
62 Correct 193 ms 18516 KB Output is correct
63 Correct 684 ms 29492 KB Output is correct
64 Correct 832 ms 29424 KB Output is correct
65 Execution timed out 1063 ms 54932 KB Time limit exceeded
66 Halted 0 ms 0 KB -