oj.uz

Submission #539238

# Submission time Handle Problem Language Result Execution time Memory
539238 2022-03-18T15:26:40 Z timreizin Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 140 ms 26168 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[i].size());
        for (int j = 0; j < canGet[i].size(); ++j) dp[i][D + j] = INF;
    }
    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:33:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for (int j = 0; j < canGet[i].size(); ++j) dp[i][D + j] = INF;
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.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 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

Subtask #2
12.0 / 12.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 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 0 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 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 852 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 2 ms 1492 KB Output is correct
23 Correct 2 ms 1492 KB Output is correct
24 Correct 4 ms 1900 KB Output is correct
25 Correct 4 ms 1876 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 5 ms 1876 KB Output is correct
29 Correct 3 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 5 ms 1104 KB Output is correct
34 Correct 4 ms 1108 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 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 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 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 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 2 ms 852 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 1620 KB Output is correct
23 Correct 2 ms 1492 KB Output is correct
24 Correct 3 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 3 ms 1364 KB Output is correct
28 Correct 5 ms 1908 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 4 ms 1108 KB Output is correct
34 Correct 5 ms 1108 KB Output is correct
35 Correct 21 ms 2004 KB Output is correct
36 Correct 5 ms 1236 KB Output is correct
37 Correct 28 ms 2516 KB Output is correct
38 Correct 23 ms 2644 KB Output is correct
39 Correct 28 ms 2644 KB Output is correct
40 Correct 24 ms 2620 KB Output is correct
41 Correct 25 ms 2644 KB Output is correct
42 Correct 5 ms 1492 KB Output is correct
43 Correct 6 ms 1748 KB Output is correct
44 Correct 5 ms 1492 KB Output is correct
45 Correct 41 ms 2892 KB Output is correct
46 Correct 29 ms 2900 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 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 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
8 Correct 0 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 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 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 3 ms 1620 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 2 ms 1544 KB Output is correct
23 Correct 2 ms 1492 KB Output is correct
24 Correct 3 ms 1876 KB Output is correct
25 Correct 3 ms 1876 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 3 ms 1876 KB Output is correct
29 Correct 3 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 4 ms 1108 KB Output is correct
34 Correct 3 ms 1108 KB Output is correct
35 Correct 15 ms 2004 KB Output is correct
36 Correct 4 ms 1236 KB Output is correct
37 Correct 23 ms 2504 KB Output is correct
38 Correct 25 ms 2612 KB Output is correct
39 Correct 29 ms 2644 KB Output is correct
40 Correct 23 ms 2580 KB Output is correct
41 Correct 25 ms 2648 KB Output is correct
42 Correct 9 ms 1556 KB Output is correct
43 Correct 9 ms 1720 KB Output is correct
44 Correct 6 ms 1492 KB Output is correct
45 Correct 28 ms 2900 KB Output is correct
46 Correct 29 ms 2960 KB Output is correct
47 Correct 140 ms 12048 KB Output is correct
48 Correct 38 ms 20172 KB Output is correct
49 Correct 39 ms 21780 KB Output is correct
50 Correct 38 ms 23376 KB Output is correct
51 Correct 105 ms 26168 KB Output is correct
52 Correct 106 ms 26060 KB Output is correct
53 Correct 37 ms 23704 KB Output is correct
54 Correct 10 ms 13240 KB Output is correct
55 Correct 9 ms 13252 KB Output is correct
56 Correct 20 ms 14548 KB Output is correct
57 Correct 35 ms 13260 KB Output is correct
58 Incorrect 14 ms 13644 KB Output isn't correct
59 Halted 0 ms 0 KB -