oj.uz

Submission #1110716

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

#define iii tuple<int, int, int>

const int N = 50500;
const int block = 350;

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:16:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
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.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.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 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 2 ms 4688 KB Output is correct
7 Correct 2 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 2 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 2 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 4944 KB Output is correct
12 Correct 2 ms 4688 KB Output is correct
13 Correct 2 ms 4688 KB Output is correct
14 Correct 4 ms 5140 KB Output is correct
15 Correct 5 ms 5140 KB Output is correct

Subtask #3
14.0 / 14.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 1 ms 4944 KB Output is correct
4 Correct 1 ms 4688 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 4688 KB Output is correct
9 Correct 2 ms 4688 KB Output is correct
10 Correct 2 ms 4688 KB Output is correct
11 Correct 6 ms 4900 KB Output is correct
12 Correct 2 ms 4688 KB Output is correct
13 Correct 1 ms 4856 KB Output is correct
14 Correct 4 ms 5140 KB Output is correct
15 Correct 5 ms 5140 KB Output is correct
16 Correct 2 ms 4856 KB Output is correct
17 Correct 4 ms 4688 KB Output is correct
18 Correct 2 ms 6752 KB Output is correct
19 Correct 2 ms 6736 KB Output is correct
20 Correct 2 ms 6736 KB Output is correct
21 Correct 2 ms 4688 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 6736 KB Output is correct
28 Correct 2 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 6736 KB Output is correct
32 Correct 3 ms 6736 KB Output is correct
33 Correct 14 ms 7188 KB Output is correct
34 Correct 14 ms 7352 KB Output is correct

Subtask #4
21.0 / 21.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 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 2 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 4 ms 4944 KB Output is correct
12 Correct 2 ms 4688 KB Output is correct
13 Correct 2 ms 4856 KB Output is correct
14 Correct 4 ms 5140 KB Output is correct
15 Correct 5 ms 5140 KB Output is correct
16 Correct 1 ms 4756 KB Output is correct
17 Correct 4 ms 4880 KB Output is correct
18 Correct 2 ms 6904 KB Output is correct
19 Correct 2 ms 6736 KB Output is correct
20 Correct 2 ms 6736 KB Output is correct
21 Correct 2 ms 4688 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 6748 KB Output is correct
26 Correct 2 ms 6736 KB Output is correct
27 Correct 2 ms 6904 KB Output is correct
28 Correct 3 ms 6736 KB Output is correct
29 Correct 7 ms 6736 KB Output is correct
30 Correct 3 ms 6736 KB Output is correct
31 Correct 5 ms 6736 KB Output is correct
32 Correct 3 ms 6736 KB Output is correct
33 Correct 14 ms 7356 KB Output is correct
34 Correct 14 ms 7188 KB Output is correct
35 Correct 29 ms 7768 KB Output is correct
36 Correct 4 ms 6736 KB Output is correct
37 Correct 52 ms 8648 KB Output is correct
38 Correct 41 ms 7884 KB Output is correct
39 Correct 50 ms 7776 KB Output is correct
40 Correct 45 ms 7884 KB Output is correct
41 Correct 44 ms 8820 KB Output is correct
42 Correct 7 ms 7564 KB Output is correct
43 Correct 10 ms 7820 KB Output is correct
44 Correct 6 ms 7548 KB Output is correct
45 Correct 283 ms 33716 KB Output is correct
46 Correct 271 ms 33760 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 1 ms 4688 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 2 ms 4688 KB Output is correct
6 Correct 1 ms 4688 KB Output is correct
7 Correct 1 ms 4736 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 4944 KB Output is correct
12 Correct 2 ms 4688 KB Output is correct
13 Correct 2 ms 4688 KB Output is correct
14 Correct 5 ms 5140 KB Output is correct
15 Correct 4 ms 5140 KB Output is correct
16 Correct 1 ms 4708 KB Output is correct
17 Correct 4 ms 4688 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 4688 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 6752 KB Output is correct
25 Correct 3 ms 6904 KB Output is correct
26 Correct 2 ms 6736 KB Output is correct
27 Correct 3 ms 6736 KB Output is correct
28 Correct 2 ms 6736 KB Output is correct
29 Correct 6 ms 6736 KB Output is correct
30 Correct 3 ms 6736 KB Output is correct
31 Correct 5 ms 6736 KB Output is correct
32 Correct 3 ms 6736 KB Output is correct
33 Correct 14 ms 7188 KB Output is correct
34 Correct 14 ms 7264 KB Output is correct
35 Correct 36 ms 7756 KB Output is correct
36 Correct 4 ms 6736 KB Output is correct
37 Correct 58 ms 8472 KB Output is correct
38 Correct 41 ms 7884 KB Output is correct
39 Correct 42 ms 7884 KB Output is correct
40 Correct 42 ms 7884 KB Output is correct
41 Correct 43 ms 8652 KB Output is correct
42 Correct 7 ms 7668 KB Output is correct
43 Correct 11 ms 7820 KB Output is correct
44 Correct 8 ms 7548 KB Output is correct
45 Correct 269 ms 33856 KB Output is correct
46 Correct 265 ms 33720 KB Output is correct
47 Correct 139 ms 25092 KB Output is correct
48 Correct 11 ms 37968 KB Output is correct
49 Correct 11 ms 40016 KB Output is correct
50 Correct 10 ms 43856 KB Output is correct
51 Correct 47 ms 46868 KB Output is correct
52 Correct 52 ms 46864 KB Output is correct
53 Correct 14 ms 46416 KB Output is correct
54 Correct 7 ms 45700 KB Output is correct
55 Correct 6 ms 45648 KB Output is correct
56 Correct 12 ms 46672 KB Output is correct
57 Correct 55 ms 45776 KB Output is correct
58 Correct 17 ms 46856 KB Output is correct
59 Correct 14 ms 46476 KB Output is correct
60 Correct 20 ms 46856 KB Output is correct
61 Correct 18 ms 46988 KB Output is correct
62 Correct 24 ms 44892 KB Output is correct
63 Execution timed out 1092 ms 241120 KB Time limit exceeded
64 Halted 0 ms 0 KB -