oj.uz

Submission #709912

# Submission time Handle Problem Language Result Execution time Memory
709912 2023-03-14T19:21:56 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 259820 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 = 295;
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 (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});
        }
    }
    priority_queue<array<int, 3> > st;
    st.push({0, d[0].first, 0});
    dist[d[0].first][0] = 0;
    while (!st.empty())
    {
        auto [dst, pos, pw] = st.top();
        dst = -dst;
        st.pop();
        if (dst > dist[pos][pw]) continue;
        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.push({-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.push({-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.push({-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.push({-dist[pos + pw][0], pos + pw, 0});
                }
            }
            continue;
        }
        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.push({-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:49:41: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   49 |             g[d[i].first][0].push_back({j, 0, k});
      |                                         ^
skyscraper.cpp:49:47: warning: narrowing conversion of 'k' from 'int' to 'short int' [-Wnarrowing]
   49 |             g[d[i].first][0].push_back({j, 0, k});
      |                                               ^
skyscraper.cpp:53:41: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   53 |             g[d[i].first][0].push_back({j, 0, k});
      |                                         ^
skyscraper.cpp:53:47: warning: narrowing conversion of 'k' from 'int' to 'short int' [-Wnarrowing]
   53 |             g[d[i].first][0].push_back({j, 0, k});
      |                                               ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 208124 KB Output is correct
2 Correct 94 ms 208052 KB Output is correct
3 Correct 94 ms 208152 KB Output is correct
4 Correct 95 ms 208264 KB Output is correct
5 Correct 96 ms 208264 KB Output is correct
6 Correct 97 ms 208072 KB Output is correct
7 Correct 96 ms 208068 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 208164 KB Output is correct
2 Correct 93 ms 208068 KB Output is correct
3 Correct 107 ms 208208 KB Output is correct
4 Correct 96 ms 208152 KB Output is correct
5 Correct 92 ms 208164 KB Output is correct
6 Correct 97 ms 208080 KB Output is correct
7 Correct 113 ms 208164 KB Output is correct
8 Correct 101 ms 208204 KB Output is correct
9 Correct 99 ms 208224 KB Output is correct
10 Correct 97 ms 208264 KB Output is correct
11 Correct 98 ms 208396 KB Output is correct
12 Correct 94 ms 208240 KB Output is correct
13 Correct 95 ms 208312 KB Output is correct
14 Correct 97 ms 208288 KB Output is correct
15 Correct 93 ms 208336 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 208112 KB Output is correct
2 Correct 95 ms 208192 KB Output is correct
3 Correct 95 ms 208168 KB Output is correct
4 Correct 93 ms 208068 KB Output is correct
5 Correct 94 ms 208092 KB Output is correct
6 Correct 95 ms 208304 KB Output is correct
7 Correct 97 ms 208120 KB Output is correct
8 Correct 95 ms 208116 KB Output is correct
9 Correct 95 ms 208180 KB Output is correct
10 Correct 94 ms 208292 KB Output is correct
11 Correct 96 ms 208328 KB Output is correct
12 Correct 97 ms 208464 KB Output is correct
13 Correct 96 ms 208232 KB Output is correct
14 Correct 92 ms 208352 KB Output is correct
15 Correct 97 ms 208332 KB Output is correct
16 Correct 96 ms 208288 KB Output is correct
17 Correct 96 ms 209036 KB Output is correct
18 Correct 96 ms 210208 KB Output is correct
19 Correct 98 ms 210484 KB Output is correct
20 Correct 97 ms 210508 KB Output is correct
21 Correct 98 ms 208568 KB Output is correct
22 Correct 96 ms 210208 KB Output is correct
23 Correct 96 ms 210104 KB Output is correct
24 Correct 97 ms 210380 KB Output is correct
25 Correct 99 ms 210560 KB Output is correct
26 Correct 97 ms 210516 KB Output is correct
27 Correct 99 ms 210424 KB Output is correct
28 Correct 97 ms 210480 KB Output is correct
29 Correct 104 ms 210472 KB Output is correct
30 Correct 98 ms 210388 KB Output is correct
31 Correct 98 ms 210528 KB Output is correct
32 Correct 96 ms 210508 KB Output is correct
33 Correct 112 ms 210600 KB Output is correct
34 Correct 118 ms 210472 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 208164 KB Output is correct
2 Correct 91 ms 208168 KB Output is correct
3 Correct 93 ms 208152 KB Output is correct
4 Correct 99 ms 208088 KB Output is correct
5 Correct 96 ms 208124 KB Output is correct
6 Correct 94 ms 208068 KB Output is correct
7 Correct 96 ms 208156 KB Output is correct
8 Correct 94 ms 208148 KB Output is correct
9 Correct 100 ms 208204 KB Output is correct
10 Correct 94 ms 208272 KB Output is correct
11 Correct 93 ms 208316 KB Output is correct
12 Correct 97 ms 208420 KB Output is correct
13 Correct 95 ms 208240 KB Output is correct
14 Correct 96 ms 208460 KB Output is correct
15 Correct 93 ms 208372 KB Output is correct
16 Correct 92 ms 208420 KB Output is correct
17 Correct 100 ms 209016 KB Output is correct
18 Correct 97 ms 210180 KB Output is correct
19 Correct 94 ms 210508 KB Output is correct
20 Correct 101 ms 210500 KB Output is correct
21 Correct 95 ms 208552 KB Output is correct
22 Correct 99 ms 210204 KB Output is correct
23 Correct 98 ms 210064 KB Output is correct
24 Correct 97 ms 210428 KB Output is correct
25 Correct 99 ms 210560 KB Output is correct
26 Correct 94 ms 210408 KB Output is correct
27 Correct 98 ms 210492 KB Output is correct
28 Correct 100 ms 210688 KB Output is correct
29 Correct 102 ms 210520 KB Output is correct
30 Correct 99 ms 210464 KB Output is correct
31 Correct 96 ms 210556 KB Output is correct
32 Correct 99 ms 210504 KB Output is correct
33 Correct 125 ms 210580 KB Output is correct
34 Correct 110 ms 210572 KB Output is correct
35 Correct 124 ms 210940 KB Output is correct
36 Correct 99 ms 209544 KB Output is correct
37 Correct 120 ms 211528 KB Output is correct
38 Correct 115 ms 211848 KB Output is correct
39 Correct 119 ms 211860 KB Output is correct
40 Correct 116 ms 211836 KB Output is correct
41 Correct 121 ms 211832 KB Output is correct
42 Correct 100 ms 210984 KB Output is correct
43 Correct 99 ms 211044 KB Output is correct
44 Correct 114 ms 211020 KB Output is correct
45 Correct 188 ms 211496 KB Output is correct
46 Correct 175 ms 211600 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 208240 KB Output is correct
2 Correct 98 ms 208128 KB Output is correct
3 Correct 97 ms 208120 KB Output is correct
4 Correct 95 ms 208072 KB Output is correct
5 Correct 92 ms 208076 KB Output is correct
6 Correct 92 ms 208168 KB Output is correct
7 Correct 95 ms 208076 KB Output is correct
8 Correct 95 ms 208132 KB Output is correct
9 Correct 94 ms 208128 KB Output is correct
10 Correct 95 ms 208280 KB Output is correct
11 Correct 95 ms 208288 KB Output is correct
12 Correct 101 ms 208300 KB Output is correct
13 Correct 96 ms 208332 KB Output is correct
14 Correct 95 ms 208300 KB Output is correct
15 Correct 94 ms 208256 KB Output is correct
16 Correct 109 ms 208348 KB Output is correct
17 Correct 97 ms 209040 KB Output is correct
18 Correct 99 ms 210112 KB Output is correct
19 Correct 100 ms 210380 KB Output is correct
20 Correct 102 ms 210460 KB Output is correct
21 Correct 100 ms 208644 KB Output is correct
22 Correct 96 ms 210252 KB Output is correct
23 Correct 96 ms 209988 KB Output is correct
24 Correct 97 ms 210380 KB Output is correct
25 Correct 100 ms 210468 KB Output is correct
26 Correct 101 ms 210400 KB Output is correct
27 Correct 95 ms 210528 KB Output is correct
28 Correct 98 ms 210572 KB Output is correct
29 Correct 105 ms 210440 KB Output is correct
30 Correct 97 ms 210380 KB Output is correct
31 Correct 98 ms 210508 KB Output is correct
32 Correct 98 ms 210444 KB Output is correct
33 Correct 113 ms 210496 KB Output is correct
34 Correct 120 ms 210600 KB Output is correct
35 Correct 110 ms 210940 KB Output is correct
36 Correct 109 ms 209612 KB Output is correct
37 Correct 115 ms 211528 KB Output is correct
38 Correct 119 ms 211916 KB Output is correct
39 Correct 124 ms 211884 KB Output is correct
40 Correct 117 ms 211908 KB Output is correct
41 Correct 126 ms 211784 KB Output is correct
42 Correct 106 ms 211016 KB Output is correct
43 Correct 103 ms 210984 KB Output is correct
44 Correct 99 ms 211024 KB Output is correct
45 Correct 169 ms 211568 KB Output is correct
46 Correct 171 ms 211524 KB Output is correct
47 Correct 201 ms 225748 KB Output is correct
48 Correct 115 ms 236456 KB Output is correct
49 Correct 124 ms 238716 KB Output is correct
50 Correct 114 ms 241356 KB Output is correct
51 Correct 163 ms 245340 KB Output is correct
52 Correct 170 ms 245240 KB Output is correct
53 Correct 148 ms 243920 KB Output is correct
54 Correct 118 ms 242680 KB Output is correct
55 Correct 112 ms 242808 KB Output is correct
56 Correct 125 ms 243988 KB Output is correct
57 Correct 187 ms 243020 KB Output is correct
58 Correct 117 ms 243340 KB Output is correct
59 Correct 124 ms 243320 KB Output is correct
60 Correct 124 ms 243340 KB Output is correct
61 Correct 123 ms 243324 KB Output is correct
62 Correct 154 ms 245340 KB Output is correct
63 Correct 251 ms 258788 KB Output is correct
64 Correct 364 ms 259820 KB Output is correct
65 Correct 812 ms 252692 KB Output is correct
66 Execution timed out 1088 ms 243840 KB Time limit exceeded
67 Halted 0 ms 0 KB -