oj.uz

Submission #709886

# Submission time Handle Problem Language Result Execution time Memory
709886 2023-03-14T18:36:23 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 209272 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 = 100;
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 33 ms 70740 KB Output is correct
2 Correct 32 ms 70724 KB Output is correct
3 Correct 33 ms 70772 KB Output is correct
4 Correct 37 ms 70760 KB Output is correct
5 Correct 35 ms 70740 KB Output is correct
6 Correct 36 ms 70740 KB Output is correct
7 Correct 38 ms 70728 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70764 KB Output is correct
2 Correct 33 ms 70724 KB Output is correct
3 Correct 36 ms 70700 KB Output is correct
4 Correct 34 ms 70740 KB Output is correct
5 Correct 33 ms 70732 KB Output is correct
6 Correct 39 ms 70648 KB Output is correct
7 Correct 36 ms 70716 KB Output is correct
8 Correct 36 ms 70752 KB Output is correct
9 Correct 35 ms 70832 KB Output is correct
10 Correct 35 ms 71016 KB Output is correct
11 Correct 35 ms 71132 KB Output is correct
12 Correct 34 ms 71032 KB Output is correct
13 Correct 37 ms 71008 KB Output is correct
14 Correct 38 ms 71124 KB Output is correct
15 Correct 37 ms 71116 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 70796 KB Output is correct
2 Correct 36 ms 70752 KB Output is correct
3 Correct 35 ms 70736 KB Output is correct
4 Correct 35 ms 70768 KB Output is correct
5 Correct 35 ms 70796 KB Output is correct
6 Correct 36 ms 70780 KB Output is correct
7 Correct 37 ms 70724 KB Output is correct
8 Correct 36 ms 70740 KB Output is correct
9 Correct 34 ms 70892 KB Output is correct
10 Correct 36 ms 71032 KB Output is correct
11 Correct 36 ms 71108 KB Output is correct
12 Correct 37 ms 71072 KB Output is correct
13 Correct 35 ms 70988 KB Output is correct
14 Correct 36 ms 71116 KB Output is correct
15 Correct 44 ms 71116 KB Output is correct
16 Correct 40 ms 71496 KB Output is correct
17 Correct 49 ms 73392 KB Output is correct
18 Correct 54 ms 76924 KB Output is correct
19 Correct 57 ms 77668 KB Output is correct
20 Correct 57 ms 77736 KB Output is correct
21 Correct 48 ms 72152 KB Output is correct
22 Correct 57 ms 77000 KB Output is correct
23 Correct 60 ms 76304 KB Output is correct
24 Correct 62 ms 77524 KB Output is correct
25 Correct 59 ms 77952 KB Output is correct
26 Correct 59 ms 77772 KB Output is correct
27 Correct 60 ms 77728 KB Output is correct
28 Correct 61 ms 77868 KB Output is correct
29 Correct 73 ms 77708 KB Output is correct
30 Correct 64 ms 77708 KB Output is correct
31 Correct 72 ms 77736 KB Output is correct
32 Correct 65 ms 77720 KB Output is correct
33 Correct 88 ms 77920 KB Output is correct
34 Correct 89 ms 78036 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 70728 KB Output is correct
2 Correct 39 ms 70696 KB Output is correct
3 Correct 36 ms 70688 KB Output is correct
4 Correct 34 ms 70656 KB Output is correct
5 Correct 42 ms 70732 KB Output is correct
6 Correct 36 ms 70748 KB Output is correct
7 Correct 35 ms 70776 KB Output is correct
8 Correct 39 ms 70800 KB Output is correct
9 Correct 37 ms 70868 KB Output is correct
10 Correct 38 ms 70996 KB Output is correct
11 Correct 41 ms 71116 KB Output is correct
12 Correct 40 ms 71012 KB Output is correct
13 Correct 38 ms 71056 KB Output is correct
14 Correct 36 ms 71124 KB Output is correct
15 Correct 37 ms 71196 KB Output is correct
16 Correct 37 ms 71508 KB Output is correct
17 Correct 52 ms 73440 KB Output is correct
18 Correct 56 ms 76824 KB Output is correct
19 Correct 66 ms 77756 KB Output is correct
20 Correct 64 ms 77880 KB Output is correct
21 Correct 40 ms 72112 KB Output is correct
22 Correct 59 ms 76928 KB Output is correct
23 Correct 56 ms 76492 KB Output is correct
24 Correct 63 ms 77460 KB Output is correct
25 Correct 61 ms 77720 KB Output is correct
26 Correct 60 ms 77856 KB Output is correct
27 Correct 58 ms 77700 KB Output is correct
28 Correct 67 ms 77852 KB Output is correct
29 Correct 82 ms 77736 KB Output is correct
30 Correct 65 ms 77832 KB Output is correct
31 Correct 66 ms 77772 KB Output is correct
32 Correct 63 ms 77792 KB Output is correct
33 Correct 86 ms 77792 KB Output is correct
34 Correct 88 ms 77912 KB Output is correct
35 Correct 75 ms 76964 KB Output is correct
36 Correct 55 ms 74788 KB Output is correct
37 Correct 102 ms 78988 KB Output is correct
38 Correct 108 ms 79332 KB Output is correct
39 Correct 117 ms 79276 KB Output is correct
40 Correct 96 ms 79288 KB Output is correct
41 Correct 96 ms 79300 KB Output is correct
42 Correct 61 ms 78164 KB Output is correct
43 Correct 65 ms 78136 KB Output is correct
44 Correct 90 ms 78200 KB Output is correct
45 Correct 121 ms 80844 KB Output is correct
46 Correct 115 ms 80872 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70752 KB Output is correct
2 Correct 35 ms 70740 KB Output is correct
3 Correct 39 ms 70668 KB Output is correct
4 Correct 36 ms 70740 KB Output is correct
5 Correct 34 ms 70652 KB Output is correct
6 Correct 32 ms 70792 KB Output is correct
7 Correct 35 ms 70800 KB Output is correct
8 Correct 47 ms 70736 KB Output is correct
9 Correct 43 ms 70872 KB Output is correct
10 Correct 44 ms 71056 KB Output is correct
11 Correct 47 ms 71116 KB Output is correct
12 Correct 36 ms 71028 KB Output is correct
13 Correct 39 ms 71076 KB Output is correct
14 Correct 36 ms 71116 KB Output is correct
15 Correct 35 ms 71076 KB Output is correct
16 Correct 35 ms 71472 KB Output is correct
17 Correct 49 ms 73496 KB Output is correct
18 Correct 59 ms 76892 KB Output is correct
19 Correct 66 ms 77704 KB Output is correct
20 Correct 72 ms 77780 KB Output is correct
21 Correct 41 ms 72188 KB Output is correct
22 Correct 66 ms 76928 KB Output is correct
23 Correct 67 ms 76368 KB Output is correct
24 Correct 68 ms 77488 KB Output is correct
25 Correct 71 ms 77744 KB Output is correct
26 Correct 69 ms 77744 KB Output is correct
27 Correct 67 ms 77728 KB Output is correct
28 Correct 68 ms 77876 KB Output is correct
29 Correct 79 ms 77808 KB Output is correct
30 Correct 66 ms 77688 KB Output is correct
31 Correct 68 ms 77768 KB Output is correct
32 Correct 66 ms 77672 KB Output is correct
33 Correct 104 ms 77888 KB Output is correct
34 Correct 105 ms 77916 KB Output is correct
35 Correct 84 ms 76912 KB Output is correct
36 Correct 57 ms 74764 KB Output is correct
37 Correct 119 ms 78992 KB Output is correct
38 Correct 100 ms 79388 KB Output is correct
39 Correct 115 ms 79356 KB Output is correct
40 Correct 102 ms 79284 KB Output is correct
41 Correct 107 ms 79308 KB Output is correct
42 Correct 68 ms 78080 KB Output is correct
43 Correct 77 ms 78180 KB Output is correct
44 Correct 70 ms 78212 KB Output is correct
45 Correct 124 ms 80820 KB Output is correct
46 Correct 132 ms 80828 KB Output is correct
47 Correct 386 ms 118564 KB Output is correct
48 Correct 336 ms 153404 KB Output is correct
49 Correct 343 ms 160712 KB Output is correct
50 Correct 429 ms 169232 KB Output is correct
51 Correct 560 ms 178660 KB Output is correct
52 Correct 561 ms 178652 KB Output is correct
53 Correct 479 ms 176496 KB Output is correct
54 Correct 426 ms 175488 KB Output is correct
55 Correct 501 ms 175496 KB Output is correct
56 Correct 447 ms 176576 KB Output is correct
57 Correct 628 ms 175652 KB Output is correct
58 Correct 457 ms 175928 KB Output is correct
59 Correct 508 ms 175912 KB Output is correct
60 Correct 471 ms 176352 KB Output is correct
61 Correct 428 ms 176160 KB Output is correct
62 Correct 533 ms 178612 KB Output is correct
63 Correct 630 ms 194240 KB Output is correct
64 Correct 629 ms 200516 KB Output is correct
65 Correct 663 ms 209272 KB Output is correct
66 Execution timed out 1083 ms 207752 KB Time limit exceeded
67 Halted 0 ms 0 KB -