oj.uz

Submission #709893

# Submission time Handle Problem Language Result Execution time Memory
709893 2023-03-14T18:39:39 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 659 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 = 140;
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;
        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:51:38: warning: narrowing conversion of '(i - j)' from 'int' to 'short int' [-Wnarrowing]
   51 |                 g[i][j].push_back({i - j, 0, 1});
      |                                    ~~^~~
skyscraper.cpp:52:38: warning: narrowing conversion of '(i - j)' from 'int' to 'short int' [-Wnarrowing]
   52 |                 g[i][j].push_back({i - j, j, 1});
      |                                    ~~^~~
skyscraper.cpp:52:43: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   52 |                 g[i][j].push_back({i - j, j, 1});
      |                                           ^
skyscraper.cpp:56:38: warning: narrowing conversion of '(i + j)' from 'int' to 'short int' [-Wnarrowing]
   56 |                 g[i][j].push_back({i + j, 0, 1});
      |                                    ~~^~~
skyscraper.cpp:57:38: warning: narrowing conversion of '(i + j)' from 'int' to 'short int' [-Wnarrowing]
   57 |                 g[i][j].push_back({i + j, j, 1});
      |                                    ~~^~~
skyscraper.cpp:57:43: warning: narrowing conversion of 'j' from 'int' to 'short int' [-Wnarrowing]
   57 |                 g[i][j].push_back({i + j, j, 1});
      |                                           ^
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 49 ms 99028 KB Output is correct
2 Correct 49 ms 98956 KB Output is correct
3 Correct 49 ms 98944 KB Output is correct
4 Correct 48 ms 98936 KB Output is correct
5 Correct 49 ms 98856 KB Output is correct
6 Correct 51 ms 98940 KB Output is correct
7 Correct 55 ms 98884 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 98892 KB Output is correct
2 Correct 50 ms 98948 KB Output is correct
3 Correct 51 ms 99076 KB Output is correct
4 Correct 50 ms 98880 KB Output is correct
5 Correct 54 ms 98884 KB Output is correct
6 Correct 50 ms 98892 KB Output is correct
7 Correct 51 ms 98948 KB Output is correct
8 Correct 52 ms 98888 KB Output is correct
9 Correct 51 ms 98984 KB Output is correct
10 Correct 53 ms 99272 KB Output is correct
11 Correct 54 ms 99292 KB Output is correct
12 Correct 52 ms 99188 KB Output is correct
13 Correct 51 ms 99236 KB Output is correct
14 Correct 56 ms 99320 KB Output is correct
15 Correct 53 ms 99316 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 99060 KB Output is correct
2 Correct 52 ms 98892 KB Output is correct
3 Correct 50 ms 98892 KB Output is correct
4 Correct 52 ms 98952 KB Output is correct
5 Correct 50 ms 98848 KB Output is correct
6 Correct 55 ms 98952 KB Output is correct
7 Correct 50 ms 98892 KB Output is correct
8 Correct 51 ms 98936 KB Output is correct
9 Correct 52 ms 99020 KB Output is correct
10 Correct 51 ms 99244 KB Output is correct
11 Correct 53 ms 99276 KB Output is correct
12 Correct 51 ms 99288 KB Output is correct
13 Correct 52 ms 99228 KB Output is correct
14 Correct 57 ms 99380 KB Output is correct
15 Correct 52 ms 99524 KB Output is correct
16 Correct 53 ms 99996 KB Output is correct
17 Correct 64 ms 102732 KB Output is correct
18 Correct 74 ms 107484 KB Output is correct
19 Correct 80 ms 108700 KB Output is correct
20 Correct 83 ms 108808 KB Output is correct
21 Correct 61 ms 100888 KB Output is correct
22 Correct 75 ms 107616 KB Output is correct
23 Correct 81 ms 106804 KB Output is correct
24 Correct 77 ms 108316 KB Output is correct
25 Correct 77 ms 108828 KB Output is correct
26 Correct 77 ms 108896 KB Output is correct
27 Correct 78 ms 108868 KB Output is correct
28 Correct 89 ms 108896 KB Output is correct
29 Correct 93 ms 108748 KB Output is correct
30 Correct 82 ms 108724 KB Output is correct
31 Correct 86 ms 108756 KB Output is correct
32 Correct 85 ms 108692 KB Output is correct
33 Correct 122 ms 109132 KB Output is correct
34 Correct 108 ms 108888 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 98908 KB Output is correct
2 Correct 47 ms 98900 KB Output is correct
3 Correct 47 ms 98952 KB Output is correct
4 Correct 49 ms 98836 KB Output is correct
5 Correct 54 ms 98948 KB Output is correct
6 Correct 47 ms 98892 KB Output is correct
7 Correct 48 ms 98892 KB Output is correct
8 Correct 49 ms 98924 KB Output is correct
9 Correct 49 ms 98976 KB Output is correct
10 Correct 50 ms 99264 KB Output is correct
11 Correct 52 ms 99268 KB Output is correct
12 Correct 49 ms 99248 KB Output is correct
13 Correct 50 ms 99184 KB Output is correct
14 Correct 49 ms 99392 KB Output is correct
15 Correct 55 ms 99392 KB Output is correct
16 Correct 50 ms 99900 KB Output is correct
17 Correct 60 ms 102744 KB Output is correct
18 Correct 75 ms 107484 KB Output is correct
19 Correct 76 ms 108732 KB Output is correct
20 Correct 80 ms 108876 KB Output is correct
21 Correct 56 ms 100872 KB Output is correct
22 Correct 75 ms 107724 KB Output is correct
23 Correct 73 ms 106860 KB Output is correct
24 Correct 80 ms 108364 KB Output is correct
25 Correct 91 ms 108824 KB Output is correct
26 Correct 79 ms 108892 KB Output is correct
27 Correct 78 ms 108772 KB Output is correct
28 Correct 80 ms 108820 KB Output is correct
29 Correct 90 ms 108772 KB Output is correct
30 Correct 86 ms 108780 KB Output is correct
31 Correct 86 ms 108776 KB Output is correct
32 Correct 82 ms 108716 KB Output is correct
33 Correct 105 ms 108928 KB Output is correct
34 Correct 104 ms 108916 KB Output is correct
35 Correct 95 ms 107320 KB Output is correct
36 Correct 72 ms 104524 KB Output is correct
37 Correct 117 ms 109980 KB Output is correct
38 Correct 115 ms 110552 KB Output is correct
39 Correct 116 ms 110600 KB Output is correct
40 Correct 120 ms 110564 KB Output is correct
41 Correct 115 ms 110660 KB Output is correct
42 Correct 82 ms 109324 KB Output is correct
43 Correct 83 ms 109328 KB Output is correct
44 Correct 82 ms 109384 KB Output is correct
45 Correct 159 ms 112240 KB Output is correct
46 Correct 154 ms 112084 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 98892 KB Output is correct
2 Correct 47 ms 98876 KB Output is correct
3 Correct 56 ms 98944 KB Output is correct
4 Correct 50 ms 98868 KB Output is correct
5 Correct 49 ms 98892 KB Output is correct
6 Correct 49 ms 98928 KB Output is correct
7 Correct 48 ms 98924 KB Output is correct
8 Correct 48 ms 98884 KB Output is correct
9 Correct 52 ms 98952 KB Output is correct
10 Correct 50 ms 99148 KB Output is correct
11 Correct 50 ms 99296 KB Output is correct
12 Correct 53 ms 99192 KB Output is correct
13 Correct 50 ms 99276 KB Output is correct
14 Correct 56 ms 99404 KB Output is correct
15 Correct 50 ms 99288 KB Output is correct
16 Correct 53 ms 99844 KB Output is correct
17 Correct 62 ms 102684 KB Output is correct
18 Correct 77 ms 107460 KB Output is correct
19 Correct 83 ms 108780 KB Output is correct
20 Correct 76 ms 108848 KB Output is correct
21 Correct 57 ms 100812 KB Output is correct
22 Correct 79 ms 107632 KB Output is correct
23 Correct 72 ms 106784 KB Output is correct
24 Correct 80 ms 108464 KB Output is correct
25 Correct 81 ms 108792 KB Output is correct
26 Correct 77 ms 108708 KB Output is correct
27 Correct 77 ms 108808 KB Output is correct
28 Correct 81 ms 108876 KB Output is correct
29 Correct 92 ms 108812 KB Output is correct
30 Correct 81 ms 108876 KB Output is correct
31 Correct 88 ms 108800 KB Output is correct
32 Correct 83 ms 108772 KB Output is correct
33 Correct 112 ms 108876 KB Output is correct
34 Correct 114 ms 108924 KB Output is correct
35 Correct 99 ms 107140 KB Output is correct
36 Correct 68 ms 104504 KB Output is correct
37 Correct 117 ms 109772 KB Output is correct
38 Correct 115 ms 110296 KB Output is correct
39 Correct 116 ms 110288 KB Output is correct
40 Correct 126 ms 110244 KB Output is correct
41 Correct 122 ms 110304 KB Output is correct
42 Correct 82 ms 109068 KB Output is correct
43 Correct 80 ms 109116 KB Output is correct
44 Correct 81 ms 109240 KB Output is correct
45 Correct 157 ms 111868 KB Output is correct
46 Correct 162 ms 112056 KB Output is correct
47 Correct 431 ms 163736 KB Output is correct
48 Correct 380 ms 214220 KB Output is correct
49 Correct 400 ms 224632 KB Output is correct
50 Correct 498 ms 237012 KB Output is correct
51 Correct 559 ms 249296 KB Output is correct
52 Correct 580 ms 249356 KB Output is correct
53 Correct 491 ms 247536 KB Output is correct
54 Correct 471 ms 245880 KB Output is correct
55 Correct 480 ms 246064 KB Output is correct
56 Correct 494 ms 247244 KB Output is correct
57 Correct 659 ms 246024 KB Output is correct
58 Correct 484 ms 246628 KB Output is correct
59 Correct 496 ms 246672 KB Output is correct
60 Correct 545 ms 246864 KB Output is correct
61 Correct 492 ms 246840 KB Output is correct
62 Correct 566 ms 249316 KB Output is correct
63 Runtime error 446 ms 262144 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -