oj.uz

Submission #1110712

# Submission time Handle Problem Language Result Execution time Memory
1110712 2024-11-10T08:52:13 Z nhphuc Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 303 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 = 316;

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 4688 KB Output is correct
2 Correct 2 ms 4688 KB Output is correct
3 Correct 1 ms 4688 KB Output is correct
4 Correct 2 ms 4688 KB Output is correct
5 Correct 2 ms 4688 KB Output is correct
6 Correct 2 ms 4688 KB Output is correct
7 Correct 1 ms 4688 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4688 KB Output is correct
2 Correct 1 ms 4688 KB Output is correct
3 Correct 1 ms 4860 KB Output is correct
4 Correct 2 ms 4688 KB Output is correct
5 Correct 1 ms 4688 KB Output is correct
6 Correct 1 ms 4688 KB Output is correct
7 Correct 1 ms 4688 KB Output is correct
8 Correct 1 ms 4688 KB Output is correct
9 Correct 1 ms 4688 KB Output is correct
10 Correct 2 ms 4688 KB Output is correct
11 Correct 5 ms 5364 KB Output is correct
12 Correct 3 ms 4944 KB Output is correct
13 Correct 2 ms 4924 KB Output is correct
14 Correct 5 ms 5452 KB Output is correct
15 Correct 4 ms 5452 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 4 ms 6992 KB Output is correct
18 Correct 2 ms 8784 KB Output is correct
19 Correct 2 ms 8784 KB Output is correct
20 Correct 3 ms 8956 KB Output is correct
21 Correct 2 ms 4688 KB Output is correct
22 Correct 2 ms 8784 KB Output is correct
23 Correct 2 ms 8784 KB Output is correct
24 Correct 3 ms 8784 KB Output is correct
25 Correct 2 ms 8784 KB Output is correct
26 Correct 2 ms 8784 KB Output is correct
27 Correct 3 ms 9208 KB Output is correct
28 Correct 3 ms 8784 KB Output is correct
29 Correct 7 ms 8784 KB Output is correct
30 Correct 4 ms 8784 KB Output is correct
31 Correct 4 ms 8904 KB Output is correct
32 Correct 3 ms 8784 KB Output is correct
33 Correct 17 ms 9552 KB Output is correct
34 Correct 15 ms 9548 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4688 KB Output is correct
2 Correct 1 ms 4688 KB Output is correct
3 Correct 1 ms 4688 KB Output is correct
4 Correct 2 ms 4688 KB Output is correct
5 Correct 1 ms 4688 KB Output is correct
6 Correct 1 ms 4688 KB Output is correct
7 Correct 1 ms 4688 KB Output is correct
8 Correct 1 ms 4688 KB Output is correct
9 Correct 1 ms 4688 KB Output is correct
10 Correct 1 ms 4688 KB Output is correct
11 Correct 5 ms 5196 KB Output is correct
12 Correct 2 ms 4760 KB Output is correct
13 Correct 2 ms 4688 KB Output is correct
14 Correct 5 ms 5452 KB Output is correct
15 Correct 5 ms 5452 KB Output is correct
16 Correct 2 ms 4688 KB Output is correct
17 Correct 5 ms 7028 KB Output is correct
18 Correct 2 ms 8784 KB Output is correct
19 Correct 2 ms 8784 KB Output is correct
20 Correct 2 ms 8784 KB Output is correct
21 Correct 2 ms 4688 KB Output is correct
22 Correct 2 ms 8784 KB Output is correct
23 Correct 2 ms 8784 KB Output is correct
24 Correct 3 ms 8784 KB Output is correct
25 Correct 2 ms 8784 KB Output is correct
26 Correct 3 ms 8784 KB Output is correct
27 Correct 3 ms 9040 KB Output is correct
28 Correct 2 ms 8784 KB Output is correct
29 Correct 6 ms 8836 KB Output is correct
30 Correct 3 ms 8784 KB Output is correct
31 Correct 4 ms 8784 KB Output is correct
32 Correct 3 ms 8784 KB Output is correct
33 Correct 15 ms 9552 KB Output is correct
34 Correct 16 ms 9548 KB Output is correct
35 Correct 29 ms 10696 KB Output is correct
36 Correct 4 ms 6992 KB Output is correct
37 Correct 52 ms 12740 KB Output is correct
38 Correct 48 ms 10956 KB Output is correct
39 Correct 44 ms 10968 KB Output is correct
40 Correct 42 ms 10952 KB Output is correct
41 Correct 42 ms 10952 KB Output is correct
42 Correct 8 ms 9932 KB Output is correct
43 Correct 11 ms 10572 KB Output is correct
44 Correct 8 ms 9976 KB Output is correct
45 Correct 289 ms 60588 KB Output is correct
46 Correct 289 ms 60576 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4688 KB Output is correct
2 Correct 1 ms 4688 KB Output is correct
3 Correct 2 ms 4688 KB Output is correct
4 Correct 1 ms 4912 KB Output is correct
5 Correct 1 ms 4688 KB Output is correct
6 Correct 2 ms 4688 KB Output is correct
7 Correct 1 ms 4688 KB Output is correct
8 Correct 2 ms 4708 KB Output is correct
9 Correct 1 ms 4688 KB Output is correct
10 Correct 2 ms 4856 KB Output is correct
11 Correct 5 ms 5196 KB Output is correct
12 Correct 2 ms 4944 KB Output is correct
13 Correct 2 ms 4688 KB Output is correct
14 Correct 5 ms 5452 KB Output is correct
15 Correct 5 ms 5620 KB Output is correct
16 Correct 2 ms 4688 KB Output is correct
17 Correct 4 ms 6992 KB Output is correct
18 Correct 2 ms 8784 KB Output is correct
19 Correct 2 ms 8784 KB Output is correct
20 Correct 2 ms 8784 KB Output is correct
21 Correct 1 ms 4688 KB Output is correct
22 Correct 2 ms 8784 KB Output is correct
23 Correct 3 ms 8960 KB Output is correct
24 Correct 3 ms 8932 KB Output is correct
25 Correct 2 ms 8784 KB Output is correct
26 Correct 2 ms 8784 KB Output is correct
27 Correct 3 ms 9040 KB Output is correct
28 Correct 2 ms 8784 KB Output is correct
29 Correct 6 ms 8784 KB Output is correct
30 Correct 3 ms 8784 KB Output is correct
31 Correct 4 ms 8784 KB Output is correct
32 Correct 3 ms 8784 KB Output is correct
33 Correct 15 ms 9552 KB Output is correct
34 Correct 17 ms 9548 KB Output is correct
35 Correct 28 ms 10696 KB Output is correct
36 Correct 4 ms 7164 KB Output is correct
37 Correct 53 ms 12740 KB Output is correct
38 Correct 42 ms 11124 KB Output is correct
39 Correct 44 ms 10956 KB Output is correct
40 Correct 43 ms 10952 KB Output is correct
41 Correct 48 ms 10952 KB Output is correct
42 Correct 8 ms 9932 KB Output is correct
43 Correct 11 ms 10572 KB Output is correct
44 Correct 7 ms 10144 KB Output is correct
45 Correct 303 ms 60596 KB Output is correct
46 Correct 302 ms 60680 KB Output is correct
47 Correct 155 ms 43272 KB Output is correct
48 Correct 13 ms 61008 KB Output is correct
49 Correct 14 ms 66648 KB Output is correct
50 Correct 19 ms 72784 KB Output is correct
51 Correct 64 ms 79436 KB Output is correct
52 Correct 69 ms 79480 KB Output is correct
53 Correct 28 ms 78416 KB Output is correct
54 Correct 18 ms 77356 KB Output is correct
55 Correct 26 ms 77392 KB Output is correct
56 Correct 31 ms 78928 KB Output is correct
57 Correct 78 ms 77640 KB Output is correct
58 Correct 33 ms 79692 KB Output is correct
59 Correct 39 ms 79060 KB Output is correct
60 Correct 32 ms 79692 KB Output is correct
61 Correct 34 ms 79688 KB Output is correct
62 Correct 39 ms 78928 KB Output is correct
63 Runtime error 282 ms 262144 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -