oj.uz

Submission #709914

# Submission time Handle Problem Language Result Execution time Memory
709914 2023-03-14T19:30:31 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 246468 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];
vector<short> sm[MAXN];
vector<short> bg[MAXN];

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);
            bg[d[i].first].push_back(d[i].second);
        }
        else
        {
            sm[d[i].first].push_back(d[i].second);
        }
    }
    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& mv : bg[pos])
        {
            for (int j = pos, k = 0; j < n; j += mv, k++)
            {
                if (dist[j][0] > dst + k)
                {
                    dist[j][0] = dst + k;
                    st.push({-dist[j][0], j, 0});
                }
            }
            for (int j = pos, k = 0; j >= 0; j -= mv, k++)
            {
                if (dist[j][0] > dst + k)
                {
                    dist[j][0] = dst + k;
                    st.push({-dist[j][0], j, 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.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:50: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]
   50 |         g[d[i].first][0].push_back({d[i].first, d[i].second, 0});
skyscraper.cpp:50: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]
   50 |         g[d[i].first][0].push_back({d[i].first, d[i].second, 0});

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 209556 KB Output is correct
2 Correct 94 ms 209576 KB Output is correct
3 Correct 93 ms 209568 KB Output is correct
4 Correct 94 ms 209496 KB Output is correct
5 Correct 93 ms 209524 KB Output is correct
6 Correct 100 ms 209552 KB Output is correct
7 Correct 93 ms 209484 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 209532 KB Output is correct
2 Correct 102 ms 209576 KB Output is correct
3 Correct 93 ms 209484 KB Output is correct
4 Correct 114 ms 209708 KB Output is correct
5 Correct 93 ms 209536 KB Output is correct
6 Correct 98 ms 209540 KB Output is correct
7 Correct 95 ms 209464 KB Output is correct
8 Correct 94 ms 209520 KB Output is correct
9 Correct 95 ms 209684 KB Output is correct
10 Correct 98 ms 209684 KB Output is correct
11 Correct 97 ms 209848 KB Output is correct
12 Correct 104 ms 209740 KB Output is correct
13 Correct 102 ms 209740 KB Output is correct
14 Correct 101 ms 209860 KB Output is correct
15 Correct 94 ms 209724 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 209576 KB Output is correct
2 Correct 95 ms 209548 KB Output is correct
3 Correct 94 ms 209472 KB Output is correct
4 Correct 97 ms 209540 KB Output is correct
5 Correct 98 ms 209564 KB Output is correct
6 Correct 96 ms 209580 KB Output is correct
7 Correct 93 ms 209552 KB Output is correct
8 Correct 94 ms 209540 KB Output is correct
9 Correct 95 ms 209696 KB Output is correct
10 Correct 101 ms 209612 KB Output is correct
11 Correct 94 ms 209784 KB Output is correct
12 Correct 95 ms 209740 KB Output is correct
13 Correct 94 ms 209684 KB Output is correct
14 Correct 102 ms 209740 KB Output is correct
15 Correct 96 ms 209740 KB Output is correct
16 Correct 95 ms 209820 KB Output is correct
17 Correct 106 ms 210544 KB Output is correct
18 Correct 108 ms 211636 KB Output is correct
19 Correct 100 ms 211800 KB Output is correct
20 Correct 94 ms 212032 KB Output is correct
21 Correct 95 ms 210064 KB Output is correct
22 Correct 100 ms 211640 KB Output is correct
23 Correct 99 ms 211428 KB Output is correct
24 Correct 97 ms 211916 KB Output is correct
25 Correct 95 ms 211916 KB Output is correct
26 Correct 97 ms 211848 KB Output is correct
27 Correct 99 ms 211900 KB Output is correct
28 Correct 97 ms 211892 KB Output is correct
29 Correct 115 ms 211920 KB Output is correct
30 Correct 97 ms 211852 KB Output is correct
31 Correct 97 ms 211852 KB Output is correct
32 Correct 96 ms 211840 KB Output is correct
33 Correct 108 ms 212012 KB Output is correct
34 Correct 117 ms 212108 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 209576 KB Output is correct
2 Correct 99 ms 209456 KB Output is correct
3 Correct 96 ms 209576 KB Output is correct
4 Correct 104 ms 209580 KB Output is correct
5 Correct 97 ms 209500 KB Output is correct
6 Correct 94 ms 209544 KB Output is correct
7 Correct 113 ms 209476 KB Output is correct
8 Correct 97 ms 209616 KB Output is correct
9 Correct 98 ms 209644 KB Output is correct
10 Correct 111 ms 209592 KB Output is correct
11 Correct 114 ms 209788 KB Output is correct
12 Correct 96 ms 209804 KB Output is correct
13 Correct 98 ms 209788 KB Output is correct
14 Correct 99 ms 209764 KB Output is correct
15 Correct 101 ms 209688 KB Output is correct
16 Correct 95 ms 209780 KB Output is correct
17 Correct 98 ms 210548 KB Output is correct
18 Correct 96 ms 211532 KB Output is correct
19 Correct 98 ms 211884 KB Output is correct
20 Correct 105 ms 211956 KB Output is correct
21 Correct 94 ms 210008 KB Output is correct
22 Correct 94 ms 211640 KB Output is correct
23 Correct 98 ms 211420 KB Output is correct
24 Correct 107 ms 211852 KB Output is correct
25 Correct 101 ms 211880 KB Output is correct
26 Correct 96 ms 211892 KB Output is correct
27 Correct 96 ms 211916 KB Output is correct
28 Correct 98 ms 211940 KB Output is correct
29 Correct 105 ms 211928 KB Output is correct
30 Correct 100 ms 211900 KB Output is correct
31 Correct 98 ms 211916 KB Output is correct
32 Correct 97 ms 211872 KB Output is correct
33 Correct 107 ms 212072 KB Output is correct
34 Correct 107 ms 211956 KB Output is correct
35 Correct 113 ms 211820 KB Output is correct
36 Correct 97 ms 211092 KB Output is correct
37 Correct 119 ms 212500 KB Output is correct
38 Correct 121 ms 212584 KB Output is correct
39 Correct 121 ms 212600 KB Output is correct
40 Correct 114 ms 212652 KB Output is correct
41 Correct 118 ms 212644 KB Output is correct
42 Correct 108 ms 212496 KB Output is correct
43 Correct 98 ms 212592 KB Output is correct
44 Correct 101 ms 212580 KB Output is correct
45 Correct 171 ms 212988 KB Output is correct
46 Correct 174 ms 213004 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 209484 KB Output is correct
2 Correct 100 ms 209584 KB Output is correct
3 Correct 92 ms 209488 KB Output is correct
4 Correct 94 ms 209620 KB Output is correct
5 Correct 93 ms 209544 KB Output is correct
6 Correct 95 ms 209484 KB Output is correct
7 Correct 101 ms 209568 KB Output is correct
8 Correct 96 ms 209616 KB Output is correct
9 Correct 98 ms 209604 KB Output is correct
10 Correct 102 ms 209700 KB Output is correct
11 Correct 99 ms 209704 KB Output is correct
12 Correct 94 ms 209784 KB Output is correct
13 Correct 94 ms 209624 KB Output is correct
14 Correct 95 ms 209796 KB Output is correct
15 Correct 95 ms 209784 KB Output is correct
16 Correct 94 ms 209740 KB Output is correct
17 Correct 99 ms 210544 KB Output is correct
18 Correct 97 ms 211644 KB Output is correct
19 Correct 97 ms 211912 KB Output is correct
20 Correct 96 ms 211916 KB Output is correct
21 Correct 95 ms 209988 KB Output is correct
22 Correct 95 ms 211656 KB Output is correct
23 Correct 101 ms 211448 KB Output is correct
24 Correct 103 ms 211784 KB Output is correct
25 Correct 100 ms 211876 KB Output is correct
26 Correct 97 ms 212032 KB Output is correct
27 Correct 96 ms 211848 KB Output is correct
28 Correct 98 ms 211916 KB Output is correct
29 Correct 108 ms 211916 KB Output is correct
30 Correct 99 ms 211900 KB Output is correct
31 Correct 100 ms 211864 KB Output is correct
32 Correct 104 ms 212052 KB Output is correct
33 Correct 115 ms 212016 KB Output is correct
34 Correct 117 ms 211916 KB Output is correct
35 Correct 110 ms 211796 KB Output is correct
36 Correct 104 ms 210968 KB Output is correct
37 Correct 125 ms 212584 KB Output is correct
38 Correct 115 ms 212636 KB Output is correct
39 Correct 117 ms 212720 KB Output is correct
40 Correct 119 ms 212556 KB Output is correct
41 Correct 121 ms 212536 KB Output is correct
42 Correct 108 ms 212516 KB Output is correct
43 Correct 106 ms 212528 KB Output is correct
44 Correct 105 ms 212556 KB Output is correct
45 Correct 175 ms 213008 KB Output is correct
46 Correct 178 ms 213012 KB Output is correct
47 Correct 187 ms 225012 KB Output is correct
48 Correct 112 ms 237000 KB Output is correct
49 Correct 124 ms 239576 KB Output is correct
50 Correct 112 ms 242256 KB Output is correct
51 Correct 152 ms 245684 KB Output is correct
52 Correct 171 ms 245752 KB Output is correct
53 Correct 126 ms 245048 KB Output is correct
54 Correct 114 ms 244148 KB Output is correct
55 Correct 111 ms 244204 KB Output is correct
56 Correct 129 ms 246220 KB Output is correct
57 Correct 183 ms 244308 KB Output is correct
58 Correct 121 ms 244856 KB Output is correct
59 Correct 121 ms 244828 KB Output is correct
60 Correct 125 ms 244844 KB Output is correct
61 Correct 128 ms 244896 KB Output is correct
62 Correct 152 ms 245512 KB Output is correct
63 Correct 322 ms 245636 KB Output is correct
64 Correct 354 ms 245604 KB Output is correct
65 Correct 754 ms 246468 KB Output is correct
66 Execution timed out 1096 ms 245320 KB Time limit exceeded
67 Halted 0 ms 0 KB -