oj.uz

Submission #953655

# Submission time Handle Problem Language Result Execution time Memory
953655 2024-03-26T11:58:46 Z Unforgettablepl Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 104376 KB 
#pragma GCC optimize("O3")
#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];
bool visited[30000][201];
const int INF = 1e15;
int n;
int threshold = 200;

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;
    threshold = sqrt(n);
    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.first][curr.second.second])continue;
        visited[curr.second.first][curr.second.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 2904 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 1 ms 3164 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 3424 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2912 KB Output is correct
23 Correct 2 ms 3172 KB Output is correct
24 Correct 3 ms 3420 KB Output is correct
25 Correct 1 ms 3424 KB Output is correct
26 Correct 1 ms 3424 KB Output is correct
27 Correct 1 ms 3420 KB Output is correct
28 Correct 1 ms 3420 KB Output is correct
29 Correct 6 ms 3420 KB Output is correct
30 Correct 2 ms 3420 KB Output is correct
31 Correct 5 ms 3492 KB Output is correct
32 Correct 4 ms 3612 KB Output is correct
33 Correct 16 ms 4572 KB Output is correct
34 Correct 11 ms 4564 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2912 KB Output is correct
2 Correct 1 ms 2912 KB Output is correct
3 Correct 1 ms 2912 KB Output is correct
4 Correct 1 ms 2912 KB Output is correct
5 Correct 1 ms 2912 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2912 KB Output is correct
8 Correct 1 ms 2912 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2912 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2912 KB Output is correct
13 Correct 1 ms 2912 KB Output is correct
14 Correct 1 ms 3168 KB Output is correct
15 Correct 1 ms 3168 KB Output is correct
16 Correct 1 ms 2912 KB Output is correct
17 Correct 1 ms 3168 KB Output is correct
18 Correct 1 ms 2912 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 3416 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 2 ms 3164 KB Output is correct
24 Correct 2 ms 3420 KB Output is correct
25 Correct 1 ms 3420 KB Output is correct
26 Correct 1 ms 3420 KB Output is correct
27 Correct 1 ms 3672 KB Output is correct
28 Correct 2 ms 3420 KB Output is correct
29 Correct 6 ms 3276 KB Output is correct
30 Correct 2 ms 3420 KB Output is correct
31 Correct 4 ms 3356 KB Output is correct
32 Correct 4 ms 3612 KB Output is correct
33 Correct 16 ms 4568 KB Output is correct
34 Correct 11 ms 4564 KB Output is correct
35 Correct 6 ms 4444 KB Output is correct
36 Correct 2 ms 3164 KB Output is correct
37 Correct 5 ms 4444 KB Output is correct
38 Correct 8 ms 5332 KB Output is correct
39 Correct 5 ms 3420 KB Output is correct
40 Correct 6 ms 4184 KB Output is correct
41 Correct 8 ms 5332 KB Output is correct
42 Correct 4 ms 3548 KB Output is correct
43 Correct 4 ms 3548 KB Output is correct
44 Correct 4 ms 3584 KB Output is correct
45 Correct 82 ms 16072 KB Output is correct
46 Correct 49 ms 16588 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2916 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2912 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 2 ms 3164 KB Output is correct
15 Correct 1 ms 3152 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 2 ms 3164 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 3420 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 3160 KB Output is correct
24 Correct 2 ms 3420 KB Output is correct
25 Correct 1 ms 3420 KB Output is correct
26 Correct 3 ms 3420 KB Output is correct
27 Correct 1 ms 3420 KB Output is correct
28 Correct 2 ms 3420 KB Output is correct
29 Correct 6 ms 3420 KB Output is correct
30 Correct 2 ms 3420 KB Output is correct
31 Correct 4 ms 3512 KB Output is correct
32 Correct 3 ms 3612 KB Output is correct
33 Correct 16 ms 4568 KB Output is correct
34 Correct 11 ms 4564 KB Output is correct
35 Correct 6 ms 4444 KB Output is correct
36 Correct 2 ms 3164 KB Output is correct
37 Correct 5 ms 4532 KB Output is correct
38 Correct 12 ms 5416 KB Output is correct
39 Correct 5 ms 3420 KB Output is correct
40 Correct 6 ms 4188 KB Output is correct
41 Correct 8 ms 5336 KB Output is correct
42 Correct 4 ms 3548 KB Output is correct
43 Correct 5 ms 3548 KB Output is correct
44 Correct 4 ms 3588 KB Output is correct
45 Correct 84 ms 16632 KB Output is correct
46 Correct 50 ms 15852 KB Output is correct
47 Correct 8 ms 7376 KB Output is correct
48 Correct 5 ms 3676 KB Output is correct
49 Correct 6 ms 3692 KB Output is correct
50 Correct 4 ms 3420 KB Output is correct
51 Correct 14 ms 9044 KB Output is correct
52 Correct 16 ms 9812 KB Output is correct
53 Correct 7 ms 4700 KB Output is correct
54 Correct 3 ms 7116 KB Output is correct
55 Correct 3 ms 7260 KB Output is correct
56 Correct 8 ms 8284 KB Output is correct
57 Correct 1 ms 3164 KB Output is correct
58 Correct 8 ms 8412 KB Output is correct
59 Correct 6 ms 7904 KB Output is correct
60 Correct 7 ms 7648 KB Output is correct
61 Correct 7 ms 7900 KB Output is correct
62 Correct 16 ms 8692 KB Output is correct
63 Correct 276 ms 30408 KB Output is correct
64 Correct 320 ms 30520 KB Output is correct
65 Correct 893 ms 53732 KB Output is correct
66 Execution timed out 1010 ms 104376 KB Time limit exceeded
67 Halted 0 ms 0 KB -