oj.uz

Submission #539240

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

using namespace std;

#define short int

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:35:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         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 1 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

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 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 340 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

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 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 1 ms 212 KB Output is correct
8 Correct 0 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 408 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 1492 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 3156 KB Output is correct
25 Correct 3 ms 3284 KB Output is correct
26 Correct 2 ms 2004 KB Output is correct
27 Correct 3 ms 2388 KB Output is correct
28 Correct 4 ms 3156 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 1876 KB Output is correct
33 Correct 4 ms 1956 KB Output is correct
34 Correct 4 ms 1952 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 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 1492 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 3156 KB Output is correct
25 Correct 3 ms 3284 KB Output is correct
26 Correct 2 ms 2004 KB Output is correct
27 Correct 2 ms 2388 KB Output is correct
28 Correct 3 ms 3156 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 2 ms 1824 KB Output is correct
32 Correct 2 ms 1876 KB Output is correct
33 Correct 4 ms 1952 KB Output is correct
34 Correct 5 ms 1876 KB Output is correct
35 Correct 19 ms 3284 KB Output is correct
36 Correct 4 ms 2132 KB Output is correct
37 Correct 23 ms 4232 KB Output is correct
38 Correct 26 ms 4560 KB Output is correct
39 Correct 26 ms 4564 KB Output is correct
40 Correct 26 ms 4528 KB Output is correct
41 Correct 28 ms 4564 KB Output is correct
42 Correct 5 ms 2388 KB Output is correct
43 Correct 7 ms 2772 KB Output is correct
44 Correct 6 ms 2308 KB Output is correct
45 Correct 31 ms 5048 KB Output is correct
46 Correct 34 ms 5076 KB Output is correct

Subtask #5
0 / 43.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 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 1 ms 212 KB Output is correct
8 Correct 0 ms 340 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 1492 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 4 ms 3156 KB Output is correct
25 Correct 3 ms 3284 KB Output is correct
26 Correct 2 ms 2004 KB Output is correct
27 Correct 2 ms 2388 KB Output is correct
28 Correct 4 ms 3184 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 3 ms 1876 KB Output is correct
33 Correct 4 ms 1876 KB Output is correct
34 Correct 4 ms 1876 KB Output is correct
35 Correct 16 ms 3328 KB Output is correct
36 Correct 3 ms 2132 KB Output is correct
37 Correct 23 ms 4180 KB Output is correct
38 Correct 26 ms 4500 KB Output is correct
39 Correct 32 ms 4476 KB Output is correct
40 Correct 28 ms 4536 KB Output is correct
41 Correct 25 ms 4540 KB Output is correct
42 Correct 6 ms 2388 KB Output is correct
43 Correct 6 ms 2772 KB Output is correct
44 Correct 6 ms 2260 KB Output is correct
45 Correct 33 ms 5076 KB Output is correct
46 Correct 39 ms 5148 KB Output is correct
47 Correct 125 ms 22032 KB Output is correct
48 Correct 34 ms 36756 KB Output is correct
49 Correct 39 ms 39664 KB Output is correct
50 Correct 40 ms 42852 KB Output is correct
51 Correct 108 ms 47496 KB Output is correct
52 Correct 100 ms 47516 KB Output is correct
53 Correct 50 ms 42708 KB Output is correct
54 Correct 47 ms 23952 KB Output is correct
55 Correct 14 ms 23952 KB Output is correct
56 Correct 21 ms 25172 KB Output is correct
57 Correct 41 ms 24148 KB Output is correct
58 Incorrect 18 ms 24628 KB Output isn't correct
59 Halted 0 ms 0 KB -