oj.uz

Submission #709904

# Submission time Handle Problem Language Result Execution time Memory
709904 2023-03-14T19:04:00 Z noedit Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 223828 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 = 250;
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)
            {
                short pos1 = pos - pw;
                to.push_back({pos1, pw, 1});
                to.push_back({pos1, 0, 1});
            }
            if (pos + pw < n)
            {
                short pos1 = pos + pw;
                to.push_back({pos1, pw, 1});
                to.push_back({pos1, 0, 1});
            }
            for (auto& [psu, pwu, w] : to)
            {
                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});
                }
            }
        }
        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});
      |                                               ^
skyscraper.cpp:86:37: warning: narrowing conversion of 'pw' from 'std::tuple_element<2, std::array<int, 3> >::type' {aka 'int'} to 'short int' [-Wnarrowing]
   86 |                 to.push_back({pos1, pw, 1});
      |                                     ^~
skyscraper.cpp:92:37: warning: narrowing conversion of 'pw' from 'std::tuple_element<2, std::array<int, 3> >::type' {aka 'int'} to 'short int' [-Wnarrowing]
   92 |                 to.push_back({pos1, pw, 1});
      |                                     ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 176456 KB Output is correct
2 Correct 84 ms 176460 KB Output is correct
3 Correct 78 ms 176452 KB Output is correct
4 Correct 83 ms 176360 KB Output is correct
5 Correct 90 ms 176416 KB Output is correct
6 Correct 85 ms 176404 KB Output is correct
7 Correct 78 ms 176468 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 176468 KB Output is correct
2 Correct 85 ms 176420 KB Output is correct
3 Correct 96 ms 176360 KB Output is correct
4 Correct 85 ms 176428 KB Output is correct
5 Correct 79 ms 176460 KB Output is correct
6 Correct 81 ms 176380 KB Output is correct
7 Correct 81 ms 176436 KB Output is correct
8 Correct 94 ms 176420 KB Output is correct
9 Correct 81 ms 176460 KB Output is correct
10 Correct 82 ms 176480 KB Output is correct
11 Correct 83 ms 176660 KB Output is correct
12 Correct 91 ms 176600 KB Output is correct
13 Correct 82 ms 176528 KB Output is correct
14 Correct 83 ms 176684 KB Output is correct
15 Correct 83 ms 176716 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 176416 KB Output is correct
2 Correct 83 ms 176428 KB Output is correct
3 Correct 84 ms 176380 KB Output is correct
4 Correct 80 ms 176464 KB Output is correct
5 Correct 81 ms 176456 KB Output is correct
6 Correct 80 ms 176464 KB Output is correct
7 Correct 81 ms 176368 KB Output is correct
8 Correct 90 ms 176596 KB Output is correct
9 Correct 82 ms 176460 KB Output is correct
10 Correct 93 ms 176512 KB Output is correct
11 Correct 91 ms 176600 KB Output is correct
12 Correct 80 ms 176588 KB Output is correct
13 Correct 86 ms 176532 KB Output is correct
14 Correct 81 ms 176704 KB Output is correct
15 Correct 82 ms 176628 KB Output is correct
16 Correct 81 ms 176672 KB Output is correct
17 Correct 86 ms 177312 KB Output is correct
18 Correct 81 ms 178112 KB Output is correct
19 Correct 81 ms 178376 KB Output is correct
20 Correct 83 ms 178476 KB Output is correct
21 Correct 80 ms 176844 KB Output is correct
22 Correct 81 ms 178228 KB Output is correct
23 Correct 84 ms 178032 KB Output is correct
24 Correct 93 ms 178380 KB Output is correct
25 Correct 91 ms 178460 KB Output is correct
26 Correct 87 ms 178428 KB Output is correct
27 Correct 83 ms 178368 KB Output is correct
28 Correct 89 ms 178504 KB Output is correct
29 Correct 99 ms 178432 KB Output is correct
30 Correct 88 ms 178380 KB Output is correct
31 Correct 91 ms 178468 KB Output is correct
32 Correct 90 ms 178432 KB Output is correct
33 Correct 119 ms 178624 KB Output is correct
34 Correct 117 ms 178584 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 176424 KB Output is correct
2 Correct 82 ms 176448 KB Output is correct
3 Correct 80 ms 176356 KB Output is correct
4 Correct 86 ms 176444 KB Output is correct
5 Correct 92 ms 176368 KB Output is correct
6 Correct 81 ms 176468 KB Output is correct
7 Correct 81 ms 176464 KB Output is correct
8 Correct 81 ms 176436 KB Output is correct
9 Correct 83 ms 176460 KB Output is correct
10 Correct 93 ms 176556 KB Output is correct
11 Correct 87 ms 176588 KB Output is correct
12 Correct 82 ms 176572 KB Output is correct
13 Correct 93 ms 176484 KB Output is correct
14 Correct 88 ms 176680 KB Output is correct
15 Correct 86 ms 176696 KB Output is correct
16 Correct 86 ms 176664 KB Output is correct
17 Correct 85 ms 177224 KB Output is correct
18 Correct 85 ms 178208 KB Output is correct
19 Correct 82 ms 178380 KB Output is correct
20 Correct 85 ms 178400 KB Output is correct
21 Correct 82 ms 176808 KB Output is correct
22 Correct 83 ms 178212 KB Output is correct
23 Correct 84 ms 178076 KB Output is correct
24 Correct 86 ms 178356 KB Output is correct
25 Correct 83 ms 178476 KB Output is correct
26 Correct 84 ms 178352 KB Output is correct
27 Correct 83 ms 178380 KB Output is correct
28 Correct 86 ms 178428 KB Output is correct
29 Correct 109 ms 178408 KB Output is correct
30 Correct 87 ms 178508 KB Output is correct
31 Correct 92 ms 178380 KB Output is correct
32 Correct 89 ms 178396 KB Output is correct
33 Correct 115 ms 178508 KB Output is correct
34 Correct 116 ms 178484 KB Output is correct
35 Correct 112 ms 179020 KB Output is correct
36 Correct 90 ms 177740 KB Output is correct
37 Correct 136 ms 179708 KB Output is correct
38 Correct 124 ms 179924 KB Output is correct
39 Correct 128 ms 180048 KB Output is correct
40 Correct 133 ms 180028 KB Output is correct
41 Correct 124 ms 180028 KB Output is correct
42 Correct 94 ms 178936 KB Output is correct
43 Correct 87 ms 178980 KB Output is correct
44 Correct 85 ms 178980 KB Output is correct
45 Correct 251 ms 180832 KB Output is correct
46 Correct 253 ms 180800 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 176432 KB Output is correct
2 Correct 87 ms 176428 KB Output is correct
3 Correct 91 ms 176376 KB Output is correct
4 Correct 82 ms 176348 KB Output is correct
5 Correct 82 ms 176460 KB Output is correct
6 Correct 81 ms 176384 KB Output is correct
7 Correct 86 ms 176460 KB Output is correct
8 Correct 93 ms 176440 KB Output is correct
9 Correct 81 ms 176460 KB Output is correct
10 Correct 93 ms 176484 KB Output is correct
11 Correct 96 ms 176548 KB Output is correct
12 Correct 91 ms 176600 KB Output is correct
13 Correct 96 ms 176596 KB Output is correct
14 Correct 99 ms 176636 KB Output is correct
15 Correct 92 ms 176664 KB Output is correct
16 Correct 92 ms 176672 KB Output is correct
17 Correct 95 ms 177316 KB Output is correct
18 Correct 83 ms 178220 KB Output is correct
19 Correct 82 ms 178448 KB Output is correct
20 Correct 82 ms 178456 KB Output is correct
21 Correct 80 ms 176792 KB Output is correct
22 Correct 84 ms 178268 KB Output is correct
23 Correct 83 ms 178124 KB Output is correct
24 Correct 86 ms 178432 KB Output is correct
25 Correct 85 ms 178480 KB Output is correct
26 Correct 88 ms 178380 KB Output is correct
27 Correct 96 ms 178480 KB Output is correct
28 Correct 87 ms 178544 KB Output is correct
29 Correct 101 ms 178380 KB Output is correct
30 Correct 87 ms 178460 KB Output is correct
31 Correct 109 ms 178404 KB Output is correct
32 Correct 91 ms 178508 KB Output is correct
33 Correct 120 ms 178512 KB Output is correct
34 Correct 118 ms 178620 KB Output is correct
35 Correct 108 ms 179008 KB Output is correct
36 Correct 107 ms 177700 KB Output is correct
37 Correct 149 ms 179704 KB Output is correct
38 Correct 130 ms 179976 KB Output is correct
39 Correct 136 ms 180028 KB Output is correct
40 Correct 135 ms 179916 KB Output is correct
41 Correct 125 ms 179972 KB Output is correct
42 Correct 102 ms 178948 KB Output is correct
43 Correct 93 ms 178928 KB Output is correct
44 Correct 99 ms 178996 KB Output is correct
45 Correct 254 ms 180728 KB Output is correct
46 Correct 267 ms 180828 KB Output is correct
47 Correct 326 ms 192316 KB Output is correct
48 Correct 107 ms 200628 KB Output is correct
49 Correct 103 ms 202508 KB Output is correct
50 Correct 113 ms 204748 KB Output is correct
51 Correct 203 ms 208580 KB Output is correct
52 Correct 217 ms 208580 KB Output is correct
53 Correct 132 ms 206828 KB Output is correct
54 Correct 97 ms 205728 KB Output is correct
55 Correct 107 ms 205756 KB Output is correct
56 Correct 115 ms 206956 KB Output is correct
57 Correct 288 ms 206132 KB Output is correct
58 Correct 127 ms 206300 KB Output is correct
59 Correct 133 ms 206372 KB Output is correct
60 Correct 140 ms 206388 KB Output is correct
61 Correct 128 ms 206356 KB Output is correct
62 Correct 224 ms 208420 KB Output is correct
63 Correct 332 ms 223652 KB Output is correct
64 Correct 596 ms 223828 KB Output is correct
65 Execution timed out 1092 ms 220620 KB Time limit exceeded
66 Halted 0 ms 0 KB -