oj.uz

Submission #539230

# Submission time Handle Problem Language Result Execution time Memory
539230 2022-03-18T15:23:41 Z timreizin Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 152 ms 262144 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <cassert>

using namespace std;

const short INF = 32767;


int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> doges(m);
    for (auto &[b, p] : doges) cin >> b >> p;
    const short D = 180;
    vector<vector<short>> dp(n, vector<short>(D, INF));
    vector<vector<short>> canGet(n), starts(n);
    for (auto &[b, p] : doges)
    {
        starts[b].push_back(p);
        if (p >= D) for (int i = b % p; i < n; i += p) canGet[i].push_back(p);
    }
    for (int i = 0; i < n; ++i)
    {
        sort(canGet[i].begin(), canGet[i].end());
        canGet[i].erase(unique(canGet[i].begin(), canGet[i].end()), canGet[i].end());
        sort(starts[i].begin(), starts[i].end());
        starts[i].erase(unique(starts[i].begin(), starts[i].end()), starts[i].end());
        dp[i].resize(D + canGet.size());
        if (n <= 2000) for (int j = 0; j < canGet.size(); ++j) dp[i][D + j] = INF;
    }
    if (n <= 2000)
    {
    auto getInd = [&canGet, &D](short v, short p) -> short
    {
        if (p < D) return p;
        return (short)distance(canGet[v].begin(), lower_bound(canGet[v].begin(), canGet[v].end(), p)) + (short)D;
    };
    short ind = getInd(doges[0].first, doges[0].second);
    dp[doges[0].first][ind] = 0;
    deque<pair<short, short>> dq;
    dq.emplace_back(doges[0].first, doges[0].second);
    while (!dq.empty())
    {
        auto [i, p] = dq.front();
        dq.pop_front();
        short ind = getInd(i, p);
        for (int j : starts[i])
        {
            int ind2 = getInd(i, j);
            if (dp[i][ind2] > dp[i][ind])
            {
                dp[i][ind2] = dp[i][ind];
                dq.emplace_front(i, j);
            }
        }
        starts[i].clear();
        if (i - p >= 0)
        {
            short ind2 = getInd(i - p, p);
            if (dp[i - p][ind2] > dp[i][ind] + 1)
            {
                dp[i - p][ind2] = dp[i][ind] + 1;
                dq.emplace_back(i - p, p);
            }
        }
        if (i + p < n)
        {
            short ind2 = getInd(i + p, p);
            if (dp[i + p][ind2] > dp[i][ind] + 1)
            {
                dp[i + p][ind2] = dp[i][ind] + 1;
                dq.emplace_back(i + p, p);
            }
        }
    }
    ind = getInd(doges[1].first, doges[1].second);
    if (dp[doges[1].first][ind] == INF) cout << -1;
    else cout << dp[doges[1].first][ind];
    }
    return 0;
}
//47

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:34:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<short int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         if (n <= 2000) for (int j = 0; j < canGet.size(); ++j) dp[i][D + j] = INF;
      |                                        ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 1 ms 368 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 4 ms 1748 KB Output is correct
18 Correct 7 ms 7124 KB Output is correct
19 Correct 13 ms 8952 KB Output is correct
20 Correct 14 ms 9044 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 8 ms 7292 KB Output is correct
23 Correct 7 ms 6004 KB Output is correct
24 Correct 11 ms 8276 KB Output is correct
25 Correct 15 ms 9040 KB Output is correct
26 Correct 12 ms 9024 KB Output is correct
27 Correct 11 ms 9048 KB Output is correct
28 Correct 12 ms 9044 KB Output is correct
29 Correct 10 ms 8916 KB Output is correct
30 Correct 9 ms 8916 KB Output is correct
31 Correct 9 ms 8924 KB Output is correct
32 Correct 9 ms 8916 KB Output is correct
33 Correct 11 ms 9044 KB Output is correct
34 Correct 12 ms 9004 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 5 ms 1744 KB Output is correct
18 Correct 7 ms 7124 KB Output is correct
19 Correct 10 ms 9044 KB Output is correct
20 Correct 9 ms 9044 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 6 ms 7252 KB Output is correct
23 Correct 8 ms 5988 KB Output is correct
24 Correct 13 ms 8276 KB Output is correct
25 Correct 9 ms 9044 KB Output is correct
26 Correct 11 ms 8916 KB Output is correct
27 Correct 13 ms 9024 KB Output is correct
28 Correct 11 ms 9044 KB Output is correct
29 Correct 11 ms 9000 KB Output is correct
30 Correct 10 ms 8916 KB Output is correct
31 Correct 12 ms 8916 KB Output is correct
32 Correct 9 ms 8920 KB Output is correct
33 Correct 17 ms 9040 KB Output is correct
34 Correct 12 ms 8996 KB Output is correct
35 Correct 28 ms 5552 KB Output is correct
36 Correct 7 ms 3156 KB Output is correct
37 Correct 38 ms 9128 KB Output is correct
38 Correct 38 ms 9656 KB Output is correct
39 Correct 35 ms 9684 KB Output is correct
40 Correct 38 ms 9684 KB Output is correct
41 Correct 36 ms 9732 KB Output is correct
42 Correct 12 ms 9300 KB Output is correct
43 Correct 13 ms 9300 KB Output is correct
44 Correct 12 ms 9328 KB Output is correct
45 Correct 40 ms 9964 KB Output is correct
46 Correct 49 ms 10044 KB Output is correct

Subtask #5
0 / 43.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 1 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 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1748 KB Output is correct
18 Correct 6 ms 7124 KB Output is correct
19 Correct 8 ms 9044 KB Output is correct
20 Correct 8 ms 8972 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 6 ms 7252 KB Output is correct
23 Correct 6 ms 6084 KB Output is correct
24 Correct 12 ms 8280 KB Output is correct
25 Correct 13 ms 8980 KB Output is correct
26 Correct 10 ms 9008 KB Output is correct
27 Correct 10 ms 9048 KB Output is correct
28 Correct 10 ms 9136 KB Output is correct
29 Correct 10 ms 8916 KB Output is correct
30 Correct 9 ms 8892 KB Output is correct
31 Correct 10 ms 8916 KB Output is correct
32 Correct 8 ms 8992 KB Output is correct
33 Correct 11 ms 8916 KB Output is correct
34 Correct 13 ms 9008 KB Output is correct
35 Correct 26 ms 5448 KB Output is correct
36 Correct 7 ms 3156 KB Output is correct
37 Correct 34 ms 9120 KB Output is correct
38 Correct 33 ms 9712 KB Output is correct
39 Correct 31 ms 9772 KB Output is correct
40 Correct 33 ms 9684 KB Output is correct
41 Correct 32 ms 9716 KB Output is correct
42 Correct 12 ms 9300 KB Output is correct
43 Correct 16 ms 9300 KB Output is correct
44 Correct 12 ms 9364 KB Output is correct
45 Correct 40 ms 10068 KB Output is correct
46 Correct 38 ms 10072 KB Output is correct
47 Runtime error 152 ms 262144 KB Execution killed with signal 9
48 Halted 0 ms 0 KB -