oj.uz

Submission #768910

# Submission time Handle Problem Language Result Execution time Memory
768910 2023-06-28T21:24:15 Z raysh07 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 307 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n, m; cin >> n >> m;
    
    vector <pair<int, int>> a(m);
    set <int> st[n];
    int target;
    vector <int> d(n, INF);
    priority_queue <pair<int, int>> pq;
    for (int i = 0; i < m; i++){
        cin >> a[i].f >> a[i].s;
        
        if (i == 0) {
            d[a[i].f] = 0;
            pq.push({0, a[i].f});
        }
        if (i != 1) st[a[i].f].insert(a[i].s);
        else target = a[i].f;
    }
    
    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < n; i++){
        for (auto x : st[i]){
            for (int j = 1; ; j++){
                int go = x * j + i;
                if (go >= n || go < 0) break;
                adj[i].push_back({go, j});
            }
            
            for (int j = 1; ; j++){
                int go = i - x * j;
                if (go < 0 || go >= n) break;
                adj[i].push_back({go, j});
            }
        }
    }
    
    while (!pq.empty()){
        auto pi = pq.top();
        pq.pop();
        
        int u = pi.second;
        int ds = -pi.first;
        
        if (d[u] != ds) continue;
        
        for (auto [v, w] : adj[u]){
            if (d[v] > d[u] + w){
                d[v] = d[u] + w;
                pq.push({-d[v], v});
            }
        }
    }
  //  cout << target << "\n";
    
    if (d[target] == INF) cout << -1 << "\n";
    else cout << d[target] << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Compilation message

skyscraper.cpp: In function 'void Solve()':
skyscraper.cpp:65:17: warning: 'target' may be used uninitialized in this function [-Wmaybe-uninitialized]
   65 |     if (d[target] == INF) cout << -1 << "\n";
      |                 ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 60 ms 64740 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 3 ms 2004 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 1348 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 4 ms 3016 KB Output is correct
34 Correct 4 ms 3012 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 59 ms 64788 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 900 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 2 ms 2004 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 4 ms 3024 KB Output is correct
34 Correct 4 ms 3016 KB Output is correct
35 Correct 10 ms 5196 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 10 ms 7904 KB Output is correct
38 Correct 13 ms 7380 KB Output is correct
39 Correct 13 ms 7764 KB Output is correct
40 Correct 13 ms 7480 KB Output is correct
41 Correct 12 ms 7196 KB Output is correct
42 Correct 4 ms 1388 KB Output is correct
43 Correct 4 ms 1236 KB Output is correct
44 Correct 62 ms 65388 KB Output is correct
45 Correct 21 ms 10784 KB Output is correct
46 Correct 16 ms 10708 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 580 KB Output is correct
20 Correct 63 ms 64724 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 1 ms 728 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 3 ms 2016 KB Output is correct
30 Correct 1 ms 992 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 2 ms 1120 KB Output is correct
33 Correct 4 ms 3036 KB Output is correct
34 Correct 4 ms 3024 KB Output is correct
35 Correct 10 ms 5088 KB Output is correct
36 Correct 2 ms 1120 KB Output is correct
37 Correct 10 ms 7928 KB Output is correct
38 Correct 12 ms 7408 KB Output is correct
39 Correct 13 ms 7772 KB Output is correct
40 Correct 13 ms 7492 KB Output is correct
41 Correct 12 ms 7252 KB Output is correct
42 Correct 4 ms 1364 KB Output is correct
43 Correct 4 ms 1232 KB Output is correct
44 Correct 62 ms 65408 KB Output is correct
45 Correct 16 ms 10736 KB Output is correct
46 Correct 16 ms 10708 KB Output is correct
47 Correct 32 ms 24636 KB Output is correct
48 Correct 11 ms 8276 KB Output is correct
49 Correct 9 ms 6484 KB Output is correct
50 Correct 7 ms 6244 KB Output is correct
51 Correct 29 ms 14152 KB Output is correct
52 Correct 34 ms 13964 KB Output is correct
53 Correct 11 ms 6348 KB Output is correct
54 Correct 3 ms 3288 KB Output is correct
55 Correct 4 ms 3924 KB Output is correct
56 Runtime error 307 ms 262144 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -