oj.uz

Submission #709909

# Submission time Handle Problem Language Result Execution time Memory
709909 2023-03-14T19:10:06 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 377 ms 262144 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;

const int INF = 1e9;
const int B = 300;
const int MAXN = 3e4 + 5;

vector<pair<int, int> > d;

int dist[MAXN][B];
vector<array<short, 3> > g[MAXN][B];

signed main()
{
    //ifstream cin("input.txt");
    //ofstream cout("output.txt");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    d.resize(m);
    vector<int> big;
    for (int i = 0; i < m; i++)
    {
        cin >> d[i].first >> d[i].second;
        if (d[i].second >= B)
        {
            big.push_back(i);
        }
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < B; j++)
            dist[i][j] = INF;
    for (int i = 0; i < m; i++)
    {
        if (d[i].second >= B) continue;
        g[d[i].first][0].push_back({d[i].first, d[i].second, 0});
    }
//    for (int i = 0; i < n; i++)
//    {
//        for (int j = 1; j < B; j++)
//        {
//            if (i - j >= 0)
//            {
//                g[i][j].push_back({i - j, 0, 1});
//                g[i][j].push_back({i - j, j, 1});
//            }
//            if (i + j < n)
//            {
//                g[i][j].push_back({i + j, 0, 1});
//                g[i][j].push_back({i + j, j, 1});
//            }
//        }
//    }
    for (auto& i : big)
    {
        for (int j = d[i].first, k = 0; j < n; j += d[i].second, k++)
        {
            g[d[i].first][0].push_back({j, 0, k});
        }
        for (int j = d[i].first, k = 0; j >= 0; j -= d[i].second,  k++)
        {
            g[d[i].first][0].push_back({j, 0, k});
        }
    }
    set<array<int, 3> > st;
    st.insert({0, d[0].first, 0});
    dist[d[0].first][0] = 0;
    while (!st.empty())
    {
        auto [dst, pos, pw] = *st.begin();
        st.erase(st.begin());
        if (dst > dist[pos][pw]) continue;
        if (pw > 0)
        {
            vector<array<short, 3> > to;
            if (pos - pw >= 0)
            {
                if (dist[pos - pw][pw] > dst + 1)
                {
                    st.erase({dist[pos - pw][pw], pos - pw, pw});
                    dist[pos - pw][pw] = dst + 1;
                    st.insert({dist[pos - pw][pw], pos - pw, pw});
                }
                if (dist[pos - pw][0] > dst + 1)
                {
                    st.erase({dist[pos - pw][0], pos - pw, 0});
                    dist[pos - pw][0] = dst + 1;
                    st.insert({dist[pos - pw][0], pos - pw, 0});
                }
            }
            if (pos + pw < n)
            {
                if (dist[pos + pw][pw] > dst + 1)
                {
                    st.erase({dist[pos + pw][pw], pos + pw, pw});
                    dist[pos + pw][pw] = dst + 1;
                    st.insert({dist[pos + pw][pw], pos + pw, pw});
                }
                if (dist[pos + pw][0] > dst + 1)
                {
                    st.erase({dist[pos + pw][0], pos + pw, 0});
                    dist[pos + pw][0] = dst + 1;
                    st.insert({dist[pos + pw][0], pos + pw, 0});
                }
            }
        }
        for (auto& [psu, pwu, w] : g[pos][pw])
        {
            if (dist[psu][pwu] > dst + w)
            {
                st.erase({dist[psu][pwu], psu, pwu});
                dist[psu][pwu] = dst + w;
                st.insert({dist[psu][pwu], psu, pwu});
            }
        }
    }
    int mn = INF;
    for (int i = 0; i < B; i++)
        mn = min(mn, dist[d[1].first][i]);
    if (mn == INF)
        cout << -1;
    else
        cout << mn;
    return 0;
}
/*
small
(i, j) -1> (i - j, 0), (i + j, 0)
(i, 0) -0> (i, j)
(i, j) -1> (i - j, j), (i + j, j)
large
(i, 0) -1> (i + j, 0)
(i, 0) -1> (i - j, 0)
*/

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:43:42: warning: narrowing conversion of 'd.std::vector<std::pair<int, int> >::operator[](((std::vector<std::pair<int, int> >::size_type)i)).std::pair<int, int>::first' from 'int' to 'short int' [-Wnarrowing]
   43 |         g[d[i].first][0].push_back({d[i].first, d[i].second, 0});
skyscraper.cpp:43:54: warning: narrowing conversion of 'd.std::vector<std::pair<int, int> >::operator[](((std::vector<std::pair<int, int> >::size_type)i)).std::pair<int, int>::second' from 'int' to 'short int' [-Wnarrowing]
   43 |         g[d[i].first][0].push_back({d[i].first, d[i].second, 0});
skyscraper.cpp:65:41: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   65 |             g[d[i].first][0].push_back({j, 0, k});
      |                                         ^
skyscraper.cpp:65:47: warning: narrowing conversion of 'k' from 'int' to 'short int' [-Wnarrowing]
   65 |             g[d[i].first][0].push_back({j, 0, k});
      |                                               ^
skyscraper.cpp:69:41: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   69 |             g[d[i].first][0].push_back({j, 0, k});
      |                                         ^
skyscraper.cpp:69:47: warning: narrowing conversion of 'k' from 'int' to 'short int' [-Wnarrowing]
   69 |             g[d[i].first][0].push_back({j, 0, k});
      |                                               ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 211788 KB Output is correct
2 Correct 123 ms 211592 KB Output is correct
3 Correct 120 ms 211720 KB Output is correct
4 Correct 106 ms 211584 KB Output is correct
5 Correct 105 ms 211696 KB Output is correct
6 Correct 103 ms 211704 KB Output is correct
7 Correct 117 ms 211616 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 211696 KB Output is correct
2 Correct 103 ms 211580 KB Output is correct
3 Correct 105 ms 211700 KB Output is correct
4 Correct 104 ms 211696 KB Output is correct
5 Correct 105 ms 211680 KB Output is correct
6 Correct 114 ms 211708 KB Output is correct
7 Correct 107 ms 211700 KB Output is correct
8 Correct 110 ms 211640 KB Output is correct
9 Correct 106 ms 211652 KB Output is correct
10 Correct 110 ms 211784 KB Output is correct
11 Correct 106 ms 211820 KB Output is correct
12 Correct 103 ms 211772 KB Output is correct
13 Correct 102 ms 211920 KB Output is correct
14 Correct 111 ms 211960 KB Output is correct
15 Correct 111 ms 211948 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 211580 KB Output is correct
2 Correct 110 ms 211680 KB Output is correct
3 Correct 114 ms 211604 KB Output is correct
4 Correct 102 ms 211700 KB Output is correct
5 Correct 109 ms 211744 KB Output is correct
6 Correct 113 ms 211680 KB Output is correct
7 Correct 111 ms 211596 KB Output is correct
8 Correct 121 ms 211736 KB Output is correct
9 Correct 111 ms 211764 KB Output is correct
10 Correct 105 ms 211784 KB Output is correct
11 Correct 105 ms 211860 KB Output is correct
12 Correct 104 ms 211820 KB Output is correct
13 Correct 111 ms 211916 KB Output is correct
14 Correct 125 ms 211996 KB Output is correct
15 Correct 116 ms 211916 KB Output is correct
16 Correct 112 ms 211948 KB Output is correct
17 Correct 113 ms 212640 KB Output is correct
18 Correct 114 ms 213788 KB Output is correct
19 Correct 113 ms 214164 KB Output is correct
20 Correct 121 ms 214016 KB Output is correct
21 Correct 110 ms 212200 KB Output is correct
22 Correct 105 ms 213724 KB Output is correct
23 Correct 118 ms 213580 KB Output is correct
24 Correct 113 ms 214000 KB Output is correct
25 Correct 111 ms 214056 KB Output is correct
26 Correct 106 ms 214000 KB Output is correct
27 Correct 112 ms 214104 KB Output is correct
28 Correct 111 ms 214144 KB Output is correct
29 Correct 124 ms 214060 KB Output is correct
30 Correct 130 ms 213944 KB Output is correct
31 Correct 126 ms 214084 KB Output is correct
32 Correct 128 ms 213996 KB Output is correct
33 Correct 147 ms 214204 KB Output is correct
34 Correct 135 ms 214164 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 211692 KB Output is correct
2 Correct 106 ms 211592 KB Output is correct
3 Correct 111 ms 211680 KB Output is correct
4 Correct 115 ms 211664 KB Output is correct
5 Correct 114 ms 211576 KB Output is correct
6 Correct 102 ms 211692 KB Output is correct
7 Correct 120 ms 211620 KB Output is correct
8 Correct 116 ms 211620 KB Output is correct
9 Correct 112 ms 211736 KB Output is correct
10 Correct 107 ms 211828 KB Output is correct
11 Correct 125 ms 211796 KB Output is correct
12 Correct 110 ms 211808 KB Output is correct
13 Correct 109 ms 211748 KB Output is correct
14 Correct 117 ms 211912 KB Output is correct
15 Correct 104 ms 211852 KB Output is correct
16 Correct 104 ms 211840 KB Output is correct
17 Correct 109 ms 212640 KB Output is correct
18 Correct 105 ms 213752 KB Output is correct
19 Correct 118 ms 213980 KB Output is correct
20 Correct 104 ms 214124 KB Output is correct
21 Correct 109 ms 212172 KB Output is correct
22 Correct 96 ms 213816 KB Output is correct
23 Correct 103 ms 213620 KB Output is correct
24 Correct 107 ms 214020 KB Output is correct
25 Correct 102 ms 214088 KB Output is correct
26 Correct 106 ms 214040 KB Output is correct
27 Correct 118 ms 214004 KB Output is correct
28 Correct 106 ms 214232 KB Output is correct
29 Correct 114 ms 213984 KB Output is correct
30 Correct 102 ms 213996 KB Output is correct
31 Correct 110 ms 214056 KB Output is correct
32 Correct 103 ms 214084 KB Output is correct
33 Correct 123 ms 214208 KB Output is correct
34 Correct 127 ms 214104 KB Output is correct
35 Correct 129 ms 214508 KB Output is correct
36 Correct 105 ms 213172 KB Output is correct
37 Correct 161 ms 215372 KB Output is correct
38 Correct 140 ms 215540 KB Output is correct
39 Correct 141 ms 215628 KB Output is correct
40 Correct 134 ms 215632 KB Output is correct
41 Correct 134 ms 215652 KB Output is correct
42 Correct 104 ms 214540 KB Output is correct
43 Correct 104 ms 214604 KB Output is correct
44 Correct 104 ms 214596 KB Output is correct
45 Correct 220 ms 216464 KB Output is correct
46 Correct 224 ms 216380 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 211624 KB Output is correct
2 Correct 106 ms 211688 KB Output is correct
3 Correct 96 ms 211620 KB Output is correct
4 Correct 101 ms 211660 KB Output is correct
5 Correct 97 ms 211608 KB Output is correct
6 Correct 102 ms 211688 KB Output is correct
7 Correct 96 ms 211652 KB Output is correct
8 Correct 95 ms 211640 KB Output is correct
9 Correct 97 ms 211652 KB Output is correct
10 Correct 97 ms 211780 KB Output is correct
11 Correct 100 ms 211792 KB Output is correct
12 Correct 109 ms 211808 KB Output is correct
13 Correct 96 ms 211788 KB Output is correct
14 Correct 101 ms 211960 KB Output is correct
15 Correct 103 ms 211948 KB Output is correct
16 Correct 97 ms 211916 KB Output is correct
17 Correct 108 ms 212620 KB Output is correct
18 Correct 97 ms 213776 KB Output is correct
19 Correct 101 ms 213980 KB Output is correct
20 Correct 106 ms 214016 KB Output is correct
21 Correct 95 ms 212196 KB Output is correct
22 Correct 100 ms 213820 KB Output is correct
23 Correct 98 ms 213596 KB Output is correct
24 Correct 100 ms 214044 KB Output is correct
25 Correct 107 ms 214092 KB Output is correct
26 Correct 105 ms 213972 KB Output is correct
27 Correct 98 ms 214000 KB Output is correct
28 Correct 101 ms 214092 KB Output is correct
29 Correct 123 ms 214060 KB Output is correct
30 Correct 105 ms 213980 KB Output is correct
31 Correct 103 ms 213984 KB Output is correct
32 Correct 105 ms 214088 KB Output is correct
33 Correct 120 ms 214152 KB Output is correct
34 Correct 120 ms 214120 KB Output is correct
35 Correct 123 ms 214672 KB Output is correct
36 Correct 103 ms 213188 KB Output is correct
37 Correct 145 ms 215452 KB Output is correct
38 Correct 134 ms 215616 KB Output is correct
39 Correct 136 ms 215588 KB Output is correct
40 Correct 135 ms 215576 KB Output is correct
41 Correct 138 ms 215636 KB Output is correct
42 Correct 101 ms 214608 KB Output is correct
43 Correct 110 ms 214684 KB Output is correct
44 Correct 108 ms 214612 KB Output is correct
45 Correct 244 ms 216392 KB Output is correct
46 Correct 226 ms 216364 KB Output is correct
47 Correct 268 ms 229712 KB Output is correct
48 Correct 118 ms 240352 KB Output is correct
49 Correct 122 ms 242724 KB Output is correct
50 Correct 121 ms 245452 KB Output is correct
51 Correct 198 ms 249668 KB Output is correct
52 Correct 197 ms 249588 KB Output is correct
53 Correct 132 ms 247980 KB Output is correct
54 Correct 122 ms 246816 KB Output is correct
55 Correct 126 ms 247000 KB Output is correct
56 Correct 128 ms 248096 KB Output is correct
57 Correct 244 ms 246988 KB Output is correct
58 Correct 131 ms 247436 KB Output is correct
59 Correct 130 ms 247540 KB Output is correct
60 Correct 138 ms 247488 KB Output is correct
61 Correct 141 ms 247468 KB Output is correct
62 Correct 179 ms 249496 KB Output is correct
63 Correct 377 ms 261616 KB Output is correct
64 Runtime error 131 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -