oj.uz

Submission #1110714

# Submission time Handle Problem Language Result Execution time Memory
1110714 2024-11-10T08:54:40 Z nhphuc Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 330 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define iii tuple<int, int, int>

const int N = 50500;
const int block = 310;

int n, m, b[N], v[N], dp[N][block + 7], ans = -1;
vector<int> pw[N];
priority_queue<iii, vector<iii>, greater<iii>> pq;

int32_t main (){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    if (fopen("test.inp", "r")){
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    cin >> n >> m;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j <= block + 1; ++j)
            dp[i][j] = -1;
    for (int i = 1; i <= m; ++i){
        cin >> b[i] >> v[i];
        pw[b[i]].push_back(v[i]);
        if (i == 1)
            pq.push({0, b[i], v[i]});
    }
    while (pq.size()){
        auto P = pq.top(); pq.pop();
        int D = get<0>(P);
        int u = get<1>(P);
        int t = get<2>(P); t = min(t, block + 1);
        if (dp[u][t] != -1)
            continue;
        dp[u][t] = D;
        if (u == b[2])
            ans = min((ans == -1 ? (int)1e16 : ans), D);
        if (t <= block){
            if (u - t >= 0 && dp[u - t][t] == -1)
                pq.push(make_tuple(D + 1, u - t, t));
            if (u + t < n && dp[u + t][t] == -1)
                pq.push(make_tuple(D + 1, u + t, t));
        }
        for (int X : pw[u]){
            if (X <= block){
                if (u - X >= 0 && dp[u - X][X] == -1)
                    pq.push(make_tuple(D + 1, u - X, X));
                if (u + X < n && dp[u + X][X] == -1)
                    pq.push(make_tuple(D + 1, u + X, X));
            } else {
                for (int i = u - X; i >= 0; i -= X)
                    if (dp[i][block + 1] == -1)
                        pq.push(make_tuple(D + (u - i) / X, i, X));
                for (int i = u + X; i < n; i += X)
                    if (dp[i][block + 1] == -1)
                        pq.push(make_tuple(D + (i - u) / X, i, X));
            }
        }
    }
    cout << ans << "\n";
}

Compilation message

skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:18:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2692 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 6 ms 3148 KB Output is correct
12 Correct 3 ms 2896 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 4 ms 3660 KB Output is correct
15 Correct 4 ms 3488 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2812 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 4 ms 3148 KB Output is correct
12 Correct 2 ms 2896 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 4 ms 3660 KB Output is correct
15 Correct 5 ms 3660 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 4 ms 4944 KB Output is correct
18 Correct 2 ms 6796 KB Output is correct
19 Correct 2 ms 6736 KB Output is correct
20 Correct 3 ms 6736 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 1 ms 6736 KB Output is correct
23 Correct 2 ms 6736 KB Output is correct
24 Correct 3 ms 6736 KB Output is correct
25 Correct 2 ms 6736 KB Output is correct
26 Correct 2 ms 6736 KB Output is correct
27 Correct 2 ms 6992 KB Output is correct
28 Correct 2 ms 6736 KB Output is correct
29 Correct 7 ms 6736 KB Output is correct
30 Correct 3 ms 6692 KB Output is correct
31 Correct 4 ms 6736 KB Output is correct
32 Correct 4 ms 6736 KB Output is correct
33 Correct 15 ms 7760 KB Output is correct
34 Correct 16 ms 7756 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 4 ms 3148 KB Output is correct
12 Correct 2 ms 2896 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 4 ms 3660 KB Output is correct
15 Correct 5 ms 3660 KB Output is correct
16 Correct 1 ms 2640 KB Output is correct
17 Correct 4 ms 4944 KB Output is correct
18 Correct 2 ms 6736 KB Output is correct
19 Correct 1 ms 6736 KB Output is correct
20 Correct 2 ms 6756 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 6736 KB Output is correct
23 Correct 2 ms 6736 KB Output is correct
24 Correct 3 ms 6736 KB Output is correct
25 Correct 2 ms 6736 KB Output is correct
26 Correct 3 ms 6736 KB Output is correct
27 Correct 2 ms 6992 KB Output is correct
28 Correct 2 ms 6736 KB Output is correct
29 Correct 7 ms 6980 KB Output is correct
30 Correct 3 ms 6736 KB Output is correct
31 Correct 4 ms 6736 KB Output is correct
32 Correct 3 ms 6736 KB Output is correct
33 Correct 14 ms 7760 KB Output is correct
34 Correct 18 ms 7756 KB Output is correct
35 Correct 30 ms 9160 KB Output is correct
36 Correct 4 ms 4944 KB Output is correct
37 Correct 61 ms 10984 KB Output is correct
38 Correct 42 ms 9164 KB Output is correct
39 Correct 43 ms 9164 KB Output is correct
40 Correct 45 ms 9328 KB Output is correct
41 Correct 44 ms 9160 KB Output is correct
42 Correct 8 ms 8564 KB Output is correct
43 Correct 14 ms 9036 KB Output is correct
44 Correct 7 ms 8612 KB Output is correct
45 Correct 304 ms 59032 KB Output is correct
46 Correct 302 ms 59060 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 4 ms 3148 KB Output is correct
12 Correct 2 ms 2896 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 4 ms 3660 KB Output is correct
15 Correct 4 ms 3660 KB Output is correct
16 Correct 1 ms 2640 KB Output is correct
17 Correct 4 ms 4944 KB Output is correct
18 Correct 2 ms 6736 KB Output is correct
19 Correct 2 ms 6736 KB Output is correct
20 Correct 2 ms 6736 KB Output is correct
21 Correct 1 ms 2640 KB Output is correct
22 Correct 2 ms 6736 KB Output is correct
23 Correct 2 ms 6736 KB Output is correct
24 Correct 3 ms 6736 KB Output is correct
25 Correct 2 ms 6736 KB Output is correct
26 Correct 2 ms 6736 KB Output is correct
27 Correct 2 ms 6992 KB Output is correct
28 Correct 3 ms 6736 KB Output is correct
29 Correct 6 ms 6736 KB Output is correct
30 Correct 2 ms 6736 KB Output is correct
31 Correct 4 ms 6908 KB Output is correct
32 Correct 3 ms 6736 KB Output is correct
33 Correct 14 ms 7560 KB Output is correct
34 Correct 15 ms 7756 KB Output is correct
35 Correct 28 ms 9160 KB Output is correct
36 Correct 4 ms 4944 KB Output is correct
37 Correct 53 ms 10948 KB Output is correct
38 Correct 41 ms 9176 KB Output is correct
39 Correct 42 ms 9452 KB Output is correct
40 Correct 42 ms 9160 KB Output is correct
41 Correct 43 ms 9160 KB Output is correct
42 Correct 8 ms 8396 KB Output is correct
43 Correct 10 ms 9036 KB Output is correct
44 Correct 8 ms 8440 KB Output is correct
45 Correct 330 ms 59056 KB Output is correct
46 Correct 318 ms 59060 KB Output is correct
47 Correct 145 ms 41424 KB Output is correct
48 Correct 12 ms 59964 KB Output is correct
49 Correct 20 ms 65276 KB Output is correct
50 Correct 23 ms 71504 KB Output is correct
51 Correct 70 ms 77892 KB Output is correct
52 Correct 72 ms 77900 KB Output is correct
53 Correct 29 ms 77128 KB Output is correct
54 Correct 23 ms 76012 KB Output is correct
55 Correct 21 ms 75856 KB Output is correct
56 Correct 30 ms 77384 KB Output is correct
57 Correct 68 ms 76248 KB Output is correct
58 Correct 27 ms 78412 KB Output is correct
59 Correct 23 ms 77716 KB Output is correct
60 Correct 32 ms 78412 KB Output is correct
61 Correct 32 ms 78408 KB Output is correct
62 Correct 36 ms 77392 KB Output is correct
63 Runtime error 306 ms 262144 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -